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;
const int c=1502;
int db[c], cnt, n;
bool v[c], e[c][c];
bool hasEdge(int a, int b) {
if (v[b]) swap(a, b);
if (!v[a]) {
e[a][b]=1, e[b][a]=1;
return 0;
}
if (db[b]!=cnt) {
db[b]++;
return 0;
}
v[b]=1, cnt++;
for (int i=0; i<n; i++) db[i]+=e[b][i];
return 1;
}
void initialize(int w) {
n=w, v[0]=1;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |