Submission #146588

#TimeUsernameProblemLanguageResultExecution timeMemory
146588karma게임 (IOI14_game)C++11
0 / 100
2 ms380 KiB
#include <bits/stdc++.h> #include "game.h" using namespace std; int cnt[2000], n, full = 0; int hasEdge(int u, int v) { ++cnt[u], ++cnt[v]; if(cnt[u] == n) ++full; if(cnt[v] == n) ++full; if(full < n - 1 && (cnt[u] == n || cnt[v] == n)) return 1; return 0; } void initialize(int _n) { n = _n; full = 0; fill(cnt, cnt + n + 2, 0); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...