LeetCode Biweekly Contest 5
問題文
省略
省略
#include<bits/stdc++.h>
using namespace std;
void *wmem;
template<class T> inline void walloc1d(T **arr, int x, void **mem = &wmem){
static int skip[16]={0, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
(*mem) = (void*)( ((char*)(*mem)) + skip[((unsigned long long)(*mem)) & 15] );
(*arr)=(T*)(*mem);
(*mem)=((*arr)+x);
}
template<class S, class T> inline S chmax(S &a, T b){
if(a<b){
a=b;
}
return a;
}
struct graph{
int N, **edge, *es;
void setEdge(int N__, int M, int A[], int B[], void **mem = &wmem){
int i;
N = N__;
walloc1d(&es, N, mem);
walloc1d(&edge, N, mem);
for(i=0;i<(N);i++){
es[i] = 0;
}
for(i=0;i<(M);i++){
es[A[i]]++;
es[B[i]]++;
}
for(i=0;i<(N);i++){
walloc1d(&edge[i], es[i], mem);
}
for(i=0;i<(N);i++){
es[i] = 0;
}
for(i=0;i<(M);i++){
edge[A[i]][es[A[i]]++] = B[i];
edge[B[i]][es[B[i]]++] = A[i];
}
}
void setDirectEdge(int N__, int M, int A[], int B[], void **mem = &wmem){
int i;
N = N__;
walloc1d(&es, N, mem);
walloc1d(&edge, N, mem);
walloc1d(&edge[0], M, mem);
for(i=0;i<(N);i++){
es[i] = 0;
}
for(i=0;i<(M);i++){
es[A[i]]++;
}
for(i=0;i<(N);i++){
walloc1d(&edge[i], es[i], mem);
}
for(i=0;i<(N);i++){
es[i] = 0;
}
for(i=0;i<(M);i++){
edge[A[i]][es[A[i]]++] = B[i];
}
}
graph reverse(void **mem = &wmem){
graph g;
int i, j, k;
g.N = N;
walloc1d(&g.es, N, mem);
walloc1d(&g.edge, N, mem);
for(i=0;i<(N);i++){
g.es[i] = 0;
}
for(i=0;i<(N);i++){
for(j=0;j<(es[i]);j++){
g.es[edge[i][j]]++;
}
}
for(i=0;i<(N);i++){
walloc1d(&g.edge[i], g.es[i]);
}
for(i=0;i<(N);i++){
g.es[i] = 0;
}
for(i=0;i<(N);i++){
for(j=0;j<(es[i]);j++){
k = edge[i][j];
g.edge[k][g.es[k]++] = i;
}
}
return g;
}
graph reduce(int tn, int ind[], int self_e = 0, int dep_e = 0, void **mem = &wmem){
graph g;
int M=0, i, j, k, x, y;
pair<int,int> *A;
for(i=0;i<(N);i++){
M += es[i];
}
A = (pair<int,int>*)((int*)((int**)(*mem) + tn) + tn + M);
M = 0;
for(i=0;i<(N);i++){
x = ind[i];
if(x < 0){
continue;
}
for(j=0;j<(es[i]);j++){
y = ind[edge[i][j]];
if(y < 0){
continue;
}
if(self_e==0 && x==y){
continue;
}
A[M++] = make_pair(x, y);
}
}
if(dep_e==0){
sort(A, A+M);
k = 0;
for(i=0;i<(M);i++){
if(k && A[k-1]==A[i]){
continue;
}
A[k++] = A[i];
}
M = k;
}
g.N = tn;
g.es = (int*)(*mem);
g.edge = (int**)(g.es + tn);
g.edge[0] = (int*)(g.edge + tn);
for(i=0;i<(tn);i++){
g.es[i] = 0;
}
for(i=0;i<(M);i++){
g.es[A[i].first]++;
}
for(i=(1);i<(tn);i++){
g.edge[i] = g.edge[i-1] + g.es[i-1];
}
*mem = g.edge[tn-1] + g.es[tn-1];
for(i=0;i<(tn);i++){
g.es[i] = 0;
}
for(i=0;i<(M);i++){
j = A[i].first;
k = A[i].second;
g.edge[j][g.es[j]++] = k;
}
return g;
}
void getDist(int root, int res[], void *mem = wmem){
int i, j, k, *q, s, z;
walloc1d(&q, N, &mem);
for(i=0;i<(N);i++){
res[i]=-1;
}
res[root]=0;
s=0;
z=1;
q[0]=root;
while(z){
i=q[s++];
z--;
for(j=0;j<(es[i]);j++){
k=edge[i][j];
if(res[k]>=0){
continue;
}
res[k]=res[i]+1;
q[s+z++]=k;
}
}
}
inline int sccDFS(int num[], int st, int mx){
int i, j;
num[st]=-2;
for(i=0;i<(es[st]);i++){
j=edge[st][i];
if(num[j]==-1){
mx=sccDFS(num,j,mx);
}
}
num[st]=mx;
return mx+1;
}
int scc(int res[], void *mem = wmem){
graph r;
int i, j, k, *nrv, *num, ret=0, *st, st_size;
r = reverse(&mem);
walloc1d(&st, N, &mem);
walloc1d(&num, N, &mem);
walloc1d(&nrv, N, &mem);
for(i=0;i<(N);i++){
res[i] = num[i] = -1;
}
k = 0;
for(i=0;i<(N);i++){
if(num[i]==-1){
k = sccDFS(num,i,k);
}
}
for(i=0;i<(N);i++){
nrv[num[i]] = i;
}
for(k=N-1;k>=0;k--){
i=nrv[k];
if(res[i]>=0){
continue;
}
res[i]=ret;
st_size=0;
st[st_size++]=i;
while(st_size){
i=st[--st_size];
for(j=0;j<(r.es[i]);j++){
if(res[r.edge[i][j]]==-1){
res[r.edge[i][j]]=ret;
st[st_size++]=r.edge[i][j];
}
}
}
ret++;
}
return ret;
}
inline void bccDFS(int v, int u, int *res, int *rt, int &rts, int *S, int &Ss, int *inS, int *num, int &tm){
int i, k;
num[v] = ++tm;
S[Ss++] = v;
inS[v] = 1;
rt[rts++] = v;
for(i=0;i<(es[v]);i++){
int w=edge[v][i];
if(!num[w]){
bccDFS(w, v, res, rt, rts, S, Ss, inS, num, tm);
}
else if(u != w && inS[w]){
while(num[rt[rts-1]] > num[w]){
rts--;
}
}
}
if(v == rt[rts-1]){
k = S[Ss-1];
for(;;){
int w=S[--Ss];
inS[w] = 0;
res[w] = k;
if(v==w){
break;
}
}
rts--;
}
}
int bcc(int res[], void *mem=wmem){
int *S, Ss=0, i, *inS, k, *num, *rt, rts=0, tm=0;
pair<int,int> *arr;
walloc1d(&num, N, &mem);
walloc1d(&rt, N, &mem);
walloc1d(&S, N, &mem);
walloc1d(&inS, N, &mem);
memset(num, 0, sizeof(int)*N);
memset(inS, 0, sizeof(int)*N);
for(i=0;i<(N);i++){
if(!num[i]){
bccDFS(i, N, res, rt, rts, S, Ss, inS, num, tm);
}
}
arr = (pair<int,int>*)mem;
for(i=0;i<(N);i++){
arr[i].first = res[i];
arr[i].second = i;
}
sort(arr, arr+N);
k = 0;
for(i=0;i<(N);i++){
if(i && arr[i].first != arr[i-1].first){
k++;
}
res[arr[i].second] = k;
}
return k+1;
}
int shortestPath(const int s, const int t, int res[], void *mem=wmem){
int *b, i, j, k, *q, qe=0, qs=0;
walloc1d(&b, N, &mem);
walloc1d(&q, N, &mem);
for(i=0;i<(N);i++){
b[i] = -1;
}
b[s] = -2;
q[qe++] = s;
while(qe > qs){
i = q[qs++];
for(j=0;j<(es[i]);j++){
k = edge[i][j];
if(b[k]!=-1){
continue;
}
b[k] = i;
q[qe++] = k;
}
if(b[t]!=-1){
break;
}
}
if(b[t]==-1){
return -1;
}
k = 0;
res[k] = i = t;
while(i != s){
res[++k] = (i = b[i]);
}
std::reverse(res, res+k+1);
return k;
}
int TopologicalSort(int res[], void *mem=wmem){
int *deg, i, j, k, *q, qe=0, qs=0, rs;
walloc1d(°, N, &mem);
walloc1d(&q, N, &mem);
rs = 0;
for(i=0;i<(N);i++){
deg[i] = 0;
}
for(i=0;i<(N);i++){
for(j=0;j<(es[i]);j++){
deg[edge[i][j]]++;
}
}
for(i=0;i<(N);i++){
if(deg[i]==0){
q[qe++] = i;
}
}
while(qs < qe){
i = q[qs++];
res[rs++] = i;
for(j=0;j<(es[i]);j++){
k = edge[i][j];
deg[k]--;
if(deg[k]==0){
q[qe++] = k;
}
}
}
if(rs==N){
return 1;
}
return 0;
}
}
;
char memarr[96000000];
int M;
int A[5000];
int B[5000];
int dp[5001];
int ind[5001];
int main2(){
wmem = memarr;
return 0;
}
class Solution{
public:
int minimumSemesters(int N, vector<vector<int>>& relations){
main2();
graph g;
int i, j, res=-1;
void *mem=wmem;
M = relations.size();
for(i=0;i<(M);i++){
A[i] = relations[i][0] - 1;
B[i] = relations[i][1] - 1;
}
g.setDirectEdge(N, M, A, B);
res = -1;
if(g.TopologicalSort(ind)){
int k;
for(i=0;i<(N);i++){
dp[i] = 1;
}
for(k=0;k<(N);k++){
i = ind[k];
for(j=0;j<(g.es[i]);j++){
chmax(dp[g.edge[i][j]], dp[i] + 1);
}
}
for(i=0;i<(N);i++){
chmax(res, dp[i]);
}
}
wmem = mem;
return res;
}
}
;
// cLay varsion 20190802-1
// --- original code ---
// int M, A[5000], B[5000];
//
// int dp[5001], ind[5001];
//
// class Solution {
// public:
// int minimumSemesters(int N, vector<vector<int>>& relations) {
// int i, j, res = -1;
// graph g;
// void *mem = wmem;
//
// M = relations.size();
// rep(i,M){
// A[i] = relations[i][0] - 1;
// B[i] = relations[i][1] - 1;
// }
// g.setDirectEdge(N, M, A, B);
//
// res = -1;
// if(g.TopologicalSort(ind)){
// rep(i,N) dp[i] = 1;
// rep(k,N){
// i = ind[k];
// rep(j,g.es[i]) dp[g.edge[i][j]] >?= dp[i] + 1;
// }
// rep(i,N) res >?= dp[i];
// }
//
// wmem = mem;
// return res;
// }
// };
//
// {
// // main関数を適当に処理する
// }
Current time: 2024年04月19日03時48分27秒
Last modified: 2019年08月10日16時43分45秒 (by laycrs)
Tags: Competitive_Programming_Incomplete LeetCode
トップページに戻る
Logged in as: unknown user (not login)