Submission #1006484

#TimeUsernameProblemLanguageResultExecution timeMemory
1006484kebineGame (IOI14_game)C++17
100 / 100
191 ms9036 KiB
#include<bits/stdc++.h> using namespace std; int freq[2000] ={0}; int hasEdge(int u,int v){ freq[max(u,v)]++; return freq[max(u,v)] == max(u,v); } void initialize(int n){ }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...