oj.uz

Submission #1081500

# Submission time Handle Problem Language Result Execution time Memory
1081500 2024-08-30T06:13:17 Z 7mody Connecting Supertrees (IOI20_supertrees) C++17
100 / 100
 149 ms 24148 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

int construct(vector<vector<int>> p) {
	int n = p.size();
	vector<vector<int>> ans;
	for (int i = 0; i < n; i++) {
		vector<int> row;
		row.resize(n);
		ans.push_back(row);
	}
	for(int i = 0; i < n;i++){
		if(p[i][i] != 1) return 0;
		for(int j = i + 1;j < n;j++){
			if(p[i][j] != p[j][i] || p[i][j] == 3) return 0;
		}
	}
	vector<bool> vis(n, false);

	for(int i = 0; i < n;i++){
		if(vis[i]) continue;
		vis[i] = true;
		vector<int> curr(1, i);
		for(int j = i + 1; j < n;j++){
			if(p[i][j] != 0 && vis[j]) return 0;
			if(p[i][j] != 0) curr.push_back(j), vis[j] = true;
		}
		int m = curr.size();
		vector<vector<int>> branches;
		vector<bool> temp(n, false);
		for(int a = 0; a < m;a++){
			int x = curr[a];
			if(temp[x]) continue;
			vector<int> add;
			add.push_back(x);
			for(int b = a+1; b < m;b++){
				int y = curr[b];
				if(p[x][y] == 1){
					add.push_back(y);
					temp[y] = true;
				}
			}
			branches.push_back(add);
		}

		if(branches.size() == 2) return 0;
		
		for(vector<int> x : branches){
			for(int a : x){
				for(int b : x){
					if(a == b) continue;
					if(p[a][b] != 1) return 0;
				}
			}
			for(int a = 0; a < x.size() - 1;a++){
				ans[x[a]][x[a+1]] = ans[x[a+1]][x[a]] = 1;
			}
		}

		int szbr = branches.size();
		int szcurr = curr.size();
		for(int x = 0; x < szbr;x++){
			vector<bool> bb(n);
			for(int a : branches[x]){
				bb[a] = true;
			}
			for(int a : branches[x]){
				for(int b : curr){
					if(bb[b]) continue;
					if(p[a][b] != 2) return 0;
				}
			}
		}

		for(int j = 1; j < szcurr;j++){
			for(int k = 0; k < n;k++){
				int a = curr[j];
				int b = curr[0];
				if(a == k || b == k) continue;
				bool ok1 = p[a][k] >=1;
				bool ok2 = p[b][k] >=1;
				if(ok1 != ok2) return 0;
			}
		}
		
		for(int x = 0; x < szbr - 1; x++){
			ans[branches[x][0]][branches[x+1][0]] = ans[branches[x+1][0]][branches[x][0]] = 1;
		} 
		if(branches.size() > 1) ans[branches[0][0]][branches[szbr-1][0]] = ans[branches[szbr-1][0]][branches[0][0]] = 1;
	}

	build(ans);

	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:56:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |    for(int a = 0; a < x.size() - 1;a++){
      |                   ~~^~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1372 KB Output is correct
7 Correct 130 ms 24144 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1372 KB Output is correct
7 Correct 130 ms 24144 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1372 KB Output is correct
13 Correct 124 ms 24148 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 3 ms 856 KB Output is correct
17 Correct 65 ms 14212 KB Output is correct
18 Correct 1 ms 424 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 31 ms 6260 KB Output is correct
21 Correct 121 ms 24144 KB Output is correct
22 Correct 126 ms 23940 KB Output is correct
23 Correct 128 ms 23904 KB Output is correct
24 Correct 118 ms 23940 KB Output is correct
25 Correct 55 ms 14216 KB Output is correct
26 Correct 56 ms 14068 KB Output is correct
27 Correct 130 ms 24072 KB Output is correct
28 Correct 121 ms 24132 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 432 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 6 ms 1188 KB Output is correct
9 Correct 116 ms 23944 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 8 ms 1368 KB Output is correct
13 Correct 123 ms 23992 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 60 ms 14252 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 31 ms 6240 KB Output is correct
22 Correct 125 ms 24144 KB Output is correct
23 Correct 117 ms 23892 KB Output is correct
24 Correct 147 ms 24144 KB Output is correct
25 Correct 63 ms 14160 KB Output is correct
26 Correct 63 ms 14164 KB Output is correct
27 Correct 127 ms 24148 KB Output is correct
28 Correct 126 ms 24148 KB Output is correct
29 Correct 54 ms 14164 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 32 ms 6236 KB Output is correct
5 Correct 117 ms 24148 KB Output is correct
6 Correct 142 ms 24148 KB Output is correct
7 Correct 123 ms 24072 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 29 ms 6236 KB Output is correct
10 Correct 149 ms 24144 KB Output is correct
11 Correct 124 ms 23892 KB Output is correct
12 Correct 120 ms 23940 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 440 KB Output is correct
16 Correct 34 ms 6236 KB Output is correct
17 Correct 119 ms 24132 KB Output is correct
18 Correct 133 ms 24148 KB Output is correct
19 Correct 127 ms 24072 KB Output is correct
20 Correct 116 ms 24144 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1372 KB Output is correct
7 Correct 130 ms 24144 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1372 KB Output is correct
13 Correct 124 ms 24148 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 3 ms 856 KB Output is correct
17 Correct 65 ms 14212 KB Output is correct
18 Correct 1 ms 424 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 31 ms 6260 KB Output is correct
21 Correct 121 ms 24144 KB Output is correct
22 Correct 126 ms 23940 KB Output is correct
23 Correct 128 ms 23904 KB Output is correct
24 Correct 118 ms 23940 KB Output is correct
25 Correct 55 ms 14216 KB Output is correct
26 Correct 56 ms 14068 KB Output is correct
27 Correct 130 ms 24072 KB Output is correct
28 Correct 121 ms 24132 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 432 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 6 ms 1188 KB Output is correct
37 Correct 116 ms 23944 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 8 ms 1368 KB Output is correct
41 Correct 123 ms 23992 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 4 ms 860 KB Output is correct
45 Correct 60 ms 14252 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 31 ms 6240 KB Output is correct
50 Correct 125 ms 24144 KB Output is correct
51 Correct 117 ms 23892 KB Output is correct
52 Correct 147 ms 24144 KB Output is correct
53 Correct 63 ms 14160 KB Output is correct
54 Correct 63 ms 14164 KB Output is correct
55 Correct 127 ms 24148 KB Output is correct
56 Correct 126 ms 24148 KB Output is correct
57 Correct 54 ms 14164 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 3 ms 860 KB Output is correct
61 Correct 57 ms 14088 KB Output is correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 1 ms 348 KB Output is correct
65 Correct 32 ms 6260 KB Output is correct
66 Correct 56 ms 14164 KB Output is correct
67 Correct 54 ms 14080 KB Output is correct
68 Correct 50 ms 14164 KB Output is correct
69 Correct 52 ms 13996 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1372 KB Output is correct
7 Correct 130 ms 24144 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1372 KB Output is correct
13 Correct 124 ms 24148 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 3 ms 856 KB Output is correct
17 Correct 65 ms 14212 KB Output is correct
18 Correct 1 ms 424 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 31 ms 6260 KB Output is correct
21 Correct 121 ms 24144 KB Output is correct
22 Correct 126 ms 23940 KB Output is correct
23 Correct 128 ms 23904 KB Output is correct
24 Correct 118 ms 23940 KB Output is correct
25 Correct 55 ms 14216 KB Output is correct
26 Correct 56 ms 14068 KB Output is correct
27 Correct 130 ms 24072 KB Output is correct
28 Correct 121 ms 24132 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 432 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 6 ms 1188 KB Output is correct
37 Correct 116 ms 23944 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 8 ms 1368 KB Output is correct
41 Correct 123 ms 23992 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 4 ms 860 KB Output is correct
45 Correct 60 ms 14252 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 31 ms 6240 KB Output is correct
50 Correct 125 ms 24144 KB Output is correct
51 Correct 117 ms 23892 KB Output is correct
52 Correct 147 ms 24144 KB Output is correct
53 Correct 63 ms 14160 KB Output is correct
54 Correct 63 ms 14164 KB Output is correct
55 Correct 127 ms 24148 KB Output is correct
56 Correct 126 ms 24148 KB Output is correct
57 Correct 54 ms 14164 KB Output is correct
58 Correct 1 ms 344 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 32 ms 6236 KB Output is correct
62 Correct 117 ms 24148 KB Output is correct
63 Correct 142 ms 24148 KB Output is correct
64 Correct 123 ms 24072 KB Output is correct
65 Correct 1 ms 344 KB Output is correct
66 Correct 29 ms 6236 KB Output is correct
67 Correct 149 ms 24144 KB Output is correct
68 Correct 124 ms 23892 KB Output is correct
69 Correct 120 ms 23940 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 0 ms 440 KB Output is correct
73 Correct 34 ms 6236 KB Output is correct
74 Correct 119 ms 24132 KB Output is correct
75 Correct 133 ms 24148 KB Output is correct
76 Correct 127 ms 24072 KB Output is correct
77 Correct 116 ms 24144 KB Output is correct
78 Correct 0 ms 348 KB Output is correct
79 Correct 0 ms 348 KB Output is correct
80 Correct 3 ms 860 KB Output is correct
81 Correct 57 ms 14088 KB Output is correct
82 Correct 0 ms 344 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 1 ms 348 KB Output is correct
85 Correct 32 ms 6260 KB Output is correct
86 Correct 56 ms 14164 KB Output is correct
87 Correct 54 ms 14080 KB Output is correct
88 Correct 50 ms 14164 KB Output is correct
89 Correct 52 ms 13996 KB Output is correct
90 Correct 0 ms 348 KB Output is correct
91 Correct 0 ms 348 KB Output is correct
92 Correct 2 ms 860 KB Output is correct
93 Correct 77 ms 14160 KB Output is correct
94 Correct 0 ms 344 KB Output is correct
95 Correct 0 ms 348 KB Output is correct
96 Correct 0 ms 348 KB Output is correct
97 Correct 14 ms 3672 KB Output is correct
98 Correct 57 ms 14204 KB Output is correct
99 Correct 52 ms 14160 KB Output is correct
100 Correct 55 ms 14164 KB Output is correct
101 Correct 52 ms 14164 KB Output is correct
102 Correct 52 ms 14196 KB Output is correct
103 Correct 61 ms 14072 KB Output is correct
104 Correct 52 ms 14128 KB Output is correct
105 Correct 60 ms 14216 KB Output is correct