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;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define pb push_back
#define mp make_pair
#define f first
#define s second
vector<int> a;
int hasEdge(int u, int v) {
a[u]--; a[v]--;
if(a[u] == 0 || a[v] == 0)
return 0;
return 1;
}
void initialize(int n) {
a = vi(n, n-1);
for(int i = 0; i < n*(n-1)/2; i++){
int u, v;
cin >> u >> v;
cout << hasEdge(u, v) << '\n' << flush;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |