oj.uz

답안 #977801

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
977801 2024-05-08T11:15:06 Z SmuggingSpun 슈퍼트리 잇기 (IOI20_supertrees) C++14
100 / 100
 180 ms 24072 KB 
#include "supertrees.h"
#include<bits/stdc++.h>
using namespace std;
int construct(vector<vector<int>>p){
	int n = p.size();
	bool is_sub1 = true, is_sub2 = true, is_sub3 = true;
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			if(p[i][j] != 1){
				is_sub1 = false;
			}
			if(p[i][j] > 1){
				is_sub2 = false;
			}
			if(p[i][j] != 0 && p[i][j] != 2){
				is_sub3 = false;
			}
		}
	}
	if(is_sub1){
		p = vector<vector<int>>(n, vector<int>(n, 0));
		for(int i = 1; i < n; i++){
			p[i][i - 1] = p[i - 1][i] = 1;
		}
		build(p);
		return 1;
	}
	if(is_sub2){
		vector<int>par(n);
		iota(par.begin(), par.end(), 0);
		function<int(int)>find_set;
		find_set = [&] (int n){
			return n == par[n] ? n : par[n] = find_set(par[n]);	
		};
		function<void(int, int)>merge = [&] (int a, int b){
			par[find_set(a)] = find_set(b);
		};
		vector<bool>vis(n, false);
		vector<vector<int>>edge(n);
		for(int i = 0; i < n; i++){
			if(vis[i]){
				for(int j = 0; j < n; j++){
					if(i != j && int(find_set(i) == find_set(j)) != p[i][j]){
						return 0;
					}
				}
				continue;
			}
			for(int j = 0; j < n; j++){
				if(i != j && p[i][j] == 0 && find_set(i) == find_set(j)){
					return 0;
				}
				if(p[i][j] == 1){
					merge(i, j);
					vis[j] = true;
				}
			}
		}
		for(int i = 0; i < n; i++){
			edge[find_set(i)].emplace_back(i);
		}
		p = vector<vector<int>>(n, vector<int>(n, 0));
		for(int i = 0; i < n; i++){
			for(int j = 1; j < edge[i].size(); j++){
				p[edge[i][j]][edge[i][j - 1]] = p[edge[i][j - 1]][edge[i][j]] = 1;
			}
		}
		build(p);
		return 1;
	}
	if(is_sub3){
		vector<int>par(n);
		iota(par.begin(), par.end(), 0);
		function<int(int)>find_set;
		find_set = [&] (int n){
			return n == par[n] ? n : par[n] = find_set(par[n]);	
		};
		function<void(int, int)>merge = [&] (int a, int b){
			par[find_set(a)] = find_set(b);
		};
		vector<bool>vis(n, false);
		vector<vector<int>>edge(n);
		for(int i = 0; i < n; i++){
			if(vis[i]){
				for(int j = 0; j < n; j++){
					if(i != j && (find_set(i) == find_set(j)) != (p[i][j] == 2)){
						return 0;
					}
				}
				continue;
			}
			for(int j = 0; j < n; j++){
				if(i != j && p[i][j] == 0 && find_set(i) == find_set(j)){
					return 0;
				}
				if(p[i][j] == 2){
					merge(i, j);
					vis[j] = true;
				}
			}
		}
		for(int i = 0; i < n; i++){
			edge[find_set(i)].emplace_back(i);
		}
		p = vector<vector<int>>(n, vector<int>(n, 0));
		for(int i = 0; i < n; i++){
			if(edge[i].size() == 2){
				return 0;
			}
			if(edge[i].size() > 2){
				edge[i].emplace_back(edge[i][0]);
				for(int j = 1; j < edge[i].size(); j++){
					p[edge[i][j]][edge[i][j - 1]] = p[edge[i][j - 1]][edge[i][j]] = 1;
				}
			}
		}
		build(p);
		return 1;
	}
	vector<bool>vis(n, false);
	vector<vector<int>>ans(n, vector<int>(n, 0));
	for(int i = 0; i < n; i++){
		if(!vis[i]){
			vector<int>vertex;
			for(int j = i; j < n; j++){
				if(p[i][j] > 0){
					vertex.emplace_back(j);
					vis[j] = true;
				}
			}
			vector<vector<int>>part;
			for(int& u : vertex){
				for(int& v : vertex){
					if(p[u][v] == 0){
						return 0;
					}
				}
				if(vis[u]){
					part.emplace_back(vector<int>());
					for(int& v : vertex){
						if(vis[v] && p[u][v] == 1){
							part.back().emplace_back(v);
							vis[v] = false;
						}
					}
				}
			}
			if(part.size() == 2){
				return 0;
			}
			for(auto& x : part){
				for(auto& y : part){
					for(int& i : x){
						for(int& j : y){
							if((x[0] != y[0]) != (p[i][j] == 2)){
								return 0;
							}
						}
					}
				}
				for(int i = 1; i < x.size(); i++){
					ans[x[i]][x[i - 1]] = ans[x[i - 1]][x[i]] = 1;
				}
			}
			for(int i = 0; i < part.size(); i++){
				int u = part[i][0], v = part[(i + 1) % part.size()][0];
				if(u != v){
					ans[u][v] = ans[v][u] = 1;
				}
			}
			for(int& i : vertex){
				for(int j = 0; j < n; j++){
					if(vis[j] && p[i][j] > 0){
						return 0;
					}
				}
			}
			for(int& i : vertex){
				vis[i] = true;
			}
		}
	}
	build(ans);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:64:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |    for(int j = 1; j < edge[i].size(); j++){
      |                   ~~^~~~~~~~~~~~~~~~
supertrees.cpp:112:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  112 |     for(int j = 1; j < edge[i].size(); j++){
      |                    ~~^~~~~~~~~~~~~~~~
supertrees.cpp:161:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  161 |     for(int i = 1; i < x.size(); i++){
      |                    ~~^~~~~~~~~~
supertrees.cpp:165:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  165 |    for(int i = 0; i < part.size(); i++){
      |                   ~~^~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1136 KB Output is correct
7 Correct 147 ms 18056 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1136 KB Output is correct
7 Correct 147 ms 18056 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 756 KB Output is correct
12 Correct 7 ms 1112 KB Output is correct
13 Correct 153 ms 18180 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 5 ms 604 KB Output is correct
17 Correct 67 ms 8216 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 40 ms 4812 KB Output is correct
21 Correct 169 ms 18064 KB Output is correct
22 Correct 156 ms 18260 KB Output is correct
23 Correct 162 ms 18260 KB Output is correct
24 Correct 180 ms 18256 KB Output is correct
25 Correct 69 ms 8272 KB Output is correct
26 Correct 69 ms 8336 KB Output is correct
27 Correct 164 ms 18084 KB Output is correct
28 Correct 159 ms 18180 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 10 ms 1152 KB Output is correct
9 Correct 159 ms 18184 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 152 ms 22092 KB Output is correct
14 Correct 0 ms 548 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 856 KB Output is correct
17 Correct 66 ms 12036 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 42 ms 5904 KB Output is correct
22 Correct 150 ms 22024 KB Output is correct
23 Correct 149 ms 22044 KB Output is correct
24 Correct 158 ms 22024 KB Output is correct
25 Correct 59 ms 12056 KB Output is correct
26 Correct 65 ms 12040 KB Output is correct
27 Correct 153 ms 22024 KB Output is correct
28 Correct 156 ms 21996 KB Output is correct
29 Correct 61 ms 12040 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 496 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 40 ms 4680 KB Output is correct
5 Correct 159 ms 18448 KB Output is correct
6 Correct 169 ms 18260 KB Output is correct
7 Correct 164 ms 18196 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 38 ms 5704 KB Output is correct
10 Correct 172 ms 22164 KB Output is correct
11 Correct 149 ms 22040 KB Output is correct
12 Correct 161 ms 22040 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 38 ms 6228 KB Output is correct
17 Correct 151 ms 23916 KB Output is correct
18 Correct 165 ms 24004 KB Output is correct
19 Correct 149 ms 24072 KB Output is correct
20 Correct 153 ms 23948 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1136 KB Output is correct
7 Correct 147 ms 18056 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 756 KB Output is correct
12 Correct 7 ms 1112 KB Output is correct
13 Correct 153 ms 18180 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 5 ms 604 KB Output is correct
17 Correct 67 ms 8216 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 40 ms 4812 KB Output is correct
21 Correct 169 ms 18064 KB Output is correct
22 Correct 156 ms 18260 KB Output is correct
23 Correct 162 ms 18260 KB Output is correct
24 Correct 180 ms 18256 KB Output is correct
25 Correct 69 ms 8272 KB Output is correct
26 Correct 69 ms 8336 KB Output is correct
27 Correct 164 ms 18084 KB Output is correct
28 Correct 159 ms 18180 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 10 ms 1152 KB Output is correct
37 Correct 159 ms 18184 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 7 ms 1116 KB Output is correct
41 Correct 152 ms 22092 KB Output is correct
42 Correct 0 ms 548 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 3 ms 856 KB Output is correct
45 Correct 66 ms 12036 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 42 ms 5904 KB Output is correct
50 Correct 150 ms 22024 KB Output is correct
51 Correct 149 ms 22044 KB Output is correct
52 Correct 158 ms 22024 KB Output is correct
53 Correct 59 ms 12056 KB Output is correct
54 Correct 65 ms 12040 KB Output is correct
55 Correct 153 ms 22024 KB Output is correct
56 Correct 156 ms 21996 KB Output is correct
57 Correct 61 ms 12040 KB Output is correct
58 Correct 0 ms 344 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 3 ms 860 KB Output is correct
61 Correct 74 ms 12056 KB Output is correct
62 Correct 1 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 38 ms 6348 KB Output is correct
66 Correct 61 ms 14084 KB Output is correct
67 Correct 65 ms 14220 KB Output is correct
68 Correct 73 ms 14192 KB Output is correct
69 Correct 75 ms 14072 KB Output is correct

Subtask #6
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1136 KB Output is correct
7 Correct 147 ms 18056 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 756 KB Output is correct
12 Correct 7 ms 1112 KB Output is correct
13 Correct 153 ms 18180 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 5 ms 604 KB Output is correct
17 Correct 67 ms 8216 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 40 ms 4812 KB Output is correct
21 Correct 169 ms 18064 KB Output is correct
22 Correct 156 ms 18260 KB Output is correct
23 Correct 162 ms 18260 KB Output is correct
24 Correct 180 ms 18256 KB Output is correct
25 Correct 69 ms 8272 KB Output is correct
26 Correct 69 ms 8336 KB Output is correct
27 Correct 164 ms 18084 KB Output is correct
28 Correct 159 ms 18180 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 10 ms 1152 KB Output is correct
37 Correct 159 ms 18184 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 7 ms 1116 KB Output is correct
41 Correct 152 ms 22092 KB Output is correct
42 Correct 0 ms 548 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 3 ms 856 KB Output is correct
45 Correct 66 ms 12036 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 42 ms 5904 KB Output is correct
50 Correct 150 ms 22024 KB Output is correct
51 Correct 149 ms 22044 KB Output is correct
52 Correct 158 ms 22024 KB Output is correct
53 Correct 59 ms 12056 KB Output is correct
54 Correct 65 ms 12040 KB Output is correct
55 Correct 153 ms 22024 KB Output is correct
56 Correct 156 ms 21996 KB Output is correct
57 Correct 61 ms 12040 KB Output is correct
58 Correct 0 ms 496 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 40 ms 4680 KB Output is correct
62 Correct 159 ms 18448 KB Output is correct
63 Correct 169 ms 18260 KB Output is correct
64 Correct 164 ms 18196 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 38 ms 5704 KB Output is correct
67 Correct 172 ms 22164 KB Output is correct
68 Correct 149 ms 22040 KB Output is correct
69 Correct 161 ms 22040 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 38 ms 6228 KB Output is correct
74 Correct 151 ms 23916 KB Output is correct
75 Correct 165 ms 24004 KB Output is correct
76 Correct 149 ms 24072 KB Output is correct
77 Correct 153 ms 23948 KB Output is correct
78 Correct 0 ms 344 KB Output is correct
79 Correct 0 ms 348 KB Output is correct
80 Correct 3 ms 860 KB Output is correct
81 Correct 74 ms 12056 KB Output is correct
82 Correct 1 ms 348 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 38 ms 6348 KB Output is correct
86 Correct 61 ms 14084 KB Output is correct
87 Correct 65 ms 14220 KB Output is correct
88 Correct 73 ms 14192 KB Output is correct
89 Correct 75 ms 14072 KB Output is correct
90 Correct 0 ms 348 KB Output is correct
91 Correct 0 ms 348 KB Output is correct
92 Correct 3 ms 936 KB Output is correct
93 Correct 67 ms 14076 KB Output is correct
94 Correct 0 ms 352 KB Output is correct
95 Correct 0 ms 348 KB Output is correct
96 Correct 0 ms 348 KB Output is correct
97 Correct 16 ms 3704 KB Output is correct
98 Correct 62 ms 14164 KB Output is correct
99 Correct 64 ms 14072 KB Output is correct
100 Correct 62 ms 14072 KB Output is correct
101 Correct 59 ms 14216 KB Output is correct
102 Correct 60 ms 14160 KB Output is correct
103 Correct 60 ms 14160 KB Output is correct
104 Correct 81 ms 14196 KB Output is correct
105 Correct 66 ms 14168 KB Output is correct