oj.uz

답안 #977813

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
977813 2024-05-08T11:20:30 Z SmuggingSpun 슈퍼트리 잇기 (IOI20_supertrees) C++14
21 / 100
 181 ms 23264 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];
				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 348 KB Output is correct
2 Correct 0 ms 436 KB Output is correct
3 Correct 0 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 1196 KB Output is correct
7 Correct 148 ms 19372 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 436 KB Output is correct
3 Correct 0 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 1196 KB Output is correct
7 Correct 148 ms 19372 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1244 KB Output is correct
13 Correct 156 ms 19412 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 5 ms 600 KB Output is correct
17 Correct 65 ms 9392 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 40 ms 5252 KB Output is correct
21 Correct 161 ms 19404 KB Output is correct
22 Correct 164 ms 19300 KB Output is correct
23 Correct 165 ms 19340 KB Output is correct
24 Correct 157 ms 19348 KB Output is correct
25 Correct 70 ms 9444 KB Output is correct
26 Correct 72 ms 9384 KB Output is correct
27 Correct 181 ms 19320 KB Output is correct
28 Correct 155 ms 19388 KB Output is correct

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 7 ms 1112 KB Output is correct
9 Correct 168 ms 19392 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1368 KB Output is correct
13 Correct 154 ms 23264 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 67 ms 13308 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Incorrect 0 ms 344 KB b[4][4] is not 0
21 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 5336 KB Output is correct
5 Correct 163 ms 19684 KB Output is correct
6 Correct 168 ms 19300 KB Output is correct
7 Correct 164 ms 19508 KB Output is correct
8 Incorrect 0 ms 348 KB b[4][4] is not 0
9 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 436 KB Output is correct
3 Correct 0 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 1196 KB Output is correct
7 Correct 148 ms 19372 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1244 KB Output is correct
13 Correct 156 ms 19412 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 5 ms 600 KB Output is correct
17 Correct 65 ms 9392 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 40 ms 5252 KB Output is correct
21 Correct 161 ms 19404 KB Output is correct
22 Correct 164 ms 19300 KB Output is correct
23 Correct 165 ms 19340 KB Output is correct
24 Correct 157 ms 19348 KB Output is correct
25 Correct 70 ms 9444 KB Output is correct
26 Correct 72 ms 9384 KB Output is correct
27 Correct 181 ms 19320 KB Output is correct
28 Correct 155 ms 19388 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 7 ms 1112 KB Output is correct
37 Correct 168 ms 19392 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 7 ms 1368 KB Output is correct
41 Correct 154 ms 23264 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 67 ms 13308 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Incorrect 0 ms 344 KB b[4][4] is not 0
49 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 436 KB Output is correct
3 Correct 0 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 1196 KB Output is correct
7 Correct 148 ms 19372 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1244 KB Output is correct
13 Correct 156 ms 19412 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 5 ms 600 KB Output is correct
17 Correct 65 ms 9392 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 40 ms 5252 KB Output is correct
21 Correct 161 ms 19404 KB Output is correct
22 Correct 164 ms 19300 KB Output is correct
23 Correct 165 ms 19340 KB Output is correct
24 Correct 157 ms 19348 KB Output is correct
25 Correct 70 ms 9444 KB Output is correct
26 Correct 72 ms 9384 KB Output is correct
27 Correct 181 ms 19320 KB Output is correct
28 Correct 155 ms 19388 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 7 ms 1112 KB Output is correct
37 Correct 168 ms 19392 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 7 ms 1368 KB Output is correct
41 Correct 154 ms 23264 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 67 ms 13308 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Incorrect 0 ms 344 KB b[4][4] is not 0
49 Halted 0 ms 0 KB -