# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
637280 | fadi57 | Connecting Supertrees (IOI20_supertrees) | C++14 | 1096 ms | 14028 KiB |
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 "supertrees.h"
#include <vector>
//#include "grader.cpp"
#include<bits/stdc++.h>
using namespace std;
const int mx=1e5+5;
int par[mx],par2[mx];std::vector<std::vector<int>> answer; int ok=1;int n;
void init(int n){
for(int i=0;i<=n;i++){
par[i]=i;
par2[i]=i;
}
}
int fin(int a){
if(par[a]==a){
return a;
}else{
return fin(par[a]);
}
}
int fin2(int a){
if(par2[a]==a){
return a;
}else{
return fin2(par2[a]);
}
}
int uni(int a,int b){
a=fin(a); b=fin(b);
if(a==b){return 1;}
par[a]=b;
return 0;
}
int uni2(int a,int b){
a=fin2(a); b=fin2(b);
if(a==b){return 1;}
par2[a]=b;
return 0;
}
int conect(int x){
vector<int>v,nodes[mx];
// cout<<"TEST "<<x<<endl;
for(int i=0;i<n;i++){
if(fin(i)==x){
int y=fin2(i);
// cout<<i<<" "<<y<<endl;;
v.push_back(i);
}
}
set<int>tree;
for(int i=0;i<v.size();i++){
// tree.insert(fin2(v[i]));
int x=fin2(v[i]);
nodes[x].push_back(v[i]);
}
vector<int>heads;
for(int i=0;i<n;i++){
if(nodes[i].size()!=0){
heads.push_back(i);
for(int j=0;j<nodes[i].size()-1;j++){
int me= nodes[i][j];int nxt=nodes[i][j+1];
answer[me][nxt]=answer[nxt][me]=1;
}
}
}
// cout<<" hello "<<heads.size()<<endl;
if(heads.size()==2){ok=0;return 0;}
if(heads.size()==1){return 0;}
for(int i=0;i<heads.size();i++){
// cout<<" helo "<<heads[i]<<endl;
int me=heads[i];int nxt=heads[(i+1)%heads.size()];
answer[me][nxt]=1; answer[nxt][me]=1;
}
return 0;
}
int construct(vector<vector<int>> p) {
n = p.size();
init(n);
for (int i = 0; i < n; i++) {
std::vector<int> row;
row.resize(n);
answer.push_back(row);
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(p[i][j]) uni(i,j);
if(p[i][j]==1){uni2(i,j);}
}
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(p[i][j]==0&&uni(i,j))ok=0;
}
}
if(ok==0){return 0;}
vector<int>comp[n+5];
for(int i=0;i<n;i++){
conect(i);
if(ok==0){return 0;}
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
// cout<<answer[i][j]<<" ";
}
// cout<<endl;
}
build(answer);
return 1;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |