oj.uz

Submission #780854

# Submission time Handle Problem Language Result Execution time Memory
780854 2023-07-12T14:00:21 Z Malix Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 349 ms 23944 KB 
#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<3){
			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 > 0){
					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++){
			answer[i][i] = 0;
		}

		build(answer);
		return 1;
	}



	return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 7 ms 1212 KB Output is correct
7 Correct 149 ms 23924 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 1 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 1212 KB Output is correct
7 Correct 149 ms 23924 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 6 ms 1244 KB Output is correct
13 Correct 147 ms 23804 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 3 ms 852 KB Output is correct
17 Correct 69 ms 14068 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 38 ms 6164 KB Output is correct
21 Correct 153 ms 23936 KB Output is correct
22 Correct 156 ms 23932 KB Output is correct
23 Correct 213 ms 23920 KB Output is correct
24 Correct 153 ms 23944 KB Output is correct
25 Correct 64 ms 14080 KB Output is correct
26 Correct 60 ms 14080 KB Output is correct
27 Correct 203 ms 23928 KB Output is correct
28 Correct 158 ms 23900 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 0 ms 212 KB Output is correct
3 Correct 0 ms 304 KB Output is correct
4 Correct 1 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 7 ms 1108 KB Output is correct
9 Correct 148 ms 22032 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 8 ms 1140 KB Output is correct
13 Correct 349 ms 21972 KB Output is correct
14 Correct 3 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 66 ms 12052 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Incorrect 0 ms 212 KB Answer gives possible 0 while actual possible 1
21 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 38 ms 5748 KB Output is correct
5 Correct 154 ms 22160 KB Output is correct
6 Correct 153 ms 22020 KB Output is correct
7 Correct 198 ms 22020 KB Output is correct
8 Incorrect 0 ms 212 KB Answer gives possible 0 while actual possible 1
9 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 7 ms 1212 KB Output is correct
7 Correct 149 ms 23924 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 6 ms 1244 KB Output is correct
13 Correct 147 ms 23804 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 3 ms 852 KB Output is correct
17 Correct 69 ms 14068 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 38 ms 6164 KB Output is correct
21 Correct 153 ms 23936 KB Output is correct
22 Correct 156 ms 23932 KB Output is correct
23 Correct 213 ms 23920 KB Output is correct
24 Correct 153 ms 23944 KB Output is correct
25 Correct 64 ms 14080 KB Output is correct
26 Correct 60 ms 14080 KB Output is correct
27 Correct 203 ms 23928 KB Output is correct
28 Correct 158 ms 23900 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 304 KB Output is correct
32 Correct 1 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 7 ms 1108 KB Output is correct
37 Correct 148 ms 22032 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 8 ms 1140 KB Output is correct
41 Correct 349 ms 21972 KB Output is correct
42 Correct 3 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 3 ms 724 KB Output is correct
45 Correct 66 ms 12052 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Incorrect 0 ms 212 KB Answer gives possible 0 while actual possible 1
49 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 1 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 1212 KB Output is correct
7 Correct 149 ms 23924 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 6 ms 1244 KB Output is correct
13 Correct 147 ms 23804 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 3 ms 852 KB Output is correct
17 Correct 69 ms 14068 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 38 ms 6164 KB Output is correct
21 Correct 153 ms 23936 KB Output is correct
22 Correct 156 ms 23932 KB Output is correct
23 Correct 213 ms 23920 KB Output is correct
24 Correct 153 ms 23944 KB Output is correct
25 Correct 64 ms 14080 KB Output is correct
26 Correct 60 ms 14080 KB Output is correct
27 Correct 203 ms 23928 KB Output is correct
28 Correct 158 ms 23900 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 304 KB Output is correct
32 Correct 1 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 7 ms 1108 KB Output is correct
37 Correct 148 ms 22032 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 8 ms 1140 KB Output is correct
41 Correct 349 ms 21972 KB Output is correct
42 Correct 3 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 3 ms 724 KB Output is correct
45 Correct 66 ms 12052 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Incorrect 0 ms 212 KB Answer gives possible 0 while actual possible 1
49 Halted 0 ms 0 KB -