oj.uz

Submission #827025

# Submission time Handle Problem Language Result Execution time Memory
827025 2023-08-16T08:07:59 Z tomruk Connecting Supertrees (IOI20_supertrees) C++17
96 / 100
 185 ms 24056 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);
			used[now] = 1;
			vector<int> del;
			for(auto u:s){
				if(p[now][u] < 2){
					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 i = 0;i<tmp.size();i++){
			answer[tmp[i]][tmp[(i + 1)%tmp.size()]] = 1;
			answer[tmp[(i + 1)%tmp.size()]][tmp[i]] = 1;
		}
		if(num == 3){
			if(tmp.size() < 4)
				return 0;
			answer[tmp[i]][tmp[(i + 2)%tmp.size()]] = 1;
			answer[tmp[(i + 2)%tmp.size()]][tmp[i]] = 1;
		}
		cur.clear();
		for(auto u:tmp){
			cur.insert(u);
			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++){
		// cout << used[i] << endl;
		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:57:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |   for(int i = 0;i<tmp.size();i++){
      |                 ~^~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 296 KB Output is correct
3 Correct 0 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 7 ms 1240 KB Output is correct
7 Correct 181 ms 24052 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 296 KB Output is correct
3 Correct 0 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 7 ms 1240 KB Output is correct
7 Correct 181 ms 24052 KB Output is correct
8 Correct 0 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 0 ms 212 KB Output is correct
12 Correct 7 ms 1180 KB Output is correct
13 Correct 153 ms 23932 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 66 ms 14156 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 43 ms 6188 KB Output is correct
21 Correct 168 ms 23932 KB Output is correct
22 Correct 158 ms 23932 KB Output is correct
23 Correct 181 ms 24032 KB Output is correct
24 Correct 153 ms 23940 KB Output is correct
25 Correct 68 ms 14100 KB Output is correct
26 Correct 60 ms 14064 KB Output is correct
27 Correct 182 ms 24048 KB Output is correct
28 Correct 181 ms 23920 KB Output is correct

Subtask #3
19.0 / 19.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 0 ms 212 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 300 KB Output is correct
8 Correct 8 ms 1244 KB Output is correct
9 Correct 155 ms 23932 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 7 ms 1212 KB Output is correct
13 Correct 185 ms 23928 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 300 KB Output is correct
16 Correct 3 ms 852 KB Output is correct
17 Correct 64 ms 14080 KB Output is correct
18 Correct 1 ms 296 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 39 ms 6220 KB Output is correct
22 Correct 161 ms 24056 KB Output is correct
23 Correct 160 ms 23936 KB Output is correct
24 Correct 169 ms 23992 KB Output is correct
25 Correct 62 ms 13996 KB Output is correct
26 Correct 79 ms 14064 KB Output is correct
27 Correct 158 ms 23956 KB Output is correct
28 Correct 171 ms 23964 KB Output is correct
29 Correct 59 ms 14076 KB Output is correct

Subtask #4
35.0 / 35.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 40 ms 6152 KB Output is correct
5 Correct 161 ms 23956 KB Output is correct
6 Correct 162 ms 23920 KB Output is correct
7 Correct 182 ms 23936 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 39 ms 6256 KB Output is correct
10 Correct 164 ms 23892 KB Output is correct
11 Correct 153 ms 23912 KB Output is correct
12 Correct 169 ms 23928 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 39 ms 6260 KB Output is correct
17 Correct 164 ms 23980 KB Output is correct
18 Correct 160 ms 23564 KB Output is correct
19 Correct 156 ms 23528 KB Output is correct
20 Correct 155 ms 23372 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 296 KB Output is correct
3 Correct 0 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 7 ms 1240 KB Output is correct
7 Correct 181 ms 24052 KB Output is correct
8 Correct 0 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 0 ms 212 KB Output is correct
12 Correct 7 ms 1180 KB Output is correct
13 Correct 153 ms 23932 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 66 ms 14156 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 43 ms 6188 KB Output is correct
21 Correct 168 ms 23932 KB Output is correct
22 Correct 158 ms 23932 KB Output is correct
23 Correct 181 ms 24032 KB Output is correct
24 Correct 153 ms 23940 KB Output is correct
25 Correct 68 ms 14100 KB Output is correct
26 Correct 60 ms 14064 KB Output is correct
27 Correct 182 ms 24048 KB Output is correct
28 Correct 181 ms 23920 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 304 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 0 ms 300 KB Output is correct
36 Correct 8 ms 1244 KB Output is correct
37 Correct 155 ms 23932 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 7 ms 1212 KB Output is correct
41 Correct 185 ms 23928 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 300 KB Output is correct
44 Correct 3 ms 852 KB Output is correct
45 Correct 64 ms 14080 KB Output is correct
46 Correct 1 ms 296 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 39 ms 6220 KB Output is correct
50 Correct 161 ms 24056 KB Output is correct
51 Correct 160 ms 23936 KB Output is correct
52 Correct 169 ms 23992 KB Output is correct
53 Correct 62 ms 13996 KB Output is correct
54 Correct 79 ms 14064 KB Output is correct
55 Correct 158 ms 23956 KB Output is correct
56 Correct 171 ms 23964 KB Output is correct
57 Correct 59 ms 14076 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 3 ms 852 KB Output is correct
61 Correct 65 ms 14196 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 0 ms 212 KB Output is correct
64 Correct 0 ms 304 KB Output is correct
65 Correct 39 ms 6252 KB Output is correct
66 Correct 61 ms 14028 KB Output is correct
67 Correct 64 ms 14080 KB Output is correct
68 Correct 59 ms 14080 KB Output is correct
69 Correct 59 ms 14068 KB Output is correct

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 296 KB Output is correct
3 Correct 0 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 7 ms 1240 KB Output is correct
7 Correct 181 ms 24052 KB Output is correct
8 Correct 0 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 0 ms 212 KB Output is correct
12 Correct 7 ms 1180 KB Output is correct
13 Correct 153 ms 23932 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 66 ms 14156 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 43 ms 6188 KB Output is correct
21 Correct 168 ms 23932 KB Output is correct
22 Correct 158 ms 23932 KB Output is correct
23 Correct 181 ms 24032 KB Output is correct
24 Correct 153 ms 23940 KB Output is correct
25 Correct 68 ms 14100 KB Output is correct
26 Correct 60 ms 14064 KB Output is correct
27 Correct 182 ms 24048 KB Output is correct
28 Correct 181 ms 23920 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 304 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 0 ms 300 KB Output is correct
36 Correct 8 ms 1244 KB Output is correct
37 Correct 155 ms 23932 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 7 ms 1212 KB Output is correct
41 Correct 185 ms 23928 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 300 KB Output is correct
44 Correct 3 ms 852 KB Output is correct
45 Correct 64 ms 14080 KB Output is correct
46 Correct 1 ms 296 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 39 ms 6220 KB Output is correct
50 Correct 161 ms 24056 KB Output is correct
51 Correct 160 ms 23936 KB Output is correct
52 Correct 169 ms 23992 KB Output is correct
53 Correct 62 ms 13996 KB Output is correct
54 Correct 79 ms 14064 KB Output is correct
55 Correct 158 ms 23956 KB Output is correct
56 Correct 171 ms 23964 KB Output is correct
57 Correct 59 ms 14076 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 40 ms 6152 KB Output is correct
62 Correct 161 ms 23956 KB Output is correct
63 Correct 162 ms 23920 KB Output is correct
64 Correct 182 ms 23936 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 39 ms 6256 KB Output is correct
67 Correct 164 ms 23892 KB Output is correct
68 Correct 153 ms 23912 KB Output is correct
69 Correct 169 ms 23928 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 0 ms 212 KB Output is correct
73 Correct 39 ms 6260 KB Output is correct
74 Correct 164 ms 23980 KB Output is correct
75 Correct 160 ms 23564 KB Output is correct
76 Correct 156 ms 23528 KB Output is correct
77 Correct 155 ms 23372 KB Output is correct
78 Correct 0 ms 212 KB Output is correct
79 Correct 0 ms 212 KB Output is correct
80 Correct 3 ms 852 KB Output is correct
81 Correct 65 ms 14196 KB Output is correct
82 Correct 0 ms 212 KB Output is correct
83 Correct 0 ms 212 KB Output is correct
84 Correct 0 ms 304 KB Output is correct
85 Correct 39 ms 6252 KB Output is correct
86 Correct 61 ms 14028 KB Output is correct
87 Correct 64 ms 14080 KB Output is correct
88 Correct 59 ms 14080 KB Output is correct
89 Correct 59 ms 14068 KB Output is correct
90 Correct 0 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 61 ms 13988 KB Output is correct
94 Correct 0 ms 212 KB Output is correct
95 Correct 1 ms 276 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 15 ms 3704 KB Output is correct
98 Correct 61 ms 14028 KB Output is correct
99 Correct 69 ms 14104 KB Output is correct
100 Correct 64 ms 14072 KB Output is correct
101 Correct 65 ms 14064 KB Output is correct
102 Incorrect 184 ms 23936 KB Answer gives possible 1 while actual possible 0
103 Halted 0 ms 0 KB -