# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
586034 | almothana05 | Connecting Supertrees (IOI20_supertrees) | C++14 | 179 ms | 22220 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<bits/stdc++.h>
using namespace std;
vector<vector<int> >erg;
vector<int>cmp[2000];
int vis[2000];
int construct(vector<vector<int>> p) {
int menge = p.size() , pl = 1;
for(int i = 0 ; i < menge ; i++){
erg.push_back(vector<int>() );
for(int j = 0 ; j < menge ; j++){
erg[i].push_back(0);
}
}
for(int i = 0 ; i < menge ; i++){
p[i][i] = 1;
}
for(int i = 0 ; i < menge ; i++){
if(vis[i] == 0){
vis[i] = pl;
for(int j = 0 ; j < menge ; j++){
if(p[i][j] == 1){
cmp[pl].push_back(j);
vis[j] = pl;
}
}
int fl = 1;
for(int j = 0 ; j < menge ; j++){
for(int k = 0 ; k < cmp[pl].size() ; k++){
if(p[i][j] != p[cmp[pl][k]][j]){
fl = 0;
break;
}
}
}
for(int j = 0 ; j < cmp[pl].size() - 1 ; j++){
erg[cmp[pl][j]][cmp[pl][j + 1]] = 1;
erg[cmp[pl][j + 1]][cmp[pl][j]] = 1;
}
if(fl == 0){
return 0;
}
pl++;
}
}
build(erg);
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... |