Submission #926899

#TimeUsernameProblemLanguageResultExecution timeMemory
926899NurislamGame (IOI14_game)C++14
0 / 100
0 ms348 KiB
#include<bits/stdc++.h> using namespace std; const int N = 1600; set<long long> g[N]; void initialize(int n) { for(long long i = n-1; i >= 0; i--){ for(long long j = 0; j < i; j++){ g[i].insert(j); g[j].insert(i); } } } int hasEdge(int u, int v) { if(g[u].size() == 1 || g[v].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...