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;
vector<vector<bool>> a;
vector<vector<int>> c;
void initialize(int n){
a.resize(n);
c.resize(n);
for(auto& i : a) i.resize(n, false);
}
int hasEdge(int u, int v){
a[u][v] = a[v][u] = true;
if(find(c[u].begin(), c[u].end(), v) != c[u].end()) return 1;
auto uc = c[u], vc = c[v];
uc.push_back(u);
vc.push_back(v);
for(int i : uc) for(int j : vc) {
if(!a[i][j]) return 0;
}
for(int i : uc){
for(int j : vc){
c[j].push_back(i);
c[i].push_back(j);
}
}
return 1;
}
// int main(){
// int n, u,v;
// cin >> n;
// initialize(n);
// for(int i = 0;i < n * (n-1) / 2;i++){
// cin >> u >> v;
// cout << hasEdge(u, v) << '\n';
// }
// }
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |