Submission #92185

#TimeUsernameProblemLanguageResultExecution timeMemory
92185CPXGame (IOI14_game)C++14
0 / 100
2 ms420 KiB
bool vis[2000][2000]; int val[2000][2000]; int ctr[2000]; int n; void initialize(int n) { ::n=n; for(int i = 0 ; i<= n ; i++)vis[i][i]=1; } int hasEdge(int u, int v) { if(vis[u][v])return val[u][v]; vis[u][v]=vis[v][u]=1; ctr[u]++; ctr[v]++; if(ctr[u]>n-2||ctr[v]>n-2){ val[u][v]=val[v][u]=1; return 1; }else{ val[u][v]=val[v][u]=0; return 0; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...