| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 366955 | MilosMilutinovic | Connecting Supertrees (IOI20_supertrees) | C++14 | 0 ms | 0 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 <bits/stdc++.h>
#include "supertrees.h"
using namespace std;
#define pb push_back
const int N=1050;
vector<int> E[N];
void AddEdge(int u,v){E[u].pb(v),E[v].pb(u);}
bool was[N];
vector<int> comp;
void DFS(int u){
was[u]=true,comp.push_back(u);
for(int v:E[u])if(!was[v])DFS(v);
}
int construct(vector<vector<int>> p){
int n=(int)p.size();
for(int i=0;i<n;i++)for(int j=0;j<n;j++)if(p[i][j]==3)return 0;
for(int i=0;i<n;i++)for(int j=i;j<n;j++)if(p[i][j]>0)AddEdge(i,j);
int ans[n][n];
for(int i=0;i<n;i++){
if(!was[i]){
DFS(i);
for(int x:comp){
for(int y:comp)if(x!=y&&p[x][y]==0)return 0;
}
comp.clear();
}
}
build(ans);
return 1;
}
