Submission #713452

#TimeUsernameProblemLanguageResultExecution timeMemory
713452Spade1Game (IOI14_game)C++14
15 / 100
4 ms700 KiB
#include <bits/stdc++.h> #include "game.h" //#include "grader.cpp" using namespace std; const int maxN = 2000; set<int> s[maxN]; bool mark[maxN]; void initialize(int n) { for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { if (i == j) continue; s[i].insert(j); s[j].insert(i); } } } void dfs(int i) { if (mark[i]) return; mark[i] = 1; for (auto j : s[i]) { s[j].erase(i); if (s[j].size() == 1) dfs(j); } } int hasEdge(int u, int v) { if (s[u].size() != 1) swap(u, v); if (s[u].size() == 1) { s[u].erase(v); s[v].erase(u); return 1; } s[u].erase(v); s[v].erase(u); if (s[u].size() == 1) dfs(u); if (s[v].size() == 1) dfs(v); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...