Submission #788255

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
788255	2023-07-20T03:50:20 Z	mindiyak	Connecting Supertrees (IOI20_supertrees)	C++14	21 / 100	181 ms	22160 KB

supertrees

//In heads make different sets of heads



#include "supertrees.h"
#include <vector>
#include <set>
#include <iostream>

using namespace std;

vector<int> parent(1003);
vector<int> header_parent(1003);
vector<int> header_parent_current(1003);
vector<set<int>> header_counter;

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

int find_head_parent(int n){
	if(header_parent[n] == n){
		return n;
	}return find_head_parent(header_parent[n]);
}

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

	for (int i = 0; i < n; i++) {
		parent[i] = i;
		header_parent[i] = i;
		header_parent_current[i] = i;
		header_counter.push_back(a);
	}

	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);
					header_parent[higher] = parent[higher];
				}
			}
		}
	}

	// cout <<"process 2" << endl;

	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(i==j)
				continue;
			if(p[i][j] == 2){
				int lower = min(i,j);
				int higher = max(i,j);
				ans[header_parent_current[i]][header_parent_current[j]] = 1;
				ans[header_parent_current[j]][header_parent_current[i]] = 1;
				header_parent[higher] = find_head_parent(lower);
				header_counter[header_parent[higher]].insert(higher);
				header_parent_current[lower] = higher;
				// cout << i << " " << j << " " << header_parent[higher] << " " << header_counter[header_parent[higher]].size() << endl;
			}
		}
	}

	for(int i=0;i<n;i++){
		if(i != header_parent_current[i]){
			ans[header_parent_current[i]][i] = 1;
			ans[i][header_parent_current[i]] = 1;
		}
	}

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

	// cout << endl;
	// for (int i = 0; i < n; i++) {
	// 	cout << i << " " << parent[i] << " " << header_parent[i] << " " << header_counter[i].size() << endl;
	// }
	// cout << 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);
			int i_head_header = find_head_parent(i_head);
			int j_head_header = find_head_parent(j_head);
			if(i==j)
				continue;
			if(p[i][j] == 0){
				if(i_head == j_head){
					return 0;
				}
				if(i_head_header == j_head_header){
					return 0;
				}
			}else if(p[i][j] == 1){
				if(i_head != j_head){
					return 0;
				}
			}else if(p[i][j] == 2){
				// cout << i << " " << j << " " << i_head_header << " " << j_head_header << endl;
				if((header_counter[i_head_header].size() < 2)){
					return 0;
				}
				if(i_head == j_head){
					return 0;
				}
				if(i_head_header != j_head_header){
					return 0;
				}
			}
		}
	}


	build(ans);
	return 1;
}

Subtask #1
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	7 ms	1108 KB	Output is correct
7	Correct	181 ms	22160 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	7 ms	1108 KB	Output is correct
7	Correct	181 ms	22160 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	7 ms	1164 KB	Output is correct
13	Correct	162 ms	22044 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	4 ms	724 KB	Output is correct
17	Correct	76 ms	12176 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	40 ms	5792 KB	Output is correct
21	Correct	158 ms	22096 KB	Output is correct
22	Correct	156 ms	22128 KB	Output is correct
23	Correct	177 ms	22092 KB	Output is correct
24	Correct	153 ms	22036 KB	Output is correct
25	Correct	73 ms	12180 KB	Output is correct
26	Correct	68 ms	12172 KB	Output is correct
27	Correct	160 ms	22084 KB	Output is correct
28	Correct	152 ms	22124 KB	Output is correct

Subtask #3
0 / 19.0

#	Verdict	Memory	Grader output
1	Correct	212 KB	Output is correct
2	Correct	212 KB	Output is correct
3	Correct	212 KB	Output is correct
4	Correct	212 KB	Output is correct
5	Incorrect	212 KB	b[2][2] is not 0
6	Halted	0 KB	-

Subtask #4
0 / 35.0

#	Verdict	Memory	Grader output
1	Correct	212 KB	Output is correct
2	Incorrect	212 KB	b[2][2] is not 0
3	Halted	0 KB	-

Subtask #5
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	7 ms	1108 KB	Output is correct
7	Correct	181 ms	22160 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	7 ms	1164 KB	Output is correct
13	Correct	162 ms	22044 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	4 ms	724 KB	Output is correct
17	Correct	76 ms	12176 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	40 ms	5792 KB	Output is correct
21	Correct	158 ms	22096 KB	Output is correct
22	Correct	156 ms	22128 KB	Output is correct
23	Correct	177 ms	22092 KB	Output is correct
24	Correct	153 ms	22036 KB	Output is correct
25	Correct	73 ms	12180 KB	Output is correct
26	Correct	68 ms	12172 KB	Output is correct
27	Correct	160 ms	22084 KB	Output is correct
28	Correct	152 ms	22124 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Correct	0 ms	212 KB	Output is correct
33	Incorrect	0 ms	212 KB	b[2][2] is not 0
34	Halted	0 ms	0 KB	-

Subtask #6
0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	7 ms	1108 KB	Output is correct
7	Correct	181 ms	22160 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	7 ms	1164 KB	Output is correct
13	Correct	162 ms	22044 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	4 ms	724 KB	Output is correct
17	Correct	76 ms	12176 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	40 ms	5792 KB	Output is correct
21	Correct	158 ms	22096 KB	Output is correct
22	Correct	156 ms	22128 KB	Output is correct
23	Correct	177 ms	22092 KB	Output is correct
24	Correct	153 ms	22036 KB	Output is correct
25	Correct	73 ms	12180 KB	Output is correct
26	Correct	68 ms	12172 KB	Output is correct
27	Correct	160 ms	22084 KB	Output is correct
28	Correct	152 ms	22124 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Correct	0 ms	212 KB	Output is correct
33	Incorrect	0 ms	212 KB	b[2][2] is not 0
34	Halted	0 ms	0 KB	-

Submission #788255

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 10.0 / 10.0

Subtask #3 0 / 19.0

Subtask #4 0 / 35.0

Subtask #5 0 / 21.0

Subtask #6 0 / 4.0

Subtask #1
11.0 / 11.0

Subtask #2
10.0 / 10.0

Subtask #3
0 / 19.0

Subtask #4
0 / 35.0

Subtask #5
0 / 21.0

Subtask #6
0 / 4.0