oj.uz

Submission #838658

# Submission time Handle Problem Language Result Execution time Memory
838658 2023-08-27T14:18:17 Z SoulKnight Connecting Supertrees (IOI20_supertrees) C++17
96 / 100
 182 ms 24032 KB 
#include "supertrees.h"
#include <vector>
#include <iostream>
#include <numeric>
#include <cstring>

using namespace std;

#define ll long long
#define ln '\n'

const int N = 1000 + 5;

int par[N], who[N];
vector<int> com[N];


int find(int u){return ((u == par[u])? u: par[u]=find(par[u]));}



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

	iota(par, par+n, 0);
	memset(who, -1, sizeof(who));

	for (int i = 0; i < n; i++){
		for (int j = i+1; j < n; j++){
			if (p[i][j] == 0) continue;
			par[find(i)] = find(j);
		}
	}

	// for (int i = 0; i < n; i++){
	// 	for (int j = i+1; j < n; j++){
	// 		if (p[i][j] == 0 && find(i) == find(j)) return 0;
	// 	}
	// }

	for (int i = 0; i < n; i++){
		com[find(i)].push_back(i);
	}


	for (int i = 0; i < n; i++){
		if (com[i].size() <= 1) continue;

		vector<int> cycle;

		for (auto& v: com[i]){
			vector<int> line; line.push_back(v);
			for (auto& j: com[i]){
				if (v == j) continue;
				if (p[v][j] == 2) continue;
				if (p[j][v] == 0) return 0;
				if (who[j] != who[v]) return 0;


				if (who[j] == -1) who[j] = v;
				line.push_back(j);
			}
			if (who[v] == -1) {
				who[v] = v;
				cycle.push_back(v);
				for (int k = 1; k < line.size(); k++) {
					answer[line[k]][line[k-1]] = answer[line[k-1]][line[k]] = 1;
				}
			}
		}

		if (cycle.size() == 1) continue;
		if (cycle.size() == 2) return 0;

		for (int i = 1; i < cycle.size(); i++){
			answer[cycle[i-1]][cycle[i]] = answer[cycle[i]][cycle[i-1]] = 1;
		}
		answer[cycle.front()][cycle.back()] = answer[cycle.back()][cycle.front()] = 1;
	}


	build(answer);
	return 1;
}

Compilation message

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

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 336 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 7 ms 1236 KB Output is correct
7 Correct 171 ms 22316 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 336 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 7 ms 1236 KB Output is correct
7 Correct 171 ms 22316 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1236 KB Output is correct
13 Correct 150 ms 23944 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 852 KB Output is correct
17 Correct 72 ms 14108 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 39 ms 6224 KB Output is correct
21 Correct 153 ms 23952 KB Output is correct
22 Correct 155 ms 24028 KB Output is correct
23 Correct 182 ms 23952 KB Output is correct
24 Correct 153 ms 23988 KB Output is correct
25 Correct 65 ms 14028 KB Output is correct
26 Correct 66 ms 14108 KB Output is correct
27 Correct 156 ms 24012 KB Output is correct
28 Correct 154 ms 23960 KB Output is correct

Subtask #3
19.0 / 19.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 1 ms 212 KB Output is correct
5 Correct 0 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 8 ms 1108 KB Output is correct
9 Correct 156 ms 22000 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 6 ms 1236 KB Output is correct
13 Correct 160 ms 22100 KB Output is correct
14 Correct 1 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 84 ms 12112 KB Output is correct
18 Correct 1 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 38 ms 5708 KB Output is correct
22 Correct 164 ms 22156 KB Output is correct
23 Correct 154 ms 21992 KB Output is correct
24 Correct 156 ms 22092 KB Output is correct
25 Correct 65 ms 12192 KB Output is correct
26 Correct 69 ms 12068 KB Output is correct
27 Correct 152 ms 21972 KB Output is correct
28 Correct 162 ms 22024 KB Output is correct
29 Correct 65 ms 12108 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 39 ms 6216 KB Output is correct
5 Correct 152 ms 23964 KB Output is correct
6 Correct 153 ms 23928 KB Output is correct
7 Correct 166 ms 24000 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 38 ms 6220 KB Output is correct
10 Correct 153 ms 23996 KB Output is correct
11 Correct 163 ms 24032 KB Output is correct
12 Correct 157 ms 24016 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 39 ms 6220 KB Output is correct
17 Correct 155 ms 24012 KB Output is correct
18 Correct 154 ms 24012 KB Output is correct
19 Correct 162 ms 24008 KB Output is correct
20 Correct 154 ms 24000 KB Output is correct

Subtask #5
21.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 336 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 7 ms 1236 KB Output is correct
7 Correct 171 ms 22316 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1236 KB Output is correct
13 Correct 150 ms 23944 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 852 KB Output is correct
17 Correct 72 ms 14108 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 39 ms 6224 KB Output is correct
21 Correct 153 ms 23952 KB Output is correct
22 Correct 155 ms 24028 KB Output is correct
23 Correct 182 ms 23952 KB Output is correct
24 Correct 153 ms 23988 KB Output is correct
25 Correct 65 ms 14028 KB Output is correct
26 Correct 66 ms 14108 KB Output is correct
27 Correct 156 ms 24012 KB Output is correct
28 Correct 154 ms 23960 KB Output is correct
29 Correct 1 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 1 ms 212 KB Output is correct
33 Correct 0 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 8 ms 1108 KB Output is correct
37 Correct 156 ms 22000 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 6 ms 1236 KB Output is correct
41 Correct 160 ms 22100 KB Output is correct
42 Correct 1 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 84 ms 12112 KB Output is correct
46 Correct 1 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 38 ms 5708 KB Output is correct
50 Correct 164 ms 22156 KB Output is correct
51 Correct 154 ms 21992 KB Output is correct
52 Correct 156 ms 22092 KB Output is correct
53 Correct 65 ms 12192 KB Output is correct
54 Correct 69 ms 12068 KB Output is correct
55 Correct 152 ms 21972 KB Output is correct
56 Correct 162 ms 22024 KB Output is correct
57 Correct 65 ms 12108 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 0 ms 340 KB Output is correct
60 Correct 3 ms 852 KB Output is correct
61 Correct 68 ms 14096 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 1 ms 212 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Correct 38 ms 6220 KB Output is correct
66 Correct 64 ms 14028 KB Output is correct
67 Correct 66 ms 14028 KB Output is correct
68 Correct 66 ms 14028 KB Output is correct
69 Correct 67 ms 14028 KB Output is correct

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 336 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 7 ms 1236 KB Output is correct
7 Correct 171 ms 22316 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1236 KB Output is correct
13 Correct 150 ms 23944 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 852 KB Output is correct
17 Correct 72 ms 14108 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 39 ms 6224 KB Output is correct
21 Correct 153 ms 23952 KB Output is correct
22 Correct 155 ms 24028 KB Output is correct
23 Correct 182 ms 23952 KB Output is correct
24 Correct 153 ms 23988 KB Output is correct
25 Correct 65 ms 14028 KB Output is correct
26 Correct 66 ms 14108 KB Output is correct
27 Correct 156 ms 24012 KB Output is correct
28 Correct 154 ms 23960 KB Output is correct
29 Correct 1 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 1 ms 212 KB Output is correct
33 Correct 0 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 8 ms 1108 KB Output is correct
37 Correct 156 ms 22000 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 6 ms 1236 KB Output is correct
41 Correct 160 ms 22100 KB Output is correct
42 Correct 1 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 84 ms 12112 KB Output is correct
46 Correct 1 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 38 ms 5708 KB Output is correct
50 Correct 164 ms 22156 KB Output is correct
51 Correct 154 ms 21992 KB Output is correct
52 Correct 156 ms 22092 KB Output is correct
53 Correct 65 ms 12192 KB Output is correct
54 Correct 69 ms 12068 KB Output is correct
55 Correct 152 ms 21972 KB Output is correct
56 Correct 162 ms 22024 KB Output is correct
57 Correct 65 ms 12108 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 39 ms 6216 KB Output is correct
62 Correct 152 ms 23964 KB Output is correct
63 Correct 153 ms 23928 KB Output is correct
64 Correct 166 ms 24000 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 38 ms 6220 KB Output is correct
67 Correct 153 ms 23996 KB Output is correct
68 Correct 163 ms 24032 KB Output is correct
69 Correct 157 ms 24016 KB Output is correct
70 Correct 1 ms 340 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 1 ms 212 KB Output is correct
73 Correct 39 ms 6220 KB Output is correct
74 Correct 155 ms 24012 KB Output is correct
75 Correct 154 ms 24012 KB Output is correct
76 Correct 162 ms 24008 KB Output is correct
77 Correct 154 ms 24000 KB Output is correct
78 Correct 0 ms 212 KB Output is correct
79 Correct 0 ms 340 KB Output is correct
80 Correct 3 ms 852 KB Output is correct
81 Correct 68 ms 14096 KB Output is correct
82 Correct 1 ms 340 KB Output is correct
83 Correct 1 ms 212 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 38 ms 6220 KB Output is correct
86 Correct 64 ms 14028 KB Output is correct
87 Correct 66 ms 14028 KB Output is correct
88 Correct 66 ms 14028 KB Output is correct
89 Correct 67 ms 14028 KB Output is correct
90 Correct 1 ms 212 KB Output is correct
91 Correct 1 ms 212 KB Output is correct
92 Correct 3 ms 852 KB Output is correct
93 Correct 68 ms 14092 KB Output is correct
94 Incorrect 1 ms 340 KB Answer gives possible 1 while actual possible 0
95 Halted 0 ms 0 KB -