# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
367113 | 2021-02-16T10:12:59 Z | MilosMilutinovic | Connecting Supertrees (IOI20_supertrees) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; #define pb push_back const int N=1050; vector<int> E[N]; vector<vector<int>> p; void AddEdge(int u,int v){E[u].pb(v);E[v].pb(u);} vector<int> Euler; bool was[N]; void DFS1(int u){ was[u]=true,Euler.pb(u); for(int v:E[u])if(!was[v]&&p[u][v]==1)DFS1(v); } int construct(vector<vector<int>> P){ p=P;int n=(int)P.size(); bool one=false,two=false; for(int i=0;i<n;i++)for(int j=0;j<n;j++)if(p[i][j]==1)one=true; for(int i=0;i<n;i++)for(int j=0;j<n;j++)if(p[i][j]==2)two=true; int ans[n][n]; if(!one&&!two){build(ans);return 1;} if(one&&!two){ for(int i=0;i<n;i++){ if(!was[i]){ DFS1(i); if((int)Euler.size()==1)continue; 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 x=Euler[i],y=Euler[i-1]; ans[x][y]=ans[y][x]=1; } Euler.clear(); } } build(ans); return 1; } }