oj.uz

Submission #783582

# Submission time Handle Problem Language Result Execution time Memory
783582 2023-07-15T04:28:58 Z Malix Connecting Supertrees (IOI20_supertrees) C++14
40 / 100
 296 ms 23716 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==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;
        //0 or 1 part
        

		while(currentIndex != n){

			if(!arr[currentIndex]){

				for(int i = 0; i < n; i++){
					if(p[currentIndex][i] == 1){

						answer[currentIndex][i] = 1;
						answer[i][currentIndex] = 1;
						if(currentIndex != i){
							arr[i]++;
						}


					}
				}

				arr[currentIndex] = 1;

			}

			currentIndex++;
		}


		for(int i = 0; i < n; i++){
		
         currentIndex = 0;
        arr.resize(n, 0);
		
		while(currentIndex != n){

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

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


					}
				}
				arr2size = arr2.size();

                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;
                }
            



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


			currentIndex++;
		}

			answer[i][i] = 0;
		}
		
		
		build(answer);
		return 1;

	}
       



	build(answer);
	return 1;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1108 KB Output is correct
7 Correct 158 ms 23532 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 1 ms 212 KB Output is correct
12 Correct 6 ms 1108 KB Output is correct
13 Correct 163 ms 23420 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 75 ms 13708 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 39 ms 5896 KB Output is correct
21 Correct 165 ms 23716 KB Output is correct
22 Correct 160 ms 23644 KB Output is correct
23 Correct 220 ms 23712 KB Output is correct
24 Correct 160 ms 23652 KB Output is correct
25 Correct 71 ms 13596 KB Output is correct
26 Correct 66 ms 13644 KB Output is correct
27 Correct 215 ms 23580 KB Output is correct
28 Correct 161 ms 23540 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory 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 0 ms 212 KB Output is correct
5 Correct 1 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 157 ms 23500 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 8 ms 1100 KB Output is correct
13 Correct 296 ms 23476 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 13584 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 44 ms 5804 KB Output is correct
22 Correct 162 ms 23476 KB Output is correct
23 Correct 162 ms 23464 KB Output is correct
24 Correct 209 ms 23500 KB Output is correct
25 Correct 70 ms 13472 KB Output is correct
26 Correct 68 ms 13504 KB Output is correct
27 Correct 159 ms 23496 KB Output is correct
28 Correct 219 ms 23500 KB Output is correct
29 Correct 69 ms 13536 KB Output is correct

Subtask #4
0 / 35.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 45 ms 5752 KB Output is correct
5 Correct 161 ms 23372 KB Output is correct
6 Correct 160 ms 23456 KB Output is correct
7 Correct 208 ms 23440 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 43 ms 5948 KB Output is correct
10 Correct 160 ms 23460 KB Output is correct
11 Correct 159 ms 23500 KB Output is correct
12 Correct 210 ms 23420 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Incorrect 0 ms 212 KB Too few ways to get from 0 to 1, should be 2 found 0
15 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1108 KB Output is correct
7 Correct 158 ms 23532 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 1 ms 212 KB Output is correct
12 Correct 6 ms 1108 KB Output is correct
13 Correct 163 ms 23420 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 75 ms 13708 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 39 ms 5896 KB Output is correct
21 Correct 165 ms 23716 KB Output is correct
22 Correct 160 ms 23644 KB Output is correct
23 Correct 220 ms 23712 KB Output is correct
24 Correct 160 ms 23652 KB Output is correct
25 Correct 71 ms 13596 KB Output is correct
26 Correct 66 ms 13644 KB Output is correct
27 Correct 215 ms 23580 KB Output is correct
28 Correct 161 ms 23540 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 Correct 1 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 157 ms 23500 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 8 ms 1100 KB Output is correct
41 Correct 296 ms 23476 KB Output is correct
42 Correct 0 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 76 ms 13584 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 44 ms 5804 KB Output is correct
50 Correct 162 ms 23476 KB Output is correct
51 Correct 162 ms 23464 KB Output is correct
52 Correct 209 ms 23500 KB Output is correct
53 Correct 70 ms 13472 KB Output is correct
54 Correct 68 ms 13504 KB Output is correct
55 Correct 159 ms 23496 KB Output is correct
56 Correct 219 ms 23500 KB Output is correct
57 Correct 69 ms 13536 KB Output is correct
58 Incorrect 1 ms 212 KB Answer gives possible 1 while actual possible 0
59 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1108 KB Output is correct
7 Correct 158 ms 23532 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 1 ms 212 KB Output is correct
12 Correct 6 ms 1108 KB Output is correct
13 Correct 163 ms 23420 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 75 ms 13708 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 39 ms 5896 KB Output is correct
21 Correct 165 ms 23716 KB Output is correct
22 Correct 160 ms 23644 KB Output is correct
23 Correct 220 ms 23712 KB Output is correct
24 Correct 160 ms 23652 KB Output is correct
25 Correct 71 ms 13596 KB Output is correct
26 Correct 66 ms 13644 KB Output is correct
27 Correct 215 ms 23580 KB Output is correct
28 Correct 161 ms 23540 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 Correct 1 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 157 ms 23500 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 8 ms 1100 KB Output is correct
41 Correct 296 ms 23476 KB Output is correct
42 Correct 0 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 76 ms 13584 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 44 ms 5804 KB Output is correct
50 Correct 162 ms 23476 KB Output is correct
51 Correct 162 ms 23464 KB Output is correct
52 Correct 209 ms 23500 KB Output is correct
53 Correct 70 ms 13472 KB Output is correct
54 Correct 68 ms 13504 KB Output is correct
55 Correct 159 ms 23496 KB Output is correct
56 Correct 219 ms 23500 KB Output is correct
57 Correct 69 ms 13536 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 45 ms 5752 KB Output is correct
62 Correct 161 ms 23372 KB Output is correct
63 Correct 160 ms 23456 KB Output is correct
64 Correct 208 ms 23440 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 43 ms 5948 KB Output is correct
67 Correct 160 ms 23460 KB Output is correct
68 Correct 159 ms 23500 KB Output is correct
69 Correct 210 ms 23420 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Incorrect 0 ms 212 KB Too few ways to get from 0 to 1, should be 2 found 0
72 Halted 0 ms 0 KB -