oj.uz

Submission #627491

# Submission time Handle Problem Language Result Execution time Memory
627491 2022-08-12T15:42:10 Z ttamx Connecting Supertrees (IOI20_supertrees) C++17
21 / 100
 189 ms 22212 KB 
#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;

vector<vector<int>> ans;
vector<int> adj[1005],adj2[1005];
int pa[1005],pa2[1005];
bool vis[1005],vis2[1005];

int fp(int u){
    if(pa[u]==u)return u;
    return pa[u]=fp(pa[u]);
}

int fp2(int u){
    if(pa2[u]==u)return u;
    return pa2[u]=fp2(pa2[u]);
}

void dfs(int u){
    for(auto v:adj[u]){
        if(vis[v])continue;
        vis[v]=1;
        ans[u][v]=1;
        ans[v][u]=1;
        adj2[u].emplace_back(v);
        adj2[v].emplace_back(u);
        dfs(v);
    }
}

int construct(vector<vector<int>> p) {
	int n = p.size();
	for(int i=0;i<n;++i)pa[i]=i;
	for (int i = 0; i < n; i++) {
		vector<int> row;
		row.resize(n);
		ans.push_back(row);
	}
	for(int i=0;i<n;++i){
        for(int j=0;j<n;++j){
            if(p[i][j]==3)return 0;
            if(p[i][j]==1){
                pa[fp(i)]=fp(j);
            }
            if(p[i][j]==2){
                pa[fp(i)]=fp(j);
                pa2[fp(i)]=fp2(j);
                adj[i].emplace_back(j);
            }
        }
	}
	for(int i=0;i<n;++i){
        dfs(i);
        if(i==fp(i))continue;
        ans[i][fp(i)]=1;
        ans[fp(i)][i]=1;
	}
	for(int i=0;i<n;++i){
        for(int j=0;j<n;++j){
            if(ans[i][j]==1&&p[i][j]==0)return 0;
            if(fp2(i)!=fp2(j)&&fp(i)==fp(j))return 0;
        }
	}
	build(ans);
	return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 8 ms 1236 KB Output is correct
7 Correct 173 ms 22212 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 8 ms 1236 KB Output is correct
7 Correct 173 ms 22212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 8 ms 1200 KB Output is correct
13 Correct 161 ms 22072 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 6 ms 724 KB Output is correct
17 Correct 88 ms 12084 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 44 ms 5808 KB Output is correct
21 Correct 176 ms 22016 KB Output is correct
22 Correct 167 ms 22072 KB Output is correct
23 Correct 185 ms 22080 KB Output is correct
24 Correct 163 ms 22092 KB Output is correct
25 Correct 72 ms 12084 KB Output is correct
26 Correct 74 ms 12096 KB Output is correct
27 Correct 178 ms 22072 KB Output is correct
28 Correct 189 ms 22068 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Incorrect 1 ms 340 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 352 KB Output is correct
4 Correct 52 ms 5732 KB Output is correct
5 Correct 168 ms 22076 KB Output is correct
6 Correct 175 ms 22080 KB Output is correct
7 Correct 185 ms 22068 KB Output is correct
8 Incorrect 0 ms 340 KB Too many ways to get from 0 to 3, should be 2 found no less than 3
9 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 8 ms 1236 KB Output is correct
7 Correct 173 ms 22212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 8 ms 1200 KB Output is correct
13 Correct 161 ms 22072 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 6 ms 724 KB Output is correct
17 Correct 88 ms 12084 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 44 ms 5808 KB Output is correct
21 Correct 176 ms 22016 KB Output is correct
22 Correct 167 ms 22072 KB Output is correct
23 Correct 185 ms 22080 KB Output is correct
24 Correct 163 ms 22092 KB Output is correct
25 Correct 72 ms 12084 KB Output is correct
26 Correct 74 ms 12096 KB Output is correct
27 Correct 178 ms 22072 KB Output is correct
28 Correct 189 ms 22068 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Incorrect 1 ms 340 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 8 ms 1236 KB Output is correct
7 Correct 173 ms 22212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 8 ms 1200 KB Output is correct
13 Correct 161 ms 22072 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 6 ms 724 KB Output is correct
17 Correct 88 ms 12084 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 44 ms 5808 KB Output is correct
21 Correct 176 ms 22016 KB Output is correct
22 Correct 167 ms 22072 KB Output is correct
23 Correct 185 ms 22080 KB Output is correct
24 Correct 163 ms 22092 KB Output is correct
25 Correct 72 ms 12084 KB Output is correct
26 Correct 74 ms 12096 KB Output is correct
27 Correct 178 ms 22072 KB Output is correct
28 Correct 189 ms 22068 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Incorrect 1 ms 340 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -