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 N = 1500;
int cnt[N], ct[N], nn;
void initialize(int n){
nn = n;
for(int i = 0; i <= n; ++i){
cnt[i] = 0;
ct[i] = 0;
}
}
int hasEdge(int u, int v){
int node = max(u, v);
cnt[node]++;
if(cnt[node] == node) 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... |