Submission #571729

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