답안 #783549

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
783549	2023-07-15T03:38:33 Z	Malix	슈퍼트리 잇기 (IOI20_supertrees)	C++14	40 / 100	316 ms	24012 KB

supertrees

#include "supertrees.h"
#include <vector>
#include <bits/stdc++.h>

using namespace std;

int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	std::vector<std::vector<int>> answer;
	for (int i = 0; i < n; i++) {
		std::vector<int> row;
		row.resize(n);
		answer.push_back(row);
	}

	if(n==1){
		answer[0][0] = 0;
		build(answer);
		return 1;
	}

	int count = 0;
	int zerocount = 0;
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			if(p[i][j] == 1){
				count++;
			}
			else if(p[i][j] == 0){
				zerocount++;
			}
		}
	}


	if(zerocount == (n*n)-n){
		for(int i = 0; i < n; i++){
			for(int j = 0; j < n; j++){
				answer[i][j] = 0;
			}
		}
		build(answer);
		return 1;
	}

	//subtask 1
	if(count == n*n){
		for(int i = 0; i < n; i++){
			for(int j = 0; j < n; j++){
				answer[i][j] = 0;
			}
		}
		for(int i = 1; i < n; i++){
			answer[i][0] = 1;
			answer[0][i] = 1;
		}
		build(answer);
		return 1;
	}

	//subtask 2
	count = 0;
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			if(p[i][j] <= 1){
				count++;
			}
		}
	}
	if(count == n*n){

		vector<int> arr(n, 0);
		vector<int> arr2;
		int arr2size;

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

		int currentIndex = 0;

		while(currentIndex != n){

			if(!arr[currentIndex]){
				arr2.push_back(currentIndex);
				for(int i = 0; i < n; i++){
					if(p[currentIndex][i]){
						if(arr[i]){
							return 0;
						}
						answer[currentIndex][i] = 1;
						answer[i][currentIndex] = 1;
						if(currentIndex != i){
							arr[i]++;
						}
						arr2.push_back(i);


					}
				}
				arr2size = arr2.size();
				for(int k = 0; k < arr2size-1; k++){
					for(int m = k+1; m < arr2size; m++){
						if(!p[arr2[k]][arr2[m]]){
							return 0;
						}
					}
				}
				for(int k = 0; k < arr2size; k++){
					for(int m = 0; m < n; m++){
						if(p[arr2[k]][m]){
							if(find(arr2.begin(), arr2.end(), m) == arr2.end()){
								return 0;
							}
						}
					}
				}

				arr[currentIndex]++;
				arr2.clear();
			}



			currentIndex++;
		}


		for(int i = 0 ; i < n; i++){
			if(arr[i] > 1){
				return 0;
			}
		}



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

		build(answer);
		return 1;
	}

	//subtask 3
	count = 0;
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			if(p[i][j] == 0 || p[i][j] == 2){
				count++;
			}
		}
	}
	if(count == (n*n)-n){

		if(n==2){
			return 0;
		}

		vector<int> arr(n, 0);
		vector<int> arr2;
		int arr2size;

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

		int currentIndex = 0;

		while(currentIndex != n){

			if(!arr[currentIndex]){
				arr2.push_back(currentIndex);
				for(int i = 0; i < n; i++){
					if(p[currentIndex][i]){
						if(arr[i]){
							return 0;
						}

						if(currentIndex != i){
							arr[i]++;
							arr2.push_back(i);
						}


					}
				}
				arr2size = arr2.size();

				if(arr2size > 2){
					answer[arr2[0]][arr2[arr2size-1]] = 1;
					answer[arr2[arr2size-1]][arr2[0]] = 1;
					for(int k = 0; k < arr2size-1; k++){
						answer[arr2[k]][arr2[k+1]] = 1;
						answer[arr2[k+1]][arr2[k]] = 1;
					}
				}
				else if(arr2size == 2){
					return 0;
				}


				for(int k = 0; k < arr2size-1; k++){
					for(int m = k+1; m < arr2size; m++){
						if(!p[arr2[k]][arr2[m]]){
							return 0;
						}
					}
				}

				for(int k = 0; k < arr2size; k++){
					for(int m = 0; m < n; m++){
						if(p[arr2[k]][m]){
							if(find(arr2.begin(), arr2.end(), m) == arr2.end()){
								return 0;
							}
						}
					}
				}

				arr[currentIndex]++;
				arr2.clear();
			}



			currentIndex++;
		}


		for(int i = 0 ; i < n; i++){
			if(arr[i] > 1){
				return 0;
			}
		}



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

		build(answer);
		return 1;
	}

	//subtask 4
	count = 0;
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			if(p[i][j] <= 2){
				count++;
			}
		}
	}
	if(count == n*n){

		vector<int> arr(n, 0);
		vector<int> arr2;
		int arr2size;

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

		int currentIndex = 0;

		while(currentIndex != n){

			if(!arr[currentIndex]){
				arr2.push_back(currentIndex);
				for(int i = 0; i < n; i++){
					if(p[currentIndex][i] == 2){
						if(arr[i]){
							return 0;
						}

						if(currentIndex != i){
							arr[i]++;
							arr2.push_back(i);
						}


					}
				}
				arr2size = arr2.size();

				if(arr2size > 2){
					answer[arr2[0]][arr2[arr2size-1]] = 1;
					answer[arr2[arr2size-1]][arr2[0]] = 1;
					for(int k = 0; k < arr2size-1; k++){
						answer[arr2[k]][arr2[k+1]] = 1;
						answer[arr2[k+1]][arr2[k]] = 1;
					}
				}
				else if(arr2size == 2){
					return 0;
				}


				for(int k = 0; k < arr2size-1; k++){
					for(int m = k+1; m < arr2size; m++){
						if(!p[arr2[k]][arr2[m]]){
							return 0;
						}
					}
				}

				for(int k = 0; k < arr2size; k++){
					for(int m = 0; m < n; m++){
						if(p[arr2[k]][m]){
							if(find(arr2.begin(), arr2.end(), m) == arr2.end()){
								return 0;
							}
						}
					}
				}

				arr[currentIndex]++;
				arr2.clear();
			}



			currentIndex++;
		}


		for(int i = 0 ; i < n; i++){
			if(arr[i] > 1){
				return 0;
			}
		}

        
        
        //0 or 1 part
        currentIndex = 0;
        arr.clear();
        arr2.clear();
		while(currentIndex != n){

			if(!arr[currentIndex]){
				arr2.push_back(currentIndex);
				for(int i = 0; i < n; i++){
					if(p[currentIndex][i] == 1){
						if(arr[i]){
							return 0;
						}
						answer[currentIndex][i] = 1;
						answer[i][currentIndex] = 1;
						if(currentIndex != i){
							arr[i]++;
						}
						arr2.push_back(i);


					}
				}
				arr2size = arr2.size();
				for(int k = 0; k < arr2size-1; k++){
					for(int m = k+1; m < arr2size; m++){
						if(!p[arr2[k]][arr2[m]]){
							return 0;
						}
					}
				}
				for(int k = 0; k < arr2size; k++){
					for(int m = 0; m < n; m++){
						if(p[arr2[k]][m]){
							if(find(arr2.begin(), arr2.end(), m) == arr2.end()){
								return 0;
							}
						}
					}
				}

				arr[currentIndex]++;
				arr2.clear();
			}



			currentIndex++;
		}
		
		
		
		

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

		build(answer);
		return 1;
		
	}



	build(answer);
	return 1;
}

Subtask #1
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	296 KB	Output is correct
2	Correct	1 ms	300 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	7 ms	1228 KB	Output is correct
7	Correct	151 ms	23996 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	296 KB	Output is correct
2	Correct	1 ms	300 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	7 ms	1228 KB	Output is correct
7	Correct	151 ms	23996 KB	Output is correct
8	Correct	1 ms	300 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	300 KB	Output is correct
12	Correct	7 ms	1204 KB	Output is correct
13	Correct	151 ms	23800 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	308 KB	Output is correct
16	Correct	4 ms	852 KB	Output is correct
17	Correct	72 ms	14080 KB	Output is correct
18	Correct	1 ms	300 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	38 ms	6172 KB	Output is correct
21	Correct	166 ms	23980 KB	Output is correct
22	Correct	153 ms	23928 KB	Output is correct
23	Correct	206 ms	24012 KB	Output is correct
24	Correct	154 ms	23976 KB	Output is correct
25	Correct	73 ms	14156 KB	Output is correct
26	Correct	64 ms	13992 KB	Output is correct
27	Correct	202 ms	23944 KB	Output is correct
28	Correct	151 ms	24012 KB	Output is correct

Subtask #3
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	300 KB	Output is correct
3	Correct	1 ms	300 KB	Output is correct
4	Correct	1 ms	300 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	6 ms	1260 KB	Output is correct
9	Correct	153 ms	23932 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	8 ms	1228 KB	Output is correct
13	Correct	316 ms	23960 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	300 KB	Output is correct
16	Correct	3 ms	852 KB	Output is correct
17	Correct	71 ms	14068 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	38 ms	6260 KB	Output is correct
22	Correct	157 ms	23920 KB	Output is correct
23	Correct	161 ms	23928 KB	Output is correct
24	Correct	199 ms	24004 KB	Output is correct
25	Correct	65 ms	14084 KB	Output is correct
26	Correct	80 ms	14156 KB	Output is correct
27	Correct	164 ms	23936 KB	Output is correct
28	Correct	205 ms	23984 KB	Output is correct
29	Correct	62 ms	14068 KB	Output is correct

Subtask #4
0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	38 ms	6260 KB	Output is correct
5	Correct	152 ms	24012 KB	Output is correct
6	Correct	153 ms	23920 KB	Output is correct
7	Correct	202 ms	23948 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	39 ms	6220 KB	Output is correct
10	Correct	162 ms	23928 KB	Output is correct
11	Correct	177 ms	23936 KB	Output is correct
12	Correct	200 ms	24012 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Incorrect	1 ms	212 KB	Answer gives possible 0 while actual possible 1
15	Halted	0 ms	0 KB	-

Subtask #5
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	296 KB	Output is correct
2	Correct	1 ms	300 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	7 ms	1228 KB	Output is correct
7	Correct	151 ms	23996 KB	Output is correct
8	Correct	1 ms	300 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	300 KB	Output is correct
12	Correct	7 ms	1204 KB	Output is correct
13	Correct	151 ms	23800 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	308 KB	Output is correct
16	Correct	4 ms	852 KB	Output is correct
17	Correct	72 ms	14080 KB	Output is correct
18	Correct	1 ms	300 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	38 ms	6172 KB	Output is correct
21	Correct	166 ms	23980 KB	Output is correct
22	Correct	153 ms	23928 KB	Output is correct
23	Correct	206 ms	24012 KB	Output is correct
24	Correct	154 ms	23976 KB	Output is correct
25	Correct	73 ms	14156 KB	Output is correct
26	Correct	64 ms	13992 KB	Output is correct
27	Correct	202 ms	23944 KB	Output is correct
28	Correct	151 ms	24012 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	1 ms	300 KB	Output is correct
31	Correct	1 ms	300 KB	Output is correct
32	Correct	1 ms	300 KB	Output is correct
33	Correct	1 ms	212 KB	Output is correct
34	Correct	1 ms	212 KB	Output is correct
35	Correct	0 ms	212 KB	Output is correct
36	Correct	6 ms	1260 KB	Output is correct
37	Correct	153 ms	23932 KB	Output is correct
38	Correct	1 ms	212 KB	Output is correct
39	Correct	1 ms	212 KB	Output is correct
40	Correct	8 ms	1228 KB	Output is correct
41	Correct	316 ms	23960 KB	Output is correct
42	Correct	0 ms	212 KB	Output is correct
43	Correct	0 ms	300 KB	Output is correct
44	Correct	3 ms	852 KB	Output is correct
45	Correct	71 ms	14068 KB	Output is correct
46	Correct	1 ms	212 KB	Output is correct
47	Correct	1 ms	212 KB	Output is correct
48	Correct	1 ms	212 KB	Output is correct
49	Correct	38 ms	6260 KB	Output is correct
50	Correct	157 ms	23920 KB	Output is correct
51	Correct	161 ms	23928 KB	Output is correct
52	Correct	199 ms	24004 KB	Output is correct
53	Correct	65 ms	14084 KB	Output is correct
54	Correct	80 ms	14156 KB	Output is correct
55	Correct	164 ms	23936 KB	Output is correct
56	Correct	205 ms	23984 KB	Output is correct
57	Correct	62 ms	14068 KB	Output is correct
58	Correct	0 ms	300 KB	Output is correct
59	Correct	1 ms	296 KB	Output is correct
60	Correct	4 ms	828 KB	Output is correct
61	Correct	70 ms	14000 KB	Output is correct
62	Correct	1 ms	212 KB	Output is correct
63	Incorrect	1 ms	304 KB	Answer gives possible 0 while actual possible 1
64	Halted	0 ms	0 KB	-

Subtask #6
0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	296 KB	Output is correct
2	Correct	1 ms	300 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	7 ms	1228 KB	Output is correct
7	Correct	151 ms	23996 KB	Output is correct
8	Correct	1 ms	300 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	300 KB	Output is correct
12	Correct	7 ms	1204 KB	Output is correct
13	Correct	151 ms	23800 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	308 KB	Output is correct
16	Correct	4 ms	852 KB	Output is correct
17	Correct	72 ms	14080 KB	Output is correct
18	Correct	1 ms	300 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	38 ms	6172 KB	Output is correct
21	Correct	166 ms	23980 KB	Output is correct
22	Correct	153 ms	23928 KB	Output is correct
23	Correct	206 ms	24012 KB	Output is correct
24	Correct	154 ms	23976 KB	Output is correct
25	Correct	73 ms	14156 KB	Output is correct
26	Correct	64 ms	13992 KB	Output is correct
27	Correct	202 ms	23944 KB	Output is correct
28	Correct	151 ms	24012 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	1 ms	300 KB	Output is correct
31	Correct	1 ms	300 KB	Output is correct
32	Correct	1 ms	300 KB	Output is correct
33	Correct	1 ms	212 KB	Output is correct
34	Correct	1 ms	212 KB	Output is correct
35	Correct	0 ms	212 KB	Output is correct
36	Correct	6 ms	1260 KB	Output is correct
37	Correct	153 ms	23932 KB	Output is correct
38	Correct	1 ms	212 KB	Output is correct
39	Correct	1 ms	212 KB	Output is correct
40	Correct	8 ms	1228 KB	Output is correct
41	Correct	316 ms	23960 KB	Output is correct
42	Correct	0 ms	212 KB	Output is correct
43	Correct	0 ms	300 KB	Output is correct
44	Correct	3 ms	852 KB	Output is correct
45	Correct	71 ms	14068 KB	Output is correct
46	Correct	1 ms	212 KB	Output is correct
47	Correct	1 ms	212 KB	Output is correct
48	Correct	1 ms	212 KB	Output is correct
49	Correct	38 ms	6260 KB	Output is correct
50	Correct	157 ms	23920 KB	Output is correct
51	Correct	161 ms	23928 KB	Output is correct
52	Correct	199 ms	24004 KB	Output is correct
53	Correct	65 ms	14084 KB	Output is correct
54	Correct	80 ms	14156 KB	Output is correct
55	Correct	164 ms	23936 KB	Output is correct
56	Correct	205 ms	23984 KB	Output is correct
57	Correct	62 ms	14068 KB	Output is correct
58	Correct	0 ms	212 KB	Output is correct
59	Correct	1 ms	212 KB	Output is correct
60	Correct	1 ms	212 KB	Output is correct
61	Correct	38 ms	6260 KB	Output is correct
62	Correct	152 ms	24012 KB	Output is correct
63	Correct	153 ms	23920 KB	Output is correct
64	Correct	202 ms	23948 KB	Output is correct
65	Correct	1 ms	212 KB	Output is correct
66	Correct	39 ms	6220 KB	Output is correct
67	Correct	162 ms	23928 KB	Output is correct
68	Correct	177 ms	23936 KB	Output is correct
69	Correct	200 ms	24012 KB	Output is correct
70	Correct	1 ms	212 KB	Output is correct
71	Incorrect	1 ms	212 KB	Answer gives possible 0 while actual possible 1
72	Halted	0 ms	0 KB	-

답안 #783549

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 10.0 / 10.0

Subtask #3 19.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
19.0 / 19.0

Subtask #4
0 / 35.0

Subtask #5
0 / 21.0

Subtask #6
0 / 4.0