oj.uz

Submission #302759

# Submission time Handle Problem Language Result Execution time Memory
302759 2020-09-19T07:05:21 Z kimjg1119 Connecting Supertrees (IOI20_supertrees) C++17
100 / 100
 275 ms 22268 KB 
#include "supertrees.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;

int pa[1010];

int fi(int x) {
	return pa[x] = x == pa[x] ? x : fi(pa[x]);
}
void un(int a, int b) {
	a = fi(a); b = fi(b);
	if (a == b) return;
	pa[a] = b;
}

vector<int> v[1010];
int cyc[1010], cnt = 0;

int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	std::vector<std::vector<int>> ans;
	for (int i = 0; i < n; i++) {
		std::vector<int> row;
		row.resize(n);
		ans.push_back(row);
	}
	for (int i = 0; i < n; i++) pa[i] = i;

	//start here

	for (int i = 0; i < n; i++)
		for (int j = 0; j < n; j++) {
			if (p[i][j]) un(i, j);
			if (p[i][j] == 3) return 0;
		}
			

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if ((bool)p[i][j] != (fi(i) == fi(j))) return 0;
		}
	}
	for (int i = 0; i < n; i++)
		v[fi(i)].push_back(i);

	// finished component distribute

	for (int k = 0; k < n; k++) {
		if (v[k].size() <= 1) continue;
		if (v[k].size() == 2) {
			if (p[v[k][0]][v[k][1]] == 2) return 0;
			else {
				ans[v[k][0]][v[k][1]] = ans[v[k][1]][v[k][0]] = 1;
				continue;
			}
		}

		int m = v[k].size(), flag = 1;

		//check all 1
		for (int i = 0; i < m; i++)
			for (int j = 0; j < m; j++)
				if (p[v[k][i]][v[k][j]] == 2) flag = 0;
		if (flag) {
			for (int i = 0; i < m - 1; i++) {
				int a = v[k][i], b = v[k][i + 1];
				ans[a][b] = ans[b][a] = 1;
			}
			continue;
		}

		// union all 1 and check
		for (int i = 0; i < n; i++) pa[i] = i;
		for (int i = 0; i < m; i++)
			for (int j = i + 1; j < m; j++)
				if (p[v[k][i]][v[k][j]] == 1) un(v[k][i], v[k][j]);
		for (int i = 0; i < m; i++)
			for (int j = i + 1; j < m; j++)
				if (p[v[k][i]][v[k][j]] == 2 && fi(v[k][i]) == fi(v[k][j])) return 0;

		// remain edges
		vector<vector<int>> ad(n);
		vector<int> chk(n);
		vector<int> root;

		for (int i = 0; i < m; i++)
			ad[fi(v[k][i])].push_back(v[k][i]);
		for (int i = 0; i < n; i++) {
			if (ad[i].empty()) continue;
			root.push_back(ad[i][0]);
			for (int j = 0; j + 1 < ad[i].size(); j++) {
				int a = ad[i][j], b = ad[i][j + 1];
				ans[a][b] = ans[b][a] = 1;
			}
		}
		if (root.size() <= 2) return 0;

		// make cycle
		for (int i = 0; i < root.size(); i++) {
			int a = root[i], b = root[(i + 1) % root.size()];
			ans[a][b] = ans[b][a] = 1;
		}
	}

	build(ans);
	return 1;
}

Compilation message

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

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 12 ms 1280 KB Output is correct
7 Correct 268 ms 22136 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 12 ms 1280 KB Output is correct
7 Correct 268 ms 22136 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 243 ms 22136 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 124 ms 12152 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 67 ms 5880 KB Output is correct
21 Correct 258 ms 22136 KB Output is correct
22 Correct 246 ms 22136 KB Output is correct
23 Correct 263 ms 22136 KB Output is correct
24 Correct 243 ms 22264 KB Output is correct
25 Correct 105 ms 12152 KB Output is correct
26 Correct 101 ms 12152 KB Output is correct
27 Correct 273 ms 22136 KB Output is correct
28 Correct 245 ms 22136 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 12 ms 1280 KB Output is correct
9 Correct 240 ms 22136 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 11 ms 1280 KB Output is correct
13 Correct 272 ms 22268 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 120 ms 12152 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 63 ms 5880 KB Output is correct
22 Correct 254 ms 22140 KB Output is correct
23 Correct 249 ms 22136 KB Output is correct
24 Correct 269 ms 22264 KB Output is correct
25 Correct 106 ms 12280 KB Output is correct
26 Correct 104 ms 12152 KB Output is correct
27 Correct 252 ms 22136 KB Output is correct
28 Correct 271 ms 22132 KB Output is correct
29 Correct 108 ms 12280 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 67 ms 5868 KB Output is correct
5 Correct 251 ms 22264 KB Output is correct
6 Correct 251 ms 22264 KB Output is correct
7 Correct 268 ms 22264 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 63 ms 5876 KB Output is correct
10 Correct 254 ms 22216 KB Output is correct
11 Correct 253 ms 22260 KB Output is correct
12 Correct 275 ms 22136 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 63 ms 5880 KB Output is correct
17 Correct 254 ms 22136 KB Output is correct
18 Correct 253 ms 22136 KB Output is correct
19 Correct 248 ms 22136 KB Output is correct
20 Correct 250 ms 22180 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 12 ms 1280 KB Output is correct
7 Correct 268 ms 22136 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 243 ms 22136 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 124 ms 12152 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 67 ms 5880 KB Output is correct
21 Correct 258 ms 22136 KB Output is correct
22 Correct 246 ms 22136 KB Output is correct
23 Correct 263 ms 22136 KB Output is correct
24 Correct 243 ms 22264 KB Output is correct
25 Correct 105 ms 12152 KB Output is correct
26 Correct 101 ms 12152 KB Output is correct
27 Correct 273 ms 22136 KB Output is correct
28 Correct 245 ms 22136 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 12 ms 1280 KB Output is correct
37 Correct 240 ms 22136 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 11 ms 1280 KB Output is correct
41 Correct 272 ms 22268 KB Output is correct
42 Correct 0 ms 384 KB Output is correct
43 Correct 0 ms 384 KB Output is correct
44 Correct 5 ms 768 KB Output is correct
45 Correct 120 ms 12152 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 0 ms 384 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 63 ms 5880 KB Output is correct
50 Correct 254 ms 22140 KB Output is correct
51 Correct 249 ms 22136 KB Output is correct
52 Correct 269 ms 22264 KB Output is correct
53 Correct 106 ms 12280 KB Output is correct
54 Correct 104 ms 12152 KB Output is correct
55 Correct 252 ms 22136 KB Output is correct
56 Correct 271 ms 22132 KB Output is correct
57 Correct 108 ms 12280 KB Output is correct
58 Correct 1 ms 416 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 5 ms 768 KB Output is correct
61 Correct 126 ms 12152 KB Output is correct
62 Correct 0 ms 384 KB Output is correct
63 Correct 0 ms 384 KB Output is correct
64 Correct 0 ms 384 KB Output is correct
65 Correct 64 ms 5880 KB Output is correct
66 Correct 108 ms 12152 KB Output is correct
67 Correct 109 ms 12152 KB Output is correct
68 Correct 104 ms 12152 KB Output is correct
69 Correct 105 ms 12284 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 12 ms 1280 KB Output is correct
7 Correct 268 ms 22136 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 243 ms 22136 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 124 ms 12152 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 67 ms 5880 KB Output is correct
21 Correct 258 ms 22136 KB Output is correct
22 Correct 246 ms 22136 KB Output is correct
23 Correct 263 ms 22136 KB Output is correct
24 Correct 243 ms 22264 KB Output is correct
25 Correct 105 ms 12152 KB Output is correct
26 Correct 101 ms 12152 KB Output is correct
27 Correct 273 ms 22136 KB Output is correct
28 Correct 245 ms 22136 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 12 ms 1280 KB Output is correct
37 Correct 240 ms 22136 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 11 ms 1280 KB Output is correct
41 Correct 272 ms 22268 KB Output is correct
42 Correct 0 ms 384 KB Output is correct
43 Correct 0 ms 384 KB Output is correct
44 Correct 5 ms 768 KB Output is correct
45 Correct 120 ms 12152 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 0 ms 384 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 63 ms 5880 KB Output is correct
50 Correct 254 ms 22140 KB Output is correct
51 Correct 249 ms 22136 KB Output is correct
52 Correct 269 ms 22264 KB Output is correct
53 Correct 106 ms 12280 KB Output is correct
54 Correct 104 ms 12152 KB Output is correct
55 Correct 252 ms 22136 KB Output is correct
56 Correct 271 ms 22132 KB Output is correct
57 Correct 108 ms 12280 KB Output is correct
58 Correct 0 ms 384 KB Output is correct
59 Correct 0 ms 384 KB Output is correct
60 Correct 0 ms 384 KB Output is correct
61 Correct 67 ms 5868 KB Output is correct
62 Correct 251 ms 22264 KB Output is correct
63 Correct 251 ms 22264 KB Output is correct
64 Correct 268 ms 22264 KB Output is correct
65 Correct 0 ms 384 KB Output is correct
66 Correct 63 ms 5876 KB Output is correct
67 Correct 254 ms 22216 KB Output is correct
68 Correct 253 ms 22260 KB Output is correct
69 Correct 275 ms 22136 KB Output is correct
70 Correct 0 ms 384 KB Output is correct
71 Correct 1 ms 384 KB Output is correct
72 Correct 0 ms 384 KB Output is correct
73 Correct 63 ms 5880 KB Output is correct
74 Correct 254 ms 22136 KB Output is correct
75 Correct 253 ms 22136 KB Output is correct
76 Correct 248 ms 22136 KB Output is correct
77 Correct 250 ms 22180 KB Output is correct
78 Correct 1 ms 416 KB Output is correct
79 Correct 1 ms 384 KB Output is correct
80 Correct 5 ms 768 KB Output is correct
81 Correct 126 ms 12152 KB Output is correct
82 Correct 0 ms 384 KB Output is correct
83 Correct 0 ms 384 KB Output is correct
84 Correct 0 ms 384 KB Output is correct
85 Correct 64 ms 5880 KB Output is correct
86 Correct 108 ms 12152 KB Output is correct
87 Correct 109 ms 12152 KB Output is correct
88 Correct 104 ms 12152 KB Output is correct
89 Correct 105 ms 12284 KB Output is correct
90 Correct 0 ms 384 KB Output is correct
91 Correct 0 ms 384 KB Output is correct
92 Correct 5 ms 768 KB Output is correct
93 Correct 110 ms 12152 KB Output is correct
94 Correct 1 ms 384 KB Output is correct
95 Correct 0 ms 384 KB Output is correct
96 Correct 0 ms 384 KB Output is correct
97 Correct 28 ms 3320 KB Output is correct
98 Correct 103 ms 12148 KB Output is correct
99 Correct 103 ms 12152 KB Output is correct
100 Correct 101 ms 12152 KB Output is correct
101 Correct 108 ms 12148 KB Output is correct
102 Correct 112 ms 12152 KB Output is correct
103 Correct 112 ms 12152 KB Output is correct
104 Correct 117 ms 12152 KB Output is correct
105 Correct 111 ms 12152 KB Output is correct