oj.uz

답안 #788240

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
788240 2023-07-20T03:13:28 Z mindiyak 슈퍼트리 잇기 (IOI20_supertrees) C++14
21 / 100
 239 ms 22084 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);
				}
			}
		}
	}

	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(i==j)
				continue;
			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;
				}
				// if((heads.count(i_head) == 1) and (heads.count(j_head) == 1)){
				// 	return 0;
				// }
			}else if(p[i][j] == 1){
				if(i_head != j_head){
					return 0;
				}
			}else if(p[i][j] == 2){
				if(t < 3){
					return 0;
				}
				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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 9 ms 1108 KB Output is correct
7 Correct 156 ms 21968 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 9 ms 1108 KB Output is correct
7 Correct 156 ms 21968 KB Output is correct
8 Correct 0 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 1108 KB Output is correct
13 Correct 155 ms 21980 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 76 ms 12092 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 5684 KB Output is correct
21 Correct 154 ms 21964 KB Output is correct
22 Correct 163 ms 22028 KB Output is correct
23 Correct 163 ms 21964 KB Output is correct
24 Correct 157 ms 22084 KB Output is correct
25 Correct 85 ms 12112 KB Output is correct
26 Correct 63 ms 12040 KB Output is correct
27 Correct 161 ms 22032 KB Output is correct
28 Correct 153 ms 22020 KB Output is correct

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 6 ms 1104 KB Output is correct
9 Correct 151 ms 22024 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 10 ms 1188 KB Output is correct
13 Correct 239 ms 22036 KB Output is correct
14 Incorrect 0 ms 212 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 39 ms 5768 KB Output is correct
5 Correct 155 ms 22036 KB Output is correct
6 Correct 157 ms 21928 KB Output is correct
7 Correct 164 ms 21968 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Incorrect 40 ms 5736 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 9 ms 1108 KB Output is correct
7 Correct 156 ms 21968 KB Output is correct
8 Correct 0 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 1108 KB Output is correct
13 Correct 155 ms 21980 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 76 ms 12092 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 5684 KB Output is correct
21 Correct 154 ms 21964 KB Output is correct
22 Correct 163 ms 22028 KB Output is correct
23 Correct 163 ms 21964 KB Output is correct
24 Correct 157 ms 22084 KB Output is correct
25 Correct 85 ms 12112 KB Output is correct
26 Correct 63 ms 12040 KB Output is correct
27 Correct 161 ms 22032 KB Output is correct
28 Correct 153 ms 22020 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 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 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 6 ms 1104 KB Output is correct
37 Correct 151 ms 22024 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 10 ms 1188 KB Output is correct
41 Correct 239 ms 22036 KB Output is correct
42 Incorrect 0 ms 212 KB Answer gives possible 1 while actual possible 0
43 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 9 ms 1108 KB Output is correct
7 Correct 156 ms 21968 KB Output is correct
8 Correct 0 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 1108 KB Output is correct
13 Correct 155 ms 21980 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 76 ms 12092 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 5684 KB Output is correct
21 Correct 154 ms 21964 KB Output is correct
22 Correct 163 ms 22028 KB Output is correct
23 Correct 163 ms 21964 KB Output is correct
24 Correct 157 ms 22084 KB Output is correct
25 Correct 85 ms 12112 KB Output is correct
26 Correct 63 ms 12040 KB Output is correct
27 Correct 161 ms 22032 KB Output is correct
28 Correct 153 ms 22020 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 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 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 6 ms 1104 KB Output is correct
37 Correct 151 ms 22024 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 10 ms 1188 KB Output is correct
41 Correct 239 ms 22036 KB Output is correct
42 Incorrect 0 ms 212 KB Answer gives possible 1 while actual possible 0
43 Halted 0 ms 0 KB -