oj.uz

답안 #302700

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
302700 2020-09-19T04:22:55 Z JooDdae 슈퍼트리 잇기 (IOI20_supertrees) C++17
100 / 100
 272 ms 22396 KB 
#include<bits/stdc++.h>
#include "supertrees.h"
using namespace std;
using ll = long long;

// void build(vector<vector<int>> v){
// 	for(auto x : v){
// 		for(int y : x) printf("%d ",y);
// 		printf("\n");
// 	}
// }

int par[1000];
vector<int> v[1000];

int find(int a){
	if(a == par[a]) return a;
	return par[a] = find(par[a]);
}

void merge(int a, int b){
	a = find(a), b = find(b);
	par[a] = b;
}

int construct(vector<vector<int>> p){
	int n = p.size();
	vector<vector<int>> ans(n, vector<int>(n));

	for(int i=0;i<n;i++) for(int j=i+1;j<n;j++) if(p[i][j] == 3) return 0;

	for(int i=0;i<n;i++) par[i] = i;
	for(int i=0;i<n;i++) for(int j=i+1;j<n;j++) if(p[i][j] == 1) merge(i, j);
	for(int i=0;i<n;i++) for(int j=i+1;j<n;j++) if(p[i][j] != 1 && find(i) == find(j)) return 0;

	for(int i=0;i<n;i++) v[find(i)].push_back(i);
	for(int i=0;i<n;i++) if(v[i].size() > 1){
		for(int j=0;j<v[i].size()-1;j++){
			for(int k=0;k<n;k++){
				if(k != v[i][j] && k != v[i][j+1] && p[v[i][j]][k] != p[v[i][j+1]][k]) return 0;
			}
			ans[v[i][j]][v[i][j+1]] = ans[v[i][j+1]][v[i][j]] = 1;
		}
	}
	
	vector<int> v2;
	for(int i=0;i<n;i++) if(v[i].size()) v2.push_back(v[i][0]);

	for(int i=0;i<v2.size();i++) par[i] = i, v[i].clear();

	for(int i=0;i<v2.size();i++) for(int j=i+1;j<v2.size();j++) if(p[v2[i]][v2[j]] == 2) merge(i, j);

	for(int i=0;i<v2.size();i++) v[find(i)].push_back(v2[i]);

	for(int i=0;i<v2.size();i++) if(v[i].size() > 1){
		if(v[i].size() == 2) return 0;
		int sz = v[i].size();
		for(int j=0;j<v[i].size();j++){
			for(int k=0;k<v[i].size();k++){
				if(j != k && (j+1)%sz != k && (p[v[i][j]][v[i][k]] == 2) != (p[v[i][(j+1)%sz]][v[i][k]] == 2)) return 0;
			}
			ans[v[i][j]][v[i][(j+1)%sz]] = ans[v[i][(j+1)%sz]][v[i][j]] = 1;
		}
	}

	build(ans);
	return 1;
}


// int main(){
// 	int n; scanf("%d",&n);
// 	vector<vector<int>> v(n, vector<int>(n));
// 	for(int i=0;i<n;i++) for(int j=0;j<n;j++) scanf("%d",&v[i][j]);
// 	printf("%d\n",construct(v));
// }

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:38:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |   for(int j=0;j<v[i].size()-1;j++){
      |               ~^~~~~~~~~~~~~~
supertrees.cpp:49:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |  for(int i=0;i<v2.size();i++) par[i] = i, v[i].clear();
      |              ~^~~~~~~~~~
supertrees.cpp:51:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |  for(int i=0;i<v2.size();i++) for(int j=i+1;j<v2.size();j++) if(p[v2[i]][v2[j]] == 2) merge(i, j);
      |              ~^~~~~~~~~~
supertrees.cpp:51:46: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |  for(int i=0;i<v2.size();i++) for(int j=i+1;j<v2.size();j++) if(p[v2[i]][v2[j]] == 2) merge(i, j);
      |                                             ~^~~~~~~~~~
supertrees.cpp:53:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |  for(int i=0;i<v2.size();i++) v[find(i)].push_back(v2[i]);
      |              ~^~~~~~~~~~
supertrees.cpp:55:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |  for(int i=0;i<v2.size();i++) if(v[i].size() > 1){
      |              ~^~~~~~~~~~
supertrees.cpp:58:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |   for(int j=0;j<v[i].size();j++){
      |               ~^~~~~~~~~~~~
supertrees.cpp:59:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |    for(int k=0;k<v[i].size();k++){
      |                ~^~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 256 ms 22136 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 256 ms 22136 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 11 ms 1280 KB Output is correct
13 Correct 255 ms 22136 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 121 ms 12152 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 65 ms 5856 KB Output is correct
21 Correct 262 ms 22396 KB Output is correct
22 Correct 258 ms 22136 KB Output is correct
23 Correct 265 ms 22136 KB Output is correct
24 Correct 253 ms 22136 KB Output is correct
25 Correct 109 ms 12152 KB Output is correct
26 Correct 109 ms 12144 KB Output is correct
27 Correct 272 ms 22128 KB Output is correct
28 Correct 253 ms 22136 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 11 ms 1280 KB Output is correct
9 Correct 249 ms 22136 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 11 ms 1280 KB Output is correct
13 Correct 262 ms 22140 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 125 ms 12256 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 63 ms 5880 KB Output is correct
22 Correct 250 ms 22136 KB Output is correct
23 Correct 251 ms 22264 KB Output is correct
24 Correct 266 ms 22264 KB Output is correct
25 Correct 124 ms 12280 KB Output is correct
26 Correct 115 ms 12272 KB Output is correct
27 Correct 253 ms 22136 KB Output is correct
28 Correct 266 ms 22136 KB Output is correct
29 Correct 112 ms 12152 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 64 ms 5880 KB Output is correct
5 Correct 255 ms 22136 KB Output is correct
6 Correct 260 ms 22136 KB Output is correct
7 Correct 270 ms 22136 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 63 ms 5880 KB Output is correct
10 Correct 259 ms 22136 KB Output is correct
11 Correct 251 ms 22140 KB Output is correct
12 Correct 263 ms 22140 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 65 ms 5884 KB Output is correct
17 Correct 255 ms 22136 KB Output is correct
18 Correct 262 ms 22264 KB Output is correct
19 Correct 255 ms 22136 KB Output is correct
20 Correct 254 ms 22136 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 256 ms 22136 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 11 ms 1280 KB Output is correct
13 Correct 255 ms 22136 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 121 ms 12152 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 65 ms 5856 KB Output is correct
21 Correct 262 ms 22396 KB Output is correct
22 Correct 258 ms 22136 KB Output is correct
23 Correct 265 ms 22136 KB Output is correct
24 Correct 253 ms 22136 KB Output is correct
25 Correct 109 ms 12152 KB Output is correct
26 Correct 109 ms 12144 KB Output is correct
27 Correct 272 ms 22128 KB Output is correct
28 Correct 253 ms 22136 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 1 ms 512 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 11 ms 1280 KB Output is correct
37 Correct 249 ms 22136 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 11 ms 1280 KB Output is correct
41 Correct 262 ms 22140 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 0 ms 384 KB Output is correct
44 Correct 5 ms 768 KB Output is correct
45 Correct 125 ms 12256 KB Output is correct
46 Correct 0 ms 384 KB Output is correct
47 Correct 0 ms 384 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 63 ms 5880 KB Output is correct
50 Correct 250 ms 22136 KB Output is correct
51 Correct 251 ms 22264 KB Output is correct
52 Correct 266 ms 22264 KB Output is correct
53 Correct 124 ms 12280 KB Output is correct
54 Correct 115 ms 12272 KB Output is correct
55 Correct 253 ms 22136 KB Output is correct
56 Correct 266 ms 22136 KB Output is correct
57 Correct 112 ms 12152 KB Output is correct
58 Correct 0 ms 384 KB Output is correct
59 Correct 0 ms 384 KB Output is correct
60 Correct 6 ms 768 KB Output is correct
61 Correct 115 ms 12152 KB Output is correct
62 Correct 0 ms 384 KB Output is correct
63 Correct 1 ms 384 KB Output is correct
64 Correct 1 ms 384 KB Output is correct
65 Correct 62 ms 5884 KB Output is correct
66 Correct 110 ms 12280 KB Output is correct
67 Correct 109 ms 12152 KB Output is correct
68 Correct 116 ms 12152 KB Output is correct
69 Correct 111 ms 12280 KB Output is correct

Subtask #6
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 256 ms 22136 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 11 ms 1280 KB Output is correct
13 Correct 255 ms 22136 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 121 ms 12152 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 65 ms 5856 KB Output is correct
21 Correct 262 ms 22396 KB Output is correct
22 Correct 258 ms 22136 KB Output is correct
23 Correct 265 ms 22136 KB Output is correct
24 Correct 253 ms 22136 KB Output is correct
25 Correct 109 ms 12152 KB Output is correct
26 Correct 109 ms 12144 KB Output is correct
27 Correct 272 ms 22128 KB Output is correct
28 Correct 253 ms 22136 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 1 ms 512 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 11 ms 1280 KB Output is correct
37 Correct 249 ms 22136 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 11 ms 1280 KB Output is correct
41 Correct 262 ms 22140 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 0 ms 384 KB Output is correct
44 Correct 5 ms 768 KB Output is correct
45 Correct 125 ms 12256 KB Output is correct
46 Correct 0 ms 384 KB Output is correct
47 Correct 0 ms 384 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 63 ms 5880 KB Output is correct
50 Correct 250 ms 22136 KB Output is correct
51 Correct 251 ms 22264 KB Output is correct
52 Correct 266 ms 22264 KB Output is correct
53 Correct 124 ms 12280 KB Output is correct
54 Correct 115 ms 12272 KB Output is correct
55 Correct 253 ms 22136 KB Output is correct
56 Correct 266 ms 22136 KB Output is correct
57 Correct 112 ms 12152 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 1 ms 384 KB Output is correct
61 Correct 64 ms 5880 KB Output is correct
62 Correct 255 ms 22136 KB Output is correct
63 Correct 260 ms 22136 KB Output is correct
64 Correct 270 ms 22136 KB Output is correct
65 Correct 1 ms 384 KB Output is correct
66 Correct 63 ms 5880 KB Output is correct
67 Correct 259 ms 22136 KB Output is correct
68 Correct 251 ms 22140 KB Output is correct
69 Correct 263 ms 22140 KB Output is correct
70 Correct 0 ms 384 KB Output is correct
71 Correct 0 ms 384 KB Output is correct
72 Correct 0 ms 384 KB Output is correct
73 Correct 65 ms 5884 KB Output is correct
74 Correct 255 ms 22136 KB Output is correct
75 Correct 262 ms 22264 KB Output is correct
76 Correct 255 ms 22136 KB Output is correct
77 Correct 254 ms 22136 KB Output is correct
78 Correct 0 ms 384 KB Output is correct
79 Correct 0 ms 384 KB Output is correct
80 Correct 6 ms 768 KB Output is correct
81 Correct 115 ms 12152 KB Output is correct
82 Correct 0 ms 384 KB Output is correct
83 Correct 1 ms 384 KB Output is correct
84 Correct 1 ms 384 KB Output is correct
85 Correct 62 ms 5884 KB Output is correct
86 Correct 110 ms 12280 KB Output is correct
87 Correct 109 ms 12152 KB Output is correct
88 Correct 116 ms 12152 KB Output is correct
89 Correct 111 ms 12280 KB Output is correct
90 Correct 0 ms 384 KB Output is correct
91 Correct 1 ms 384 KB Output is correct
92 Correct 6 ms 768 KB Output is correct
93 Correct 112 ms 12144 KB Output is correct
94 Correct 0 ms 384 KB Output is correct
95 Correct 0 ms 384 KB Output is correct
96 Correct 0 ms 384 KB Output is correct
97 Correct 28 ms 3320 KB Output is correct
98 Correct 106 ms 12144 KB Output is correct
99 Correct 109 ms 12152 KB Output is correct
100 Correct 109 ms 12152 KB Output is correct
101 Correct 107 ms 12152 KB Output is correct
102 Correct 111 ms 12152 KB Output is correct
103 Correct 110 ms 12140 KB Output is correct
104 Correct 121 ms 12152 KB Output is correct
105 Correct 115 ms 12144 KB Output is correct