Submission #298764

#TimeUsernameProblemLanguageResultExecution timeMemory
298764Genius1506Game (IOI14_game)C++14
100 / 100
589 ms25336 KiB
#include<bits/stdc++.h> using namespace std; const int mxN = 1506; int n,chu[mxN][mxN],s[mxN],c[mxN]={1}; void initialize(int n){ ::n = n; for(int i = 0; i < n; i++){ for(int j = 0; j < n; j++) chu[i][j]=1; } for(int i = 1; i < n; i++) s[i]=1; } int hasEdge(int u, int v){ chu[u][v]=chu[v][u]=0; if(c[v]) swap(u,v); if(c[u]) s[v]--; if(!s[v]){ c[v] = 1; for(int i = 0; i < n; i++){ if(chu[i][v]) s[i]++; } } return c[v]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...