Submission #568367

#TimeUsernameProblemLanguageResultExecution timeMemory
568367losmi247Game (IOI14_game)C++14
100 / 100
328 ms16328 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int N = 1502; int n; int cnt = 0,kolko[N]; void initialize(int br){ n = br; cnt = 0; for(int i = 0; i <= n; i++) kolko[i] = 0; } int hasEdge(int u,int v){ u++; v++; cnt++; if(u < v) swap(u,v); kolko[u]++; return kolko[u] == u-1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...