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 "game.h"
#include <algorithm>
using namespace std;
const int MAX_N = 2e3 + 100;
int cnt = 0;
int Nr[MAX_N];
void initialize(int n) {
cnt = 0;
for(int i=0; i<n; i++) Nr[i] = 0;
}
int hasEdge(int u, int v) {
return ++Nr[max(u, v)] == max(u, v);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |