#include "supertrees.h"
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define forn(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define sz(a) (int)a.size()
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int N = 1001;
vector<int> adj[N];
bool vis[N];
vector<int> component;
int par[N];
int get(int a){
while(par[a]!=a)a=par[a];
return a;
}
void uni(int a,int b){
a = get(a);
b = get(b);
if(a==b)return;
par[b] = a;
}
void dfs(int u)
{
vis[u] = true;
component.pb(u);
for(auto x : adj[u]){
if(!vis[x])dfs(x);
}
}
int construct(vector<vector<int>> p)
{
int n = sz(p);
vector<vector<int>> ans;
ans.resize(n);
for(int i=0;i < n;i++)
par[i]=i;
for(int i =0;i < n;i++)ans[i].resize(n);
forn(i,n)forn(j,n)ans[i][j]=0;
bool two = false;
for(int i = 0;i < n;i++)
{
for(int j = 0;j < n;j++)
{
if(p[i][j]==2)two=true;
if(p[i][j]){
uni(i,j);
adj[i].pb(j);
}
}
}
for(int i = 0;i < n;i++)
{
for(int j =0;j < n;j++)
{
if(get(i)==get(j) && !p[i][j])return 0;
}
}
for(int i = 0;i < n;i++)
{
if(!vis[i]){
component.clear();
dfs(i);
if(sz(component) < 3)return 0;
for(int j = 1;j < sz(component);j++)
{
ans[component[j]][component[j-1]] = ans[component[j-1]][component[j]] = 1;
}
if(two)ans[component.back()][component[0]] = ans[component[0]][component.back()] = 1;
}
}
build(ans);
return 1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
364 KB |
Answer gives possible 0 while actual possible 1 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
364 KB |
Answer gives possible 0 while actual possible 1 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
364 KB |
Answer gives possible 0 while actual possible 1 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
364 KB |
Answer gives possible 0 while actual possible 1 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
364 KB |
Answer gives possible 0 while actual possible 1 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
364 KB |
Answer gives possible 0 while actual possible 1 |
2 |
Halted |
0 ms |
0 KB |
- |