Submission #584936

#TimeUsernameProblemLanguageResultExecution timeMemory
584936Newtech66Game (IOI14_game)C++17
0 / 100
1 ms256 KiB
#include<bits/stdc++.h> using namespace std; int n; vector<set<int> > g; void initialize(int N) { n=N; g.resize(n); for(int i=0;i<n;i++) { for(int j=0;j<n;j++) { if(i==j) continue; g[i].insert(j); } } } int hasEdge(int u,int v) { if(g[u].find(v)==g[u].end()) return 0; if(g[u].size()==1 || g[v].size()==1) { g[u].erase(v); g[v].erase(u); return 1; }else { 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...