#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()
struct DSU{
int n;
vector<int> par, s;
DSU(int N){
n = N;
s.assign(n, 1), par.resize(n);
iota(all(par), 0);
}
int get(int a){
return par[a] = (a == par[a] ? a : get(par[a]));
}
void uni(int a, int b){
a = get(a), b = get(b);
if(s[a] > s[b])swap(a, b);
par[a] = b, s[b] += s[a];
}
int get_size(int a){
return s[get(a)];
}
bool same_set(int a, int b){
return get(a) == get(b);
}
};
const int N = 1005;
vector<int> adj[N], adj2[N];
vector<int> component;
bool vis[N];
int r[N];
void dfs(int u){
component.pb(u);
vis[u] = true;
for(int v: adj[u])dfs(v);
}
int construct(vector<vector<int>> p){
int n = sz(p);
vector<vector<int>> ans(n, vector<int>(n, 0));
DSU d(n);
for(int i = 0;i < n; ++i){
for(int j = 0;j < n; ++j){
if(p[i][j] == 2 && !d.same_set(i, j)){
adj[i].pb(j);
adj[j].pb(i);
d.uni(i, j);
}
if(p[i][j] == 1 && i != j)adj2[i].pb(j), adj2[j].pb(i);
}
}
for(int u = 0;u < n; ++u){
for(int v: adj2[u]){
if(!d.same_set(u, v)){
ans[u][v] = ans[v][u] = 1;
d.uni(u, v);
}
}
}
for(int i = 0;i < n; ++i){
if(!vis[i]){
component.clear();
dfs(i);
for(int i = 0;i < sz(component); ++i){
if(sz(component) > 1)ans[component[i]][component[(i + 1) % sz(component)]] = ans[component[(i + 1) % sz(component)]][component[i]] = 1;
}
}
}
build(ans);
return 1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
332 KB |
Output is correct |
2 |
Correct |
0 ms |
332 KB |
Output is correct |
3 |
Correct |
0 ms |
332 KB |
Output is correct |
4 |
Correct |
0 ms |
332 KB |
Output is correct |
5 |
Correct |
0 ms |
332 KB |
Output is correct |
6 |
Correct |
8 ms |
1588 KB |
Output is correct |
7 |
Correct |
186 ms |
30156 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
332 KB |
Output is correct |
2 |
Correct |
0 ms |
332 KB |
Output is correct |
3 |
Correct |
0 ms |
332 KB |
Output is correct |
4 |
Correct |
0 ms |
332 KB |
Output is correct |
5 |
Correct |
0 ms |
332 KB |
Output is correct |
6 |
Correct |
8 ms |
1588 KB |
Output is correct |
7 |
Correct |
186 ms |
30156 KB |
Output is correct |
8 |
Correct |
0 ms |
332 KB |
Output is correct |
9 |
Correct |
0 ms |
332 KB |
Output is correct |
10 |
Correct |
0 ms |
332 KB |
Output is correct |
11 |
Correct |
0 ms |
332 KB |
Output is correct |
12 |
Correct |
7 ms |
1228 KB |
Output is correct |
13 |
Correct |
160 ms |
22076 KB |
Output is correct |
14 |
Incorrect |
0 ms |
332 KB |
Answer gives possible 1 while actual possible 0 |
15 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
332 KB |
Output is correct |
2 |
Correct |
0 ms |
332 KB |
Output is correct |
3 |
Correct |
0 ms |
332 KB |
Output is correct |
4 |
Execution timed out |
1129 ms |
1839068 KB |
Time limit exceeded |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
332 KB |
Output is correct |
2 |
Execution timed out |
1196 ms |
1974100 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
332 KB |
Output is correct |
2 |
Correct |
0 ms |
332 KB |
Output is correct |
3 |
Correct |
0 ms |
332 KB |
Output is correct |
4 |
Correct |
0 ms |
332 KB |
Output is correct |
5 |
Correct |
0 ms |
332 KB |
Output is correct |
6 |
Correct |
8 ms |
1588 KB |
Output is correct |
7 |
Correct |
186 ms |
30156 KB |
Output is correct |
8 |
Correct |
0 ms |
332 KB |
Output is correct |
9 |
Correct |
0 ms |
332 KB |
Output is correct |
10 |
Correct |
0 ms |
332 KB |
Output is correct |
11 |
Correct |
0 ms |
332 KB |
Output is correct |
12 |
Correct |
7 ms |
1228 KB |
Output is correct |
13 |
Correct |
160 ms |
22076 KB |
Output is correct |
14 |
Incorrect |
0 ms |
332 KB |
Answer gives possible 1 while actual possible 0 |
15 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
332 KB |
Output is correct |
2 |
Correct |
0 ms |
332 KB |
Output is correct |
3 |
Correct |
0 ms |
332 KB |
Output is correct |
4 |
Correct |
0 ms |
332 KB |
Output is correct |
5 |
Correct |
0 ms |
332 KB |
Output is correct |
6 |
Correct |
8 ms |
1588 KB |
Output is correct |
7 |
Correct |
186 ms |
30156 KB |
Output is correct |
8 |
Correct |
0 ms |
332 KB |
Output is correct |
9 |
Correct |
0 ms |
332 KB |
Output is correct |
10 |
Correct |
0 ms |
332 KB |
Output is correct |
11 |
Correct |
0 ms |
332 KB |
Output is correct |
12 |
Correct |
7 ms |
1228 KB |
Output is correct |
13 |
Correct |
160 ms |
22076 KB |
Output is correct |
14 |
Incorrect |
0 ms |
332 KB |
Answer gives possible 1 while actual possible 0 |
15 |
Halted |
0 ms |
0 KB |
- |