oj.uz

Submission #419751

# Submission time Handle Problem Language Result Execution time Memory
419751 2021-06-07T12:15:52 Z Mazaalai Connecting Supertrees (IOI20_supertrees) C++17
100 / 100
 257 ms 28004 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
void road(vector <vector<int> >&ans, int a, int b) {
	ans[a][b] = ans[b][a] = 1;
}
int n;
const int N = 1e3 + 5;
vector <int> par(N);
// vector <vector <int> > par(N);
int find(int a) {
	if (par[a] == a) return a;
	return par[a] = find(par[a]);
}
bool merge(int a, int b, vector <vector<int> >& p) {
	int A = find(a), B = find(b);
	par[B] = A;
	// cout << a << ' ' << b << " " << A << ' ' << B << '\n';
	p[A][B] = p[B][A] = 2;
	// cout << "A: ";
	// for (auto el : p[A]) cout << el << ' ';
	// cout << "\n";
	// cout << "B: ";
	// for (auto el : p[B]) cout << el << ' ';
	// cout << "\n";
	if (p[A] != p[B]) return 0;
	for (int i = 0; i < n; i++) {
		if (p[B][i] > 0) p[B][i] = p[i][B] = 0;
	}
	// for (int i = 0; i < n; i++) {
	// 	for (int j = 0; j < n; j++) cout << p[i][j] << ' ';
	// 	cout << "\n";
	// }
	return 1;
}
int construct(vector <vector<int> > p) {
	n = p.size();
	vector <vector <int> > answer(n, vector <int>(n, 0)), paths(n);
	for (int i = 0; i < n; i++) par[i] = i, p[i][i] = 2;
	// cout << "HERE\n";

	for (int i = 0; i < n; i++)
	for (int j = 0; j < n; j++) {
		if (p[i][j] == 3) return 0;
	}
	// cout << "HERE\n";
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (p[i][j] == 1) {
				if (!merge(i, j, p)) {
					return 0;
				}
				road(answer, i, j);
			}
		}
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (p[i][j] == 2) {
				paths[i].push_back(j);
			}
		}
	}

	vector <bool> vis(n+5, 0);
	for (int i = 0; i < n; i++) {
		if (vis[i]) continue;
		vector <int> child, tmp;
		for (auto el : paths[i]) child.push_back(el);
		while(child.size() > 1) {
			if (child.size() & 1) child.push_back(child.back());
			tmp.clear();;
			int k = child.size();
			for (int j = 0; j < k; j+=2) {
				if (paths[child[j]] != paths[child[j+1]]) {
					return 0;
				}
				tmp.push_back(child[j]);
			}
			swap(child, tmp);
		}
		child.clear();
		for (auto el : paths[i]) child.push_back(el);

		// cout << i << ": ";
		// for (auto el : child) cout << el << ' ';
		// cout << '\n';
		int m = paths[i].size();
		if (m == 2) return 0;
		for (int j = 0; j < m; j++) {
			vis[child[j]] = 1;
			road(answer, child[j], child[(j+1)%m]);
		}
	}
	for (int i = 0; i < n; i++) answer[i][i] = 0;
	build(answer);
	return 1;
}

// g++ -std=gnu++17 -O2 -Wall -pipe -static -o supertrees grader.cpp supertrees.cpp

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 10 ms 1144 KB Output is correct
7 Correct 236 ms 22016 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 10 ms 1144 KB Output is correct
7 Correct 236 ms 22016 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 10 ms 1100 KB Output is correct
13 Correct 252 ms 22076 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 716 KB Output is correct
17 Correct 105 ms 12044 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 59 ms 5756 KB Output is correct
21 Correct 234 ms 21956 KB Output is correct
22 Correct 235 ms 22044 KB Output is correct
23 Correct 244 ms 22028 KB Output is correct
24 Correct 235 ms 22140 KB Output is correct
25 Correct 102 ms 12100 KB Output is correct
26 Correct 101 ms 12032 KB Output is correct
27 Correct 252 ms 22024 KB Output is correct
28 Correct 233 ms 22024 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 10 ms 1264 KB Output is correct
9 Correct 240 ms 24020 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 296 KB Output is correct
12 Correct 10 ms 1444 KB Output is correct
13 Correct 240 ms 28004 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 844 KB Output is correct
17 Correct 118 ms 16496 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 300 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 62 ms 6260 KB Output is correct
22 Correct 257 ms 24460 KB Output is correct
23 Correct 238 ms 24052 KB Output is correct
24 Correct 255 ms 27084 KB Output is correct
25 Correct 104 ms 14080 KB Output is correct
26 Correct 106 ms 14588 KB Output is correct
27 Correct 234 ms 24044 KB Output is correct
28 Correct 247 ms 26016 KB Output is correct
29 Correct 106 ms 14064 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 60 ms 5700 KB Output is correct
5 Correct 239 ms 22024 KB Output is correct
6 Correct 233 ms 22084 KB Output is correct
7 Correct 254 ms 22012 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 59 ms 5764 KB Output is correct
10 Correct 248 ms 22580 KB Output is correct
11 Correct 235 ms 22032 KB Output is correct
12 Correct 244 ms 25028 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 60 ms 5700 KB Output is correct
17 Correct 241 ms 22532 KB Output is correct
18 Correct 241 ms 22336 KB Output is correct
19 Correct 235 ms 22088 KB Output is correct
20 Correct 244 ms 22156 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 10 ms 1144 KB Output is correct
7 Correct 236 ms 22016 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 10 ms 1100 KB Output is correct
13 Correct 252 ms 22076 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 716 KB Output is correct
17 Correct 105 ms 12044 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 59 ms 5756 KB Output is correct
21 Correct 234 ms 21956 KB Output is correct
22 Correct 235 ms 22044 KB Output is correct
23 Correct 244 ms 22028 KB Output is correct
24 Correct 235 ms 22140 KB Output is correct
25 Correct 102 ms 12100 KB Output is correct
26 Correct 101 ms 12032 KB Output is correct
27 Correct 252 ms 22024 KB Output is correct
28 Correct 233 ms 22024 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 10 ms 1264 KB Output is correct
37 Correct 240 ms 24020 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 296 KB Output is correct
40 Correct 10 ms 1444 KB Output is correct
41 Correct 240 ms 28004 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 5 ms 844 KB Output is correct
45 Correct 118 ms 16496 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 0 ms 300 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 62 ms 6260 KB Output is correct
50 Correct 257 ms 24460 KB Output is correct
51 Correct 238 ms 24052 KB Output is correct
52 Correct 255 ms 27084 KB Output is correct
53 Correct 104 ms 14080 KB Output is correct
54 Correct 106 ms 14588 KB Output is correct
55 Correct 234 ms 24044 KB Output is correct
56 Correct 247 ms 26016 KB Output is correct
57 Correct 106 ms 14064 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 5 ms 844 KB Output is correct
61 Correct 106 ms 14072 KB Output is correct
62 Correct 1 ms 204 KB Output is correct
63 Correct 1 ms 204 KB Output is correct
64 Correct 1 ms 204 KB Output is correct
65 Correct 60 ms 6220 KB Output is correct
66 Correct 101 ms 14060 KB Output is correct
67 Correct 99 ms 14064 KB Output is correct
68 Correct 100 ms 13988 KB Output is correct
69 Correct 104 ms 14076 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 10 ms 1144 KB Output is correct
7 Correct 236 ms 22016 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 10 ms 1100 KB Output is correct
13 Correct 252 ms 22076 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 716 KB Output is correct
17 Correct 105 ms 12044 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 59 ms 5756 KB Output is correct
21 Correct 234 ms 21956 KB Output is correct
22 Correct 235 ms 22044 KB Output is correct
23 Correct 244 ms 22028 KB Output is correct
24 Correct 235 ms 22140 KB Output is correct
25 Correct 102 ms 12100 KB Output is correct
26 Correct 101 ms 12032 KB Output is correct
27 Correct 252 ms 22024 KB Output is correct
28 Correct 233 ms 22024 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 10 ms 1264 KB Output is correct
37 Correct 240 ms 24020 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 296 KB Output is correct
40 Correct 10 ms 1444 KB Output is correct
41 Correct 240 ms 28004 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 5 ms 844 KB Output is correct
45 Correct 118 ms 16496 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 0 ms 300 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 62 ms 6260 KB Output is correct
50 Correct 257 ms 24460 KB Output is correct
51 Correct 238 ms 24052 KB Output is correct
52 Correct 255 ms 27084 KB Output is correct
53 Correct 104 ms 14080 KB Output is correct
54 Correct 106 ms 14588 KB Output is correct
55 Correct 234 ms 24044 KB Output is correct
56 Correct 247 ms 26016 KB Output is correct
57 Correct 106 ms 14064 KB Output is correct
58 Correct 0 ms 204 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 1 ms 204 KB Output is correct
61 Correct 60 ms 5700 KB Output is correct
62 Correct 239 ms 22024 KB Output is correct
63 Correct 233 ms 22084 KB Output is correct
64 Correct 254 ms 22012 KB Output is correct
65 Correct 1 ms 204 KB Output is correct
66 Correct 59 ms 5764 KB Output is correct
67 Correct 248 ms 22580 KB Output is correct
68 Correct 235 ms 22032 KB Output is correct
69 Correct 244 ms 25028 KB Output is correct
70 Correct 0 ms 204 KB Output is correct
71 Correct 1 ms 204 KB Output is correct
72 Correct 1 ms 204 KB Output is correct
73 Correct 60 ms 5700 KB Output is correct
74 Correct 241 ms 22532 KB Output is correct
75 Correct 241 ms 22336 KB Output is correct
76 Correct 235 ms 22088 KB Output is correct
77 Correct 244 ms 22156 KB Output is correct
78 Correct 1 ms 204 KB Output is correct
79 Correct 1 ms 204 KB Output is correct
80 Correct 5 ms 844 KB Output is correct
81 Correct 106 ms 14072 KB Output is correct
82 Correct 1 ms 204 KB Output is correct
83 Correct 1 ms 204 KB Output is correct
84 Correct 1 ms 204 KB Output is correct
85 Correct 60 ms 6220 KB Output is correct
86 Correct 101 ms 14060 KB Output is correct
87 Correct 99 ms 14064 KB Output is correct
88 Correct 100 ms 13988 KB Output is correct
89 Correct 104 ms 14076 KB Output is correct
90 Correct 1 ms 204 KB Output is correct
91 Correct 1 ms 204 KB Output is correct
92 Correct 5 ms 844 KB Output is correct
93 Correct 104 ms 14064 KB Output is correct
94 Correct 1 ms 204 KB Output is correct
95 Correct 0 ms 204 KB Output is correct
96 Correct 1 ms 204 KB Output is correct
97 Correct 25 ms 3692 KB Output is correct
98 Correct 101 ms 14072 KB Output is correct
99 Correct 107 ms 14060 KB Output is correct
100 Correct 105 ms 14076 KB Output is correct
101 Correct 99 ms 14076 KB Output is correct
102 Correct 100 ms 14060 KB Output is correct
103 Correct 99 ms 14068 KB Output is correct
104 Correct 104 ms 14020 KB Output is correct
105 Correct 110 ms 14072 KB Output is correct