oj.uz

Submission #627481

# Submission time Handle Problem Language Result Execution time Memory
627481 2022-08-12T15:32:41 Z ttamx Connecting Supertrees (IOI20_supertrees) C++17
21 / 100
 210 ms 24140 KB 
#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;

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

int fp(int u){
    if(pa[u]==u)return u;
    return pa[u]=fp(pa[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);
                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;
        }
	}
	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 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 8 ms 1152 KB Output is correct
7 Correct 176 ms 22092 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 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 8 ms 1152 KB Output is correct
7 Correct 176 ms 22092 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 0 ms 340 KB Output is correct
12 Correct 7 ms 1236 KB Output is correct
13 Correct 175 ms 22068 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 4 ms 848 KB Output is correct
17 Correct 85 ms 14124 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 356 KB Output is correct
20 Correct 46 ms 6308 KB Output is correct
21 Correct 180 ms 23956 KB Output is correct
22 Correct 194 ms 23984 KB Output is correct
23 Correct 186 ms 24016 KB Output is correct
24 Correct 189 ms 23976 KB Output is correct
25 Correct 76 ms 14252 KB Output is correct
26 Correct 79 ms 14128 KB Output is correct
27 Correct 184 ms 24028 KB Output is correct
28 Correct 181 ms 24068 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 0 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 0 ms 340 KB Output is correct
4 Correct 50 ms 6380 KB Output is correct
5 Correct 210 ms 24140 KB Output is correct
6 Correct 172 ms 24020 KB Output is correct
7 Correct 182 ms 24108 KB Output is correct
8 Incorrect 1 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 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 8 ms 1152 KB Output is correct
7 Correct 176 ms 22092 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 0 ms 340 KB Output is correct
12 Correct 7 ms 1236 KB Output is correct
13 Correct 175 ms 22068 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 4 ms 848 KB Output is correct
17 Correct 85 ms 14124 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 356 KB Output is correct
20 Correct 46 ms 6308 KB Output is correct
21 Correct 180 ms 23956 KB Output is correct
22 Correct 194 ms 23984 KB Output is correct
23 Correct 186 ms 24016 KB Output is correct
24 Correct 189 ms 23976 KB Output is correct
25 Correct 76 ms 14252 KB Output is correct
26 Correct 79 ms 14128 KB Output is correct
27 Correct 184 ms 24028 KB Output is correct
28 Correct 181 ms 24068 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 0 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 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 8 ms 1152 KB Output is correct
7 Correct 176 ms 22092 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 0 ms 340 KB Output is correct
12 Correct 7 ms 1236 KB Output is correct
13 Correct 175 ms 22068 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 4 ms 848 KB Output is correct
17 Correct 85 ms 14124 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 356 KB Output is correct
20 Correct 46 ms 6308 KB Output is correct
21 Correct 180 ms 23956 KB Output is correct
22 Correct 194 ms 23984 KB Output is correct
23 Correct 186 ms 24016 KB Output is correct
24 Correct 189 ms 23976 KB Output is correct
25 Correct 76 ms 14252 KB Output is correct
26 Correct 79 ms 14128 KB Output is correct
27 Correct 184 ms 24028 KB Output is correct
28 Correct 181 ms 24068 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 0 ms 340 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -