Submission #926887

#TimeUsernameProblemLanguageResultExecution timeMemory
926887NurislamGame (IOI14_game)C++17
0 / 100
1 ms348 KiB
#include<bits/stdc++.h> using namespace std; #include<bits/stdc++.h> using namespace std; const int N = 1600; set<int> g[N]; void initialize(int n) { for(int i = 0; i < n; i++){ for(int j = i+1; j < n; j++){ g[i].insert(j); g[j].insert(i); } } } int hasEdge(int u, int v) { if(g[u].size() == 1)return 1; g[u].erase(v); g[v].erase(u); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...