Submission #1006445

#TimeUsernameProblemLanguageResultExecution timeMemory
1006445andecaandeciGame (IOI14_game)C++17
42 / 100
20 ms3684 KiB
#include<bits/stdc++.h> using namespace std; const int maxn = 1505; int freq[maxn]; int N; void initialize(int n) { N = n; } bool hasEdge(int u, int v) { freq[max(u, v)]++; return freq[max(u, v)] == max(u, v); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...