oj.uz

Submission #788230

# Submission time Handle Problem Language Result Execution time Memory
788230 2023-07-20T02:53:39 Z mindiyak Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 192 ms 24012 KB 
#include "supertrees.h"
#include <vector>
#include <set>
#include <iostream>

using namespace std;

vector<int> parent(1003);

int find_head(int n){
	if(parent[n] == n){
		return n;
	}return find_head(parent[n]);
}

int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	set<int> heads;
	vector<vector<int>>ans(n,vector<int>(n,0));

	for (int i = 0; i < n; i++) {
		parent[i] = i;
	}

	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(i==j)
				continue;
			if(p[i][j] == 3){
				return 0;
			}else if(p[i][j] == 1){
				int lower = min(i,j);
				int higher = max(i,j);
				if(find_head(lower) != find_head(higher)){
					ans[i][j] = 1;
					ans[j][i] = 1;
					parent[higher] = find_head(lower);
				}
			}else if(p[i][j] == 2){
				heads.insert(find_head(i));
				heads.insert(find_head(j));
			}
		}
	}

	// cout << "table travers" << endl;

	vector<int> header;
	for (int i : heads) {
		header.push_back(i);
	}


	int t = header.size();

	// cout << t << " " << (0<(t-1)) << endl;

	for (int i = 0; i < (t-1); i++) {
		// cout << "for" << endl;
		ans[header[i]][header[i+1]] = 1;
		ans[header[i+1]][header[i]] = 1;
	}
	if(t > 2){
		// cout << "comare" << endl;
		ans[header[0]][header[t-1]] = 1;
		ans[header[t-1]][header[0]] = 1;
	}

	// cout << "headers connected" << endl;

	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			int i_head = find_head(i);
			int j_head = find_head(j);
			if(i==j)
				continue;
			if(p[i][j] == 0){
				if(i_head == j_head){
					return 0;
				}
			}else if(p[i][j] == 1){
				if(i_head != j_head){
					return 0;
				}
			}else if(p[i][j] == 2){
				if(i_head == j_head){
					return 0;
				}
				if(heads.count(i_head) == 0 or heads.count(j_head) == 0){
					return 0;
				}
			}
		}
	}


	build(ans);
	return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 304 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1236 KB Output is correct
7 Correct 146 ms 22440 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 304 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1236 KB Output is correct
7 Correct 146 ms 22440 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 304 KB Output is correct
10 Correct 1 ms 304 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 6 ms 1216 KB Output is correct
13 Correct 146 ms 22368 KB Output is correct
14 Correct 1 ms 304 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 852 KB Output is correct
17 Correct 71 ms 14080 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 37 ms 6192 KB Output is correct
21 Correct 150 ms 23928 KB Output is correct
22 Correct 148 ms 24012 KB Output is correct
23 Correct 157 ms 23956 KB Output is correct
24 Correct 148 ms 23928 KB Output is correct
25 Correct 64 ms 14068 KB Output is correct
26 Correct 62 ms 14000 KB Output is correct
27 Correct 157 ms 23932 KB Output is correct
28 Correct 149 ms 23964 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 1 ms 212 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 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 0 ms 308 KB Output is correct
4 Correct 37 ms 6128 KB Output is correct
5 Correct 163 ms 22444 KB Output is correct
6 Correct 192 ms 22528 KB Output is correct
7 Correct 156 ms 22492 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Incorrect 43 ms 6204 KB Too many ways to get from 0 to 1, should be 0 found no less than 1
10 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 304 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1236 KB Output is correct
7 Correct 146 ms 22440 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 304 KB Output is correct
10 Correct 1 ms 304 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 6 ms 1216 KB Output is correct
13 Correct 146 ms 22368 KB Output is correct
14 Correct 1 ms 304 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 852 KB Output is correct
17 Correct 71 ms 14080 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 37 ms 6192 KB Output is correct
21 Correct 150 ms 23928 KB Output is correct
22 Correct 148 ms 24012 KB Output is correct
23 Correct 157 ms 23956 KB Output is correct
24 Correct 148 ms 23928 KB Output is correct
25 Correct 64 ms 14068 KB Output is correct
26 Correct 62 ms 14000 KB Output is correct
27 Correct 157 ms 23932 KB Output is correct
28 Correct 149 ms 23964 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 308 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Incorrect 1 ms 212 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 1 ms 304 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 304 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1236 KB Output is correct
7 Correct 146 ms 22440 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 304 KB Output is correct
10 Correct 1 ms 304 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 6 ms 1216 KB Output is correct
13 Correct 146 ms 22368 KB Output is correct
14 Correct 1 ms 304 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 852 KB Output is correct
17 Correct 71 ms 14080 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 37 ms 6192 KB Output is correct
21 Correct 150 ms 23928 KB Output is correct
22 Correct 148 ms 24012 KB Output is correct
23 Correct 157 ms 23956 KB Output is correct
24 Correct 148 ms 23928 KB Output is correct
25 Correct 64 ms 14068 KB Output is correct
26 Correct 62 ms 14000 KB Output is correct
27 Correct 157 ms 23932 KB Output is correct
28 Correct 149 ms 23964 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 308 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Incorrect 1 ms 212 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -