oj.uz

Submission #897817

# Submission time Handle Problem Language Result Execution time Memory
897817 2024-01-03T18:10:32 Z aqxa Connecting Supertrees (IOI20_supertrees) C++17
100 / 100
 180 ms 24324 KB 
#include <bits/stdc++.h>
using namespace std;
 
using ll = long long; 

const int N = 1001; 

#include "supertrees.h"
// void build(vector<vector<int>> g) {
// 	int n = g.size(); 
// 	for (int i = 0; i < n; ++i) {
// 		for (int j = 0; j < n; ++j) cout << g[i][j]; 
// 		cout << "\n";
// 	}
// }

int construct(vector<std::vector<int>> p) {
	int n = p.size();

	vector<int> vis(n, 0);  
	int cnt = 0; 

	vector<vector<int>> comp; 

	for (int i = 0;	i < n; ++i) {
		if (!vis[i]) {
			vis[i] = ++cnt; 
			vector<int> cur(1, i); 
			queue<int> q; 
			q.push(i); 
			while (!q.empty()) {
				auto x = q.front(); 
				q.pop(); 
				for (int u = 0; u < n; ++u) { 
					if (u != x && p[x][u] > 0 && vis[u] == 0) {
						vis[u] = cnt; 
						q.push(u); 
						cur.push_back(u); 
					}
				}
			}

			comp.push_back(cur); 
		}
	}

	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < n; ++j) {
			if (p[i][j] == 3) return 0; 
			if (p[i][j] == 0 && vis[i] == vis[j]) return 0; 
			if (p[i][j] > 0 && vis[i] != vis[j]) return 0; 
		}
	}

	vector<vector<int>> ans(n, vector<int>(n, 0)); 
	for (int i = 0; i < n; ++i) ans[i][i] = 0; 

	for (auto c: comp) {
		int m = c.size(); 
		vector<int> vis2(m, 0); 
		int cnt2 = 0;  
		vector<vector<int>> comp2; 
		for (int i = 0; i < m; ++i) {
			if (!vis2[i]) {
				vis2[i] = ++cnt2; 
				vector<int> cur(1, i); 
				queue<int> q; 
				q.push(i); 
				while (!q.empty()) {
					auto x = q.front(); 
					q.pop(); 
					for (int u = 0; u < m; ++u) {
						if (u != x && p[c[x]][c[u]] == 1 && vis2[u] == 0) {
							vis2[u] = cnt2; 
							q.push(u); 
							cur.push_back(u); 
						}
					}
				}
				comp2.push_back(cur); 
			}
		}
		for (int i = 0; i < m; ++i) {
			for (int j = 0; j < m; ++j) {
				if (vis2[i] == vis2[j] && p[c[i]][c[j]] != 1) return 0; 
				if (vis2[i] != vis2[j] && p[c[i]][c[j]] != 2) return 0; 
			}
		}
		if (comp2.size() == 2) return 0; 
		if (comp2.size() == 1) {
			for (int i = 0; i < m - 1; ++i) {
				ans[c[i]][c[i + 1]] = 1; 
				ans[c[i + 1]][c[i]] = 1; 
			}
		} else {
			for (int i = 0; i < (int) comp2.size(); ++i) {
				int u = comp2[i][0], v = comp2[(i + 1) % ((int) comp2.size())][0]; 
				ans[c[u]][c[v]] = 1; 
				ans[c[v]][c[u]] = 1; 

				for (int j = 1; j < (int) comp2[i].size(); ++j) {
					ans[c[u]][c[comp2[i][j]]] = 1; 
					ans[c[comp2[i][j]]][c[u]] = 1; 
				}
			}
		}
	}
	build(ans); 

	return 1;
}

 
// int32_t main() {
// 	ios::sync_with_stdio(false);
// 	cin.tie(nullptr);
	
// 	int n; 
// 	cin >> n; 
// 	vector<vector<int>> g(n, vector<int>(n)); 
// 	for (auto & x: g) for (auto & y: x) cin >> y; 
// 	cout << "Ans: \n" << construct(g) << "\n";

 
// 	return 0; 
// }

Subtask #1
11.0 / 11.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 0 ms 432 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1376 KB Output is correct
7 Correct 157 ms 23944 KB Output is correct

Subtask #2
10.0 / 10.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 0 ms 432 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1376 KB Output is correct
7 Correct 157 ms 23944 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1372 KB Output is correct
13 Correct 151 ms 24184 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 696 KB Output is correct
17 Correct 73 ms 10068 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 500 KB Output is correct
20 Correct 39 ms 6236 KB Output is correct
21 Correct 156 ms 23992 KB Output is correct
22 Correct 153 ms 23960 KB Output is correct
23 Correct 160 ms 24148 KB Output is correct
24 Correct 152 ms 24104 KB Output is correct
25 Correct 67 ms 10068 KB Output is correct
26 Correct 65 ms 10068 KB Output is correct
27 Correct 165 ms 24092 KB Output is correct
28 Correct 153 ms 24144 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 1 ms 348 KB Output is correct
3 Correct 1 ms 760 KB Output is correct
4 Correct 0 ms 436 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 6 ms 1372 KB Output is correct
9 Correct 155 ms 24060 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 440 KB Output is correct
12 Correct 7 ms 1372 KB Output is correct
13 Correct 158 ms 24092 KB Output is correct
14 Correct 0 ms 544 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 604 KB Output is correct
17 Correct 76 ms 10112 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 38 ms 6228 KB Output is correct
22 Correct 157 ms 24148 KB Output is correct
23 Correct 158 ms 24056 KB Output is correct
24 Correct 159 ms 23948 KB Output is correct
25 Correct 69 ms 14072 KB Output is correct
26 Correct 74 ms 10112 KB Output is correct
27 Correct 153 ms 24144 KB Output is correct
28 Correct 178 ms 23980 KB Output is correct
29 Correct 66 ms 14088 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 436 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 39 ms 6268 KB Output is correct
5 Correct 156 ms 24324 KB Output is correct
6 Correct 151 ms 24272 KB Output is correct
7 Correct 159 ms 24148 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 40 ms 6224 KB Output is correct
10 Correct 153 ms 23944 KB Output is correct
11 Correct 156 ms 24204 KB Output is correct
12 Correct 177 ms 23964 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 436 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 38 ms 6224 KB Output is correct
17 Correct 180 ms 23964 KB Output is correct
18 Correct 153 ms 24100 KB Output is correct
19 Correct 151 ms 24084 KB Output is correct
20 Correct 151 ms 24096 KB Output is correct

Subtask #5
21.0 / 21.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 0 ms 432 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1376 KB Output is correct
7 Correct 157 ms 23944 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1372 KB Output is correct
13 Correct 151 ms 24184 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 696 KB Output is correct
17 Correct 73 ms 10068 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 500 KB Output is correct
20 Correct 39 ms 6236 KB Output is correct
21 Correct 156 ms 23992 KB Output is correct
22 Correct 153 ms 23960 KB Output is correct
23 Correct 160 ms 24148 KB Output is correct
24 Correct 152 ms 24104 KB Output is correct
25 Correct 67 ms 10068 KB Output is correct
26 Correct 65 ms 10068 KB Output is correct
27 Correct 165 ms 24092 KB Output is correct
28 Correct 153 ms 24144 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 760 KB Output is correct
32 Correct 0 ms 436 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 6 ms 1372 KB Output is correct
37 Correct 155 ms 24060 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 440 KB Output is correct
40 Correct 7 ms 1372 KB Output is correct
41 Correct 158 ms 24092 KB Output is correct
42 Correct 0 ms 544 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 604 KB Output is correct
45 Correct 76 ms 10112 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 344 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 38 ms 6228 KB Output is correct
50 Correct 157 ms 24148 KB Output is correct
51 Correct 158 ms 24056 KB Output is correct
52 Correct 159 ms 23948 KB Output is correct
53 Correct 69 ms 14072 KB Output is correct
54 Correct 74 ms 10112 KB Output is correct
55 Correct 153 ms 24144 KB Output is correct
56 Correct 178 ms 23980 KB Output is correct
57 Correct 66 ms 14088 KB Output is correct
58 Correct 0 ms 344 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 3 ms 604 KB Output is correct
61 Correct 71 ms 10108 KB Output is correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 1 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 39 ms 6236 KB Output is correct
66 Correct 67 ms 10068 KB Output is correct
67 Correct 67 ms 10112 KB Output is correct
68 Correct 65 ms 10244 KB Output is correct
69 Correct 67 ms 14068 KB Output is correct

Subtask #6
4.0 / 4.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 0 ms 432 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1376 KB Output is correct
7 Correct 157 ms 23944 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1372 KB Output is correct
13 Correct 151 ms 24184 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 696 KB Output is correct
17 Correct 73 ms 10068 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 500 KB Output is correct
20 Correct 39 ms 6236 KB Output is correct
21 Correct 156 ms 23992 KB Output is correct
22 Correct 153 ms 23960 KB Output is correct
23 Correct 160 ms 24148 KB Output is correct
24 Correct 152 ms 24104 KB Output is correct
25 Correct 67 ms 10068 KB Output is correct
26 Correct 65 ms 10068 KB Output is correct
27 Correct 165 ms 24092 KB Output is correct
28 Correct 153 ms 24144 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 760 KB Output is correct
32 Correct 0 ms 436 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 6 ms 1372 KB Output is correct
37 Correct 155 ms 24060 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 440 KB Output is correct
40 Correct 7 ms 1372 KB Output is correct
41 Correct 158 ms 24092 KB Output is correct
42 Correct 0 ms 544 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 604 KB Output is correct
45 Correct 76 ms 10112 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 344 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 38 ms 6228 KB Output is correct
50 Correct 157 ms 24148 KB Output is correct
51 Correct 158 ms 24056 KB Output is correct
52 Correct 159 ms 23948 KB Output is correct
53 Correct 69 ms 14072 KB Output is correct
54 Correct 74 ms 10112 KB Output is correct
55 Correct 153 ms 24144 KB Output is correct
56 Correct 178 ms 23980 KB Output is correct
57 Correct 66 ms 14088 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 0 ms 436 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 39 ms 6268 KB Output is correct
62 Correct 156 ms 24324 KB Output is correct
63 Correct 151 ms 24272 KB Output is correct
64 Correct 159 ms 24148 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 40 ms 6224 KB Output is correct
67 Correct 153 ms 23944 KB Output is correct
68 Correct 156 ms 24204 KB Output is correct
69 Correct 177 ms 23964 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 0 ms 436 KB Output is correct
72 Correct 1 ms 348 KB Output is correct
73 Correct 38 ms 6224 KB Output is correct
74 Correct 180 ms 23964 KB Output is correct
75 Correct 153 ms 24100 KB Output is correct
76 Correct 151 ms 24084 KB Output is correct
77 Correct 151 ms 24096 KB Output is correct
78 Correct 0 ms 344 KB Output is correct
79 Correct 0 ms 348 KB Output is correct
80 Correct 3 ms 604 KB Output is correct
81 Correct 71 ms 10108 KB Output is correct
82 Correct 0 ms 344 KB Output is correct
83 Correct 1 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 39 ms 6236 KB Output is correct
86 Correct 67 ms 10068 KB Output is correct
87 Correct 67 ms 10112 KB Output is correct
88 Correct 65 ms 10244 KB Output is correct
89 Correct 67 ms 14068 KB Output is correct
90 Correct 0 ms 344 KB Output is correct
91 Correct 1 ms 348 KB Output is correct
92 Correct 3 ms 680 KB Output is correct
93 Correct 74 ms 10232 KB Output is correct
94 Correct 0 ms 348 KB Output is correct
95 Correct 0 ms 348 KB Output is correct
96 Correct 0 ms 348 KB Output is correct
97 Correct 17 ms 2908 KB Output is correct
98 Correct 67 ms 10164 KB Output is correct
99 Correct 67 ms 10068 KB Output is correct
100 Correct 67 ms 10064 KB Output is correct
101 Correct 61 ms 10324 KB Output is correct
102 Correct 66 ms 10064 KB Output is correct
103 Correct 66 ms 10064 KB Output is correct
104 Correct 72 ms 10120 KB Output is correct
105 Correct 98 ms 10116 KB Output is correct