oj.uz

답안 #977717

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
977717 2024-05-08T10:00:27 Z SmuggingSpun 슈퍼트리 잇기 (IOI20_supertrees) C++14
21 / 100
 182 ms 18260 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<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), all_2(n, true);
	vector<vector<int>>edge(n);
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			if(p[i][j] == 1){
				all_2[i] = false;
				break;
			}
		}
	}
	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] > 0)){
					return 0;
				}
			}
		}	
		if(!all_2[i]){
			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] > 0){
					merge(i, j);
					vis[j] = true;
				}
			}
		}
	}
	for(int i = 0; i < n; i++){
		if(all_2[i]){
			if(!vis[i]){
				for(int j = 0; j < n; j++){
					if(p[i][j] > 0){
						if(vis[j]){
							return 0;
						}
						vis[j] = true;
						merge(i, j);
					}
				}
			}
			else{
				for(int j = 0; j < n; j++){
					if(i != j && (find_set(i) == find_set(j)) != (p[i][j] > 0)){
						return 0;
					}
				}
			}
		}
		edge[find_set(i)].emplace_back(i);
	}
	vector<vector<int>>ans(n, vector<int>(n, 0));
	for(int i = 0; i < n; i++){
		vector<vector<int>>part(2);
		for(int& j : edge[i]){
			part[all_2[j]].emplace_back(j);
		}
		if(part[0].empty()){
			if(part[1].size() == 2){
				return 0;
			} 
			if(part[1].size() > 2){
				part[1].emplace_back(part[1][0]);
				for(int j = 1; j < part[1].size(); j++){
					ans[part[1][j]][part[1][j - 1]] = ans[part[1][j - 1]][part[1][j]] = 1;
				}
			}
		}
		else{
			for(int& index : part[0]){
				if(p[index] != p[part[0][0]]){
					return 0;
				}
			}
			for(int j = 1; j < part[0].size(); j++){
				ans[part[0][j]][part[0][j - 1]] = ans[part[0][j - 1]][part[0][j]] = 1;
			}
			if(part[1].size() == 1){
				return 0;
			}			
			part[1].emplace_back(part[0].back());
			for(int j = 1; j < part[1].size(); j++){
				ans[part[1][j]][part[1][j - 1]] = ans[part[1][j - 1]][part[1][j]] = 1;
			}
		}
	}
	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:194:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  194 |     for(int j = 1; j < part[1].size(); j++){
      |                    ~~^~~~~~~~~~~~~~~~
supertrees.cpp:205:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  205 |    for(int j = 1; j < part[0].size(); j++){
      |                   ~~^~~~~~~~~~~~~~~~
supertrees.cpp:212:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  212 |    for(int j = 1; j < part[1].size(); j++){
      |                   ~~^~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 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 8 ms 1112 KB Output is correct
7 Correct 146 ms 18040 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 348 KB Output is correct
3 Correct 1 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 8 ms 1112 KB Output is correct
7 Correct 146 ms 18040 KB Output is correct
8 Correct 0 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 384 KB Output is correct
12 Correct 8 ms 1116 KB Output is correct
13 Correct 182 ms 18200 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 4 ms 600 KB Output is correct
17 Correct 78 ms 8200 KB Output is correct
18 Correct 1 ms 544 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 42 ms 4732 KB Output is correct
21 Correct 177 ms 18108 KB Output is correct
22 Correct 176 ms 18204 KB Output is correct
23 Correct 182 ms 18080 KB Output is correct
24 Correct 158 ms 18084 KB Output is correct
25 Correct 82 ms 8272 KB Output is correct
26 Correct 91 ms 8196 KB Output is correct
27 Correct 178 ms 18184 KB Output is correct
28 Correct 154 ms 18260 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 Incorrect 1 ms 348 KB Answer gives possible 0 while actual possible 1
6 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 344 KB Answer gives possible 0 while actual possible 1
3 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 348 KB Output is correct
3 Correct 1 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 8 ms 1112 KB Output is correct
7 Correct 146 ms 18040 KB Output is correct
8 Correct 0 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 384 KB Output is correct
12 Correct 8 ms 1116 KB Output is correct
13 Correct 182 ms 18200 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 4 ms 600 KB Output is correct
17 Correct 78 ms 8200 KB Output is correct
18 Correct 1 ms 544 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 42 ms 4732 KB Output is correct
21 Correct 177 ms 18108 KB Output is correct
22 Correct 176 ms 18204 KB Output is correct
23 Correct 182 ms 18080 KB Output is correct
24 Correct 158 ms 18084 KB Output is correct
25 Correct 82 ms 8272 KB Output is correct
26 Correct 91 ms 8196 KB Output is correct
27 Correct 178 ms 18184 KB Output is correct
28 Correct 154 ms 18260 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 Incorrect 1 ms 348 KB Answer gives possible 0 while actual possible 1
34 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 348 KB Output is correct
3 Correct 1 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 8 ms 1112 KB Output is correct
7 Correct 146 ms 18040 KB Output is correct
8 Correct 0 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 384 KB Output is correct
12 Correct 8 ms 1116 KB Output is correct
13 Correct 182 ms 18200 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 4 ms 600 KB Output is correct
17 Correct 78 ms 8200 KB Output is correct
18 Correct 1 ms 544 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 42 ms 4732 KB Output is correct
21 Correct 177 ms 18108 KB Output is correct
22 Correct 176 ms 18204 KB Output is correct
23 Correct 182 ms 18080 KB Output is correct
24 Correct 158 ms 18084 KB Output is correct
25 Correct 82 ms 8272 KB Output is correct
26 Correct 91 ms 8196 KB Output is correct
27 Correct 178 ms 18184 KB Output is correct
28 Correct 154 ms 18260 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 Incorrect 1 ms 348 KB Answer gives possible 0 while actual possible 1
34 Halted 0 ms 0 KB -