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;
int small[1501];
void initialize(int n) {
for(int i = 1; i < n; i++) small[i] = i-1;
}
int hasEdge(int u, int v) {
if(small[max(u, v)]) small[max(u, v)]--;
else 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... |