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>
using namespace std;
set<int> g[1501];
void initialize(int n) {
for(long long i = 1; i <= n; i++){
for(long long j = 1; j <= n; j++){
if(i == j)continue;
g[i].insert(j);
}
}
}
int hasEdge(int u, int v) {
if(u < v)swap(u, v);
if(g[u].size() == 1 || g[v].size() == 1)return 1;
g[u].erase(v);
g[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... |