| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 367454 | 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>
using namespace std;
#define pb push_back
const int N=1050;
vector<int> E[N];
vector<vector<int>> p,ans;
void AddEdge(int u,int v){E[u].pb(v);E[v].pb(u);}
bool was[N];
vector<int> euler;
void DFS1(int u){
was[u]=true;
euler.pb(u);
for(int e:E[u])if(!was[e]&&p[u][e]==1)DFS1(e);
}
void construct(vector<vector<int>> P){
int n=(int)P.size();p=P;
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=0;j<n;j++)if(p[i][j]>0)AddEdge(i,j);
for(int i=0;i<n;i++)if(!was[i]){
DFS1(i);
for(int x:euler)for(int y:euler)if(x!=y&&p[x][y]==0)return 0;
for(int i=1;i<(int)euler.size();i++){
int from=euler[i],to=euler[i-1];
ans[from][to]=ans[to][from]=1;
}
euler.clear();
}
memset(was,false,sizeof(was));
for(int i=0;i<n;i++)if(!was[i]){
DFS2(i);
if((int)euler.size()==1){
euler.clear();
continue;
}
if((int)euler.size()==2)return 0;
for(int x:euler)for(int y:euler)if(x!=y&&p[x][y]==0)return 0;
for(int i=0;i<(int)euler.size();i++){
int from=euler[i],to=euler[i-1];
ans[from][to]=ans[to][from]=1;
}
int from=euler[0],to=euler.back();
ans[from][to]=ans[to][from]=1;
euler.clear();
}
build(ans);
return 1;
}
int main(){
return 0;
}