Submission #380632

#TimeUsernameProblemLanguageResultExecution timeMemory
380632sumit_kk10Game (IOI14_game)C++14
100 / 100
393 ms8300 KiB
#include <bits/stdc++.h> using namespace std; const int N = 1500; int cnt[N], ct[N], nn; void initialize(int n){ nn = n; for(int i = 0; i <= n; ++i){ cnt[i] = 0; ct[i] = 0; } } int hasEdge(int u, int v){ int node = max(u, v); cnt[node]++; if(cnt[node] == node) return 1; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...