Submission #1006475

#TimeUsernameProblemLanguageResultExecution timeMemory
1006475kebineGame (IOI14_game)C++17
42 / 100
20 ms2924 KiB
#include <bits/stdc++.h> // #define int long long // #define fi first // #define se second using namespace std; /* n = 4 0 1 0 2 0 3 1 2 1 3 2 3 */ int n; vector<int> cnt; void initialize(int x) { n = x; cnt.resize(n); } bool hasEdge(int u, int v) { ++cnt[max(u, v)]; return cnt[max(u, v)] == max(u, v); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...