Submission #1006459

#TimeUsernameProblemLanguageResultExecution timeMemory
1006459andecaandeciGame (IOI14_game)C++17
0 / 100
0 ms348 KiB
#include<bits/stdc++.h> using namespace std; int N; int que[2000] ={0}; bool hasEdge(int u,int v){ que[u]++; que[v]++; if(que[u] == N-1 || que[v] == N-1){ return 1; }else{ return 0; } } void initialize(int n){ N = n; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...