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 <bits/stdc++.h>
using namespace std;
#define sz(x) (int)(x.size())
const int MX = 1505;
unordered_set<int> myset[MX];
void initialize(int n) {
for (int i = 0; i < n; ++i)
for (int j = i+1; j < n; ++j)
myset[i].insert(j);
}
int hasEdge(int u, int v) {
if(u>v)swap(u,v);
myset[u].erase(v);
if(!sz(myset[u]))
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... |