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;
set<int> Graph[1509];
void initialize(int n) {
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
if(j == i) continue;
Graph[i].insert(j);
Graph[j].insert(i);
}
}
}
int hasEdge(int u, int v) {
if(Graph[u].size() == 1 && Graph[v].size() == 1){
return 1;
}
Graph[u].erase(v);
Graph[v].erase(u);
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... |