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"
#define for0(i, n) for(int i = 0; i < int(n); ++ i)
#define pb push_back
using namespace std;
typedef vector<int> vi;
const int maxn = 15e2;
int ignorados[maxn];
void initialize(int n) {
}
int hasEdge(int u, int v) {
if(++ignorados[max(u, v)] == max(u, v)){
return 1;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |