Submission #349255

#TimeUsernameProblemLanguageResultExecution timeMemory
349255David_MGame (IOI14_game)C++14
0 / 100
0 ms364 KiB
#include "game.h" #include <algorithm> #include <queue> using namespace std; int a[1500], N; bool b[1500][1500]; void initialize(int n){ N=n; for (int i=1; i<n; i++)a[i]=1; } int hasEdge(int u, int v){ bool e=0; if(a[u])swap(v, u); if(!a[u]){ a[v]--; if(!a[v]){ e=1; for (int i=0; i<N; i++)a[i]+=(!b[v][i]&&(i!=v)); } }else b[v][u]=b[u][v]=1; return e; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...