oj.uz

Submission #827203

# Submission time Handle Problem Language Result Execution time Memory
827203 2023-08-16T09:53:34 Z tomruk Connecting Supertrees (IOI20_supertrees) C++17
96 / 100
 229 ms 24084 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
int construct(vector<vector<int>> p) {
	int n = p.size();
	vector<vector<int>> answer(n,(vector<int>(n,0)));
	vector<bool> used(n,0);
	vector<int> col(n,0);
	set<int> cur;
	function<void(int)> dfs = [&](int v)->void{
		used[v] = 1;
		cur.insert(v);
		for(int i = 0;i<n;i++){
			if(!used[i] && p[v][i] == 1){
				col[i] = col[v];
				dfs(i);
				answer[v][i] = 1;
				answer[i][v] = 1;
			}
		}
	};
	for(int i = 0;i<n;i++){
		if(used[i])continue;
		int now = i;
		vector<int> tmp;
		int num = -1;
		set<int> s;
		for(int j = 0;j<n;j++){
			if(p[now][j] >= 2){
				if(num == -1)
					num = p[now][j];
				if(num != p[now][j])
					return 0;
				s.insert(j);
			}
		}
		while(s.size()){
			tmp.push_back(now);
			vector<int> del;
			for(auto u:s){
				if(p[now][u] != num){
					del.push_back(u);
				}
			}
			for(auto u:del)
				s.erase(u);
			if(s.empty())
				break;
			now = *s.begin();
		}
		if(tmp.empty())
			continue;
		if(tmp.size() < 3){
			return 0;
		}
		for(int j = 0;j<tmp.size();j++){
			answer[tmp[j]][tmp[(j + 1)%tmp.size()]] = 1;
			answer[tmp[(j + 1)%tmp.size()]][tmp[j]] = 1;
		}
		if(num == 3){
			if(tmp.size() < 4)
				return 0;
			answer[tmp[0]][tmp[2]] = 1;
			answer[tmp[2]][tmp[0]] = 1;
		}
		cur.clear();
		for(auto u:tmp){
			col[u] = u;
			dfs(u);
		}
		for(auto u:cur){
			for(int j = 0;j<n;j++){
				if(p[u][j] == 0 && cur.count(j)){
					return 0;
				}
				if(p[u][j] == 1 && (!cur.count(j) || col[j] != col[u]))
					return 0;
				if(p[u][j] > 1 && (p[u][j] != num || !cur.count(j)))
					return 0;
				if(p[u][j] > 1 && col[u] == col[j])
					return 0;
			}
		}
	}
	for(int i = 0;i<n;i++){
		if(!used[i]){
			cur.clear();
			col[i] = i;
			dfs(i);
			for(auto u:cur){
				for(int j = 0;j<n;j++){
					if(p[u][j] == 0 && cur.count(j)){
						return 0;
					}
					if(p[u][j] == 1 && (!cur.count(j) || col[j] != col[u]))
						return 0;
					if(p[u][j] > 1)
						return 0;
				}
			}
		}
	}
	build(answer);
	return 1;
}

Compilation message

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

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 8 ms 1252 KB Output is correct
7 Correct 192 ms 24064 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 8 ms 1252 KB Output is correct
7 Correct 192 ms 24064 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1264 KB Output is correct
13 Correct 173 ms 23936 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 5 ms 852 KB Output is correct
17 Correct 91 ms 14200 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 43 ms 6136 KB Output is correct
21 Correct 198 ms 23924 KB Output is correct
22 Correct 183 ms 23924 KB Output is correct
23 Correct 209 ms 24040 KB Output is correct
24 Correct 165 ms 23924 KB Output is correct
25 Correct 85 ms 14076 KB Output is correct
26 Correct 83 ms 14064 KB Output is correct
27 Correct 213 ms 23928 KB Output is correct
28 Correct 172 ms 23936 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 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 8 ms 1264 KB Output is correct
9 Correct 187 ms 23932 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 8 ms 1204 KB Output is correct
13 Correct 206 ms 24044 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 4 ms 852 KB Output is correct
17 Correct 88 ms 14068 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 300 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 52 ms 6260 KB Output is correct
22 Correct 197 ms 23912 KB Output is correct
23 Correct 178 ms 23960 KB Output is correct
24 Correct 199 ms 23936 KB Output is correct
25 Correct 87 ms 14068 KB Output is correct
26 Correct 83 ms 14064 KB Output is correct
27 Correct 172 ms 23928 KB Output is correct
28 Correct 187 ms 23924 KB Output is correct
29 Correct 78 ms 14068 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 0 ms 300 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 46 ms 6248 KB Output is correct
5 Correct 177 ms 23932 KB Output is correct
6 Correct 171 ms 23924 KB Output is correct
7 Correct 203 ms 23924 KB Output is correct
8 Correct 1 ms 248 KB Output is correct
9 Correct 45 ms 6220 KB Output is correct
10 Correct 177 ms 23956 KB Output is correct
11 Correct 169 ms 23992 KB Output is correct
12 Correct 203 ms 23920 KB Output is correct
13 Correct 1 ms 304 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 45 ms 6264 KB Output is correct
17 Correct 182 ms 24084 KB Output is correct
18 Correct 182 ms 23876 KB Output is correct
19 Correct 172 ms 23952 KB Output is correct
20 Correct 181 ms 23936 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 8 ms 1252 KB Output is correct
7 Correct 192 ms 24064 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1264 KB Output is correct
13 Correct 173 ms 23936 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 5 ms 852 KB Output is correct
17 Correct 91 ms 14200 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 43 ms 6136 KB Output is correct
21 Correct 198 ms 23924 KB Output is correct
22 Correct 183 ms 23924 KB Output is correct
23 Correct 209 ms 24040 KB Output is correct
24 Correct 165 ms 23924 KB Output is correct
25 Correct 85 ms 14076 KB Output is correct
26 Correct 83 ms 14064 KB Output is correct
27 Correct 213 ms 23928 KB Output is correct
28 Correct 172 ms 23936 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 8 ms 1264 KB Output is correct
37 Correct 187 ms 23932 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 8 ms 1204 KB Output is correct
41 Correct 206 ms 24044 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 4 ms 852 KB Output is correct
45 Correct 88 ms 14068 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 0 ms 300 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 52 ms 6260 KB Output is correct
50 Correct 197 ms 23912 KB Output is correct
51 Correct 178 ms 23960 KB Output is correct
52 Correct 199 ms 23936 KB Output is correct
53 Correct 87 ms 14068 KB Output is correct
54 Correct 83 ms 14064 KB Output is correct
55 Correct 172 ms 23928 KB Output is correct
56 Correct 187 ms 23924 KB Output is correct
57 Correct 78 ms 14068 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 4 ms 828 KB Output is correct
61 Correct 105 ms 14076 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 1 ms 212 KB Output is correct
64 Correct 0 ms 212 KB Output is correct
65 Correct 43 ms 6192 KB Output is correct
66 Correct 83 ms 14076 KB Output is correct
67 Correct 87 ms 14080 KB Output is correct
68 Correct 84 ms 14080 KB Output is correct
69 Correct 82 ms 13968 KB Output is correct

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 8 ms 1252 KB Output is correct
7 Correct 192 ms 24064 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1264 KB Output is correct
13 Correct 173 ms 23936 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 5 ms 852 KB Output is correct
17 Correct 91 ms 14200 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 43 ms 6136 KB Output is correct
21 Correct 198 ms 23924 KB Output is correct
22 Correct 183 ms 23924 KB Output is correct
23 Correct 209 ms 24040 KB Output is correct
24 Correct 165 ms 23924 KB Output is correct
25 Correct 85 ms 14076 KB Output is correct
26 Correct 83 ms 14064 KB Output is correct
27 Correct 213 ms 23928 KB Output is correct
28 Correct 172 ms 23936 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 8 ms 1264 KB Output is correct
37 Correct 187 ms 23932 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 8 ms 1204 KB Output is correct
41 Correct 206 ms 24044 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 4 ms 852 KB Output is correct
45 Correct 88 ms 14068 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 0 ms 300 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 52 ms 6260 KB Output is correct
50 Correct 197 ms 23912 KB Output is correct
51 Correct 178 ms 23960 KB Output is correct
52 Correct 199 ms 23936 KB Output is correct
53 Correct 87 ms 14068 KB Output is correct
54 Correct 83 ms 14064 KB Output is correct
55 Correct 172 ms 23928 KB Output is correct
56 Correct 187 ms 23924 KB Output is correct
57 Correct 78 ms 14068 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 0 ms 300 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 46 ms 6248 KB Output is correct
62 Correct 177 ms 23932 KB Output is correct
63 Correct 171 ms 23924 KB Output is correct
64 Correct 203 ms 23924 KB Output is correct
65 Correct 1 ms 248 KB Output is correct
66 Correct 45 ms 6220 KB Output is correct
67 Correct 177 ms 23956 KB Output is correct
68 Correct 169 ms 23992 KB Output is correct
69 Correct 203 ms 23920 KB Output is correct
70 Correct 1 ms 304 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 1 ms 212 KB Output is correct
73 Correct 45 ms 6264 KB Output is correct
74 Correct 182 ms 24084 KB Output is correct
75 Correct 182 ms 23876 KB Output is correct
76 Correct 172 ms 23952 KB Output is correct
77 Correct 181 ms 23936 KB Output is correct
78 Correct 1 ms 212 KB Output is correct
79 Correct 1 ms 212 KB Output is correct
80 Correct 4 ms 828 KB Output is correct
81 Correct 105 ms 14076 KB Output is correct
82 Correct 1 ms 212 KB Output is correct
83 Correct 1 ms 212 KB Output is correct
84 Correct 0 ms 212 KB Output is correct
85 Correct 43 ms 6192 KB Output is correct
86 Correct 83 ms 14076 KB Output is correct
87 Correct 87 ms 14080 KB Output is correct
88 Correct 84 ms 14080 KB Output is correct
89 Correct 82 ms 13968 KB Output is correct
90 Correct 1 ms 212 KB Output is correct
91 Correct 1 ms 212 KB Output is correct
92 Correct 4 ms 852 KB Output is correct
93 Correct 84 ms 14156 KB Output is correct
94 Correct 1 ms 212 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 21 ms 3712 KB Output is correct
98 Correct 84 ms 14076 KB Output is correct
99 Correct 88 ms 14080 KB Output is correct
100 Correct 95 ms 14072 KB Output is correct
101 Correct 90 ms 14076 KB Output is correct
102 Incorrect 229 ms 24048 KB Answer gives possible 1 while actual possible 0
103 Halted 0 ms 0 KB -