This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "game.h"
using namespace std;
vector<int> cnt(1500);
vector<bool> included(1500);
int n;
int hasEdge(int u, int v){
cnt[u]++;
cnt[v]++;
if ((cnt[u] == n-1 && !included[u]) || (!included[v] && cnt[v] == n-1)){
included[v] = true;
included[u] = true;
return 1;
}
return 0;
}
void initialize(int N){
n = N;
for (int i = 0; i < n; i++){
cnt[i] = 0;
included[i] = false;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |