oj.uz

답안 #302971

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
302971 2020-09-19T15:03:34 Z 8e7 슈퍼트리 잇기 (IOI20_supertrees) C++14
100 / 100
 257 ms 22392 KB 
//Challenge: Accepted
#include "supertrees.h"
#include <vector>
#include <iostream>
#include <set>
#define maxn 1005
using namespace std;
int par[maxn], link[maxn];
vector<int> group[maxn], lg[maxn];
int getpar(int a, int x[]) {
	return a == x[a] ? a : x[a] = getpar(x[a], x);
}
void combine(int a, int b, int x[]) {
	x[getpar(a, x)] = getpar(b, x);
}
int construct(vector<vector<int> > p) {
	int n = p.size();
	int type = 2;
	for (int i = 0;i < n;i++) par[i] = i, link[i] = i;
	for (int i = 0;i < n;i++) {
		for (int j = i + 1;j < n;j++) {
			if (p[i][j]) {
				if (p[i][j] == 1) type = 1;
				if (p[i][j] == 3) return 0;
				combine(i, j, par);
			}
		}
	}
	for (int i = 0;i < n;i++) {
		par[i] = getpar(i, par);
		group[par[i]].push_back(i);
	}
	vector<vector<int> > ans;
	for (int i = 0;i < n;i++) {
		vector<int> add(n, 0);
		ans.push_back(add);
	}
	for (int i = 0;i < n;i++) {
		int x = group[i].size();
		set<int> cycle;
		vector<int> cs;
		for (int j = 0;j < x;j++) {
			for (int k = j + 1;k < x;k++) {
				if (p[group[i][j]][group[i][k]] == 0) {
					return 0;
				}
				if (p[group[i][j]][group[i][k]] == 1) {
					combine(group[i][j], group[i][k], link);
				}
			}
			if (type == 2 && x > 1) {
				if (j) {
					ans[group[i][j - 1]][group[i][j]] = ans[group[i][j]][group[i][j - 1]] = 1;
				}
				ans[group[i][0]][group[i][x - 1]] = ans[group[i][x - 1]][group[i][0]] = 1;
				if (x == 2){
					return 0;
				}
			}
		}
		if (type != 2) {
			for (int j = 0;j < x;j++) {
				getpar(group[i][j], link);
				cycle.insert(link[group[i][j]]);
				lg[link[group[i][j]]].push_back(group[i][j]);
			}
			for (int j:cycle) {
				cs.push_back(j);
				for (int k = 0;k < lg[j].size();k++) {
					for (int l = k + 1;l < lg[j].size();l++) {
						if (p[lg[j][k]][lg[j][l]] != 1) {
							return 0;
						}
					}
				}
			}
			for (int j = 0;j < x;j++) {
				if (link[group[i][j]] != group[i][j]) {
					ans[group[i][j]][link[group[i][j]]] = ans[link[group[i][j]]][group[i][j]] = 1;
				}
			}
			if (cs.size() > 1) {
				if (cs.size() == 2){
					return 0;
				}
				for (int j = 0;j < cs.size();j++) {
					int pre = (j - 1 + cs.size()) % cs.size();
					ans[cs[j]][cs[pre]] = ans[cs[pre]][cs[j]] = 1;
				}
			}
		}
	}
	build(ans);
	return 1;
}
/*
6
1 2 2 2 0 0
2 1 2 2 0 0
2 2 1 1 0 0
2 2 1 1 0 0
0 0 0 0 1 1
0 0 0 0 1 1

6
1 2 2 1 2 1
2 1 2 2 1 2
2 2 1 2 2 1
1 2 2 1 2 2
2 1 2 2 1 2
1 2 1 2 2 1

4
1 2 2 0
2 1 2 0
2 2 1 0
0 0 0 1

4
1 1 2 2
1 1 2 2
2 2 1 2
2 2 2 1
 */

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:70:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |     for (int k = 0;k < lg[j].size();k++) {
      |                    ~~^~~~~~~~~~~~~~
supertrees.cpp:71:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |      for (int l = k + 1;l < lg[j].size();l++) {
      |                         ~~^~~~~~~~~~~~~~
supertrees.cpp:87:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   87 |     for (int j = 0;j < cs.size();j++) {
      |                    ~~^~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 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 11 ms 1280 KB Output is correct
7 Correct 257 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 1 ms 384 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 11 ms 1280 KB Output is correct
7 Correct 257 ms 22136 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 239 ms 22152 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 113 ms 12280 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 60 ms 5880 KB Output is correct
21 Correct 237 ms 22124 KB Output is correct
22 Correct 237 ms 22392 KB Output is correct
23 Correct 254 ms 22264 KB Output is correct
24 Correct 238 ms 22264 KB Output is correct
25 Correct 99 ms 12280 KB Output is correct
26 Correct 104 ms 12280 KB Output is correct
27 Correct 253 ms 22148 KB Output is correct
28 Correct 235 ms 22264 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 10 ms 1280 KB Output is correct
9 Correct 233 ms 22136 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 11 ms 1280 KB Output is correct
13 Correct 248 ms 22148 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 125 ms 12172 KB Output is correct
18 Correct 1 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 59 ms 5880 KB Output is correct
22 Correct 242 ms 22136 KB Output is correct
23 Correct 235 ms 22136 KB Output is correct
24 Correct 248 ms 22148 KB Output is correct
25 Correct 98 ms 12300 KB Output is correct
26 Correct 102 ms 12172 KB Output is correct
27 Correct 235 ms 22136 KB Output is correct
28 Correct 248 ms 22152 KB Output is correct
29 Correct 96 ms 12296 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 0 ms 384 KB Output is correct
4 Correct 59 ms 5880 KB Output is correct
5 Correct 242 ms 22344 KB Output is correct
6 Correct 241 ms 22264 KB Output is correct
7 Correct 253 ms 22136 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 59 ms 5880 KB Output is correct
10 Correct 243 ms 22136 KB Output is correct
11 Correct 235 ms 22136 KB Output is correct
12 Correct 253 ms 22136 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 60 ms 6008 KB Output is correct
17 Correct 242 ms 22140 KB Output is correct
18 Correct 244 ms 22264 KB Output is correct
19 Correct 237 ms 22136 KB Output is correct
20 Correct 236 ms 22264 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 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 11 ms 1280 KB Output is correct
7 Correct 257 ms 22136 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 239 ms 22152 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 113 ms 12280 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 60 ms 5880 KB Output is correct
21 Correct 237 ms 22124 KB Output is correct
22 Correct 237 ms 22392 KB Output is correct
23 Correct 254 ms 22264 KB Output is correct
24 Correct 238 ms 22264 KB Output is correct
25 Correct 99 ms 12280 KB Output is correct
26 Correct 104 ms 12280 KB Output is correct
27 Correct 253 ms 22148 KB Output is correct
28 Correct 235 ms 22264 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 233 ms 22136 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 11 ms 1280 KB Output is correct
41 Correct 248 ms 22148 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 5 ms 896 KB Output is correct
45 Correct 125 ms 12172 KB Output is correct
46 Correct 1 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 59 ms 5880 KB Output is correct
50 Correct 242 ms 22136 KB Output is correct
51 Correct 235 ms 22136 KB Output is correct
52 Correct 248 ms 22148 KB Output is correct
53 Correct 98 ms 12300 KB Output is correct
54 Correct 102 ms 12172 KB Output is correct
55 Correct 235 ms 22136 KB Output is correct
56 Correct 248 ms 22152 KB Output is correct
57 Correct 96 ms 12296 KB Output is correct
58 Correct 0 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 5 ms 896 KB Output is correct
61 Correct 122 ms 12328 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 0 ms 384 KB Output is correct
64 Correct 1 ms 384 KB Output is correct
65 Correct 59 ms 5884 KB Output is correct
66 Correct 103 ms 12280 KB Output is correct
67 Correct 111 ms 12284 KB Output is correct
68 Correct 97 ms 12408 KB Output is correct
69 Correct 97 ms 12408 KB Output is correct

Subtask #6
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 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 11 ms 1280 KB Output is correct
7 Correct 257 ms 22136 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 239 ms 22152 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 113 ms 12280 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 60 ms 5880 KB Output is correct
21 Correct 237 ms 22124 KB Output is correct
22 Correct 237 ms 22392 KB Output is correct
23 Correct 254 ms 22264 KB Output is correct
24 Correct 238 ms 22264 KB Output is correct
25 Correct 99 ms 12280 KB Output is correct
26 Correct 104 ms 12280 KB Output is correct
27 Correct 253 ms 22148 KB Output is correct
28 Correct 235 ms 22264 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 233 ms 22136 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 11 ms 1280 KB Output is correct
41 Correct 248 ms 22148 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 5 ms 896 KB Output is correct
45 Correct 125 ms 12172 KB Output is correct
46 Correct 1 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 59 ms 5880 KB Output is correct
50 Correct 242 ms 22136 KB Output is correct
51 Correct 235 ms 22136 KB Output is correct
52 Correct 248 ms 22148 KB Output is correct
53 Correct 98 ms 12300 KB Output is correct
54 Correct 102 ms 12172 KB Output is correct
55 Correct 235 ms 22136 KB Output is correct
56 Correct 248 ms 22152 KB Output is correct
57 Correct 96 ms 12296 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 0 ms 384 KB Output is correct
61 Correct 59 ms 5880 KB Output is correct
62 Correct 242 ms 22344 KB Output is correct
63 Correct 241 ms 22264 KB Output is correct
64 Correct 253 ms 22136 KB Output is correct
65 Correct 1 ms 384 KB Output is correct
66 Correct 59 ms 5880 KB Output is correct
67 Correct 243 ms 22136 KB Output is correct
68 Correct 235 ms 22136 KB Output is correct
69 Correct 253 ms 22136 KB Output is correct
70 Correct 0 ms 384 KB Output is correct
71 Correct 0 ms 384 KB Output is correct
72 Correct 1 ms 384 KB Output is correct
73 Correct 60 ms 6008 KB Output is correct
74 Correct 242 ms 22140 KB Output is correct
75 Correct 244 ms 22264 KB Output is correct
76 Correct 237 ms 22136 KB Output is correct
77 Correct 236 ms 22264 KB Output is correct
78 Correct 0 ms 384 KB Output is correct
79 Correct 1 ms 384 KB Output is correct
80 Correct 5 ms 896 KB Output is correct
81 Correct 122 ms 12328 KB Output is correct
82 Correct 1 ms 384 KB Output is correct
83 Correct 0 ms 384 KB Output is correct
84 Correct 1 ms 384 KB Output is correct
85 Correct 59 ms 5884 KB Output is correct
86 Correct 103 ms 12280 KB Output is correct
87 Correct 111 ms 12284 KB Output is correct
88 Correct 97 ms 12408 KB Output is correct
89 Correct 97 ms 12408 KB Output is correct
90 Correct 1 ms 384 KB Output is correct
91 Correct 1 ms 384 KB Output is correct
92 Correct 7 ms 640 KB Output is correct
93 Correct 104 ms 8196 KB Output is correct
94 Correct 1 ms 384 KB Output is correct
95 Correct 0 ms 384 KB Output is correct
96 Correct 1 ms 384 KB Output is correct
97 Correct 24 ms 2304 KB Output is correct
98 Correct 98 ms 8312 KB Output is correct
99 Correct 101 ms 8312 KB Output is correct
100 Correct 96 ms 8184 KB Output is correct
101 Correct 96 ms 8312 KB Output is correct
102 Correct 110 ms 8312 KB Output is correct
103 Correct 107 ms 8184 KB Output is correct
104 Correct 103 ms 8188 KB Output is correct
105 Correct 106 ms 8200 KB Output is correct