oj.uz

Submission #302963

# Submission time Handle Problem Language Result Execution time Memory
302963 2020-09-19T14:51:05 Z 8e7 Connecting Supertrees (IOI20_supertrees) C++14
75 / 100
 286 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];
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;
				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]]);
			}
			for (int j:cycle) cs.push_back(j);
			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) {
				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 2
2 1 2 2 1 2
2 2 1 2 2 1
1 2 2 1 2 2
2 1 2 2 1 2
2 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:73:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |     for (int j = 0;j < cs.size();j++) {
      |                    ~~^~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 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 255 ms 22136 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 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 255 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 10 ms 1280 KB Output is correct
13 Correct 228 ms 22136 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 896 KB Output is correct
17 Correct 111 ms 12152 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 58 ms 5880 KB Output is correct
21 Correct 248 ms 22136 KB Output is correct
22 Correct 228 ms 22136 KB Output is correct
23 Correct 259 ms 22136 KB Output is correct
24 Correct 257 ms 22136 KB Output is correct
25 Correct 99 ms 12152 KB Output is correct
26 Correct 101 ms 12152 KB Output is correct
27 Correct 268 ms 22136 KB Output is correct
28 Correct 233 ms 22136 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 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 1 ms 384 KB Output is correct
8 Correct 10 ms 1280 KB Output is correct
9 Correct 252 ms 22128 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 267 ms 22120 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 8 ms 856 KB Output is correct
17 Correct 112 ms 12148 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 58 ms 5824 KB Output is correct
22 Correct 251 ms 22264 KB Output is correct
23 Correct 229 ms 22136 KB Output is correct
24 Correct 286 ms 22264 KB Output is correct
25 Correct 118 ms 12284 KB Output is correct
26 Correct 99 ms 12256 KB Output is correct
27 Correct 231 ms 22136 KB Output is correct
28 Correct 259 ms 22136 KB Output is correct
29 Correct 100 ms 12280 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 304 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 63 ms 5880 KB Output is correct
5 Correct 234 ms 22136 KB Output is correct
6 Correct 242 ms 22100 KB Output is correct
7 Correct 267 ms 22136 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 58 ms 5864 KB Output is correct
10 Correct 235 ms 22156 KB Output is correct
11 Correct 237 ms 22136 KB Output is correct
12 Correct 256 ms 22392 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 59 ms 5916 KB Output is correct
17 Correct 238 ms 22264 KB Output is correct
18 Correct 248 ms 22304 KB Output is correct
19 Correct 231 ms 22136 KB Output is correct
20 Correct 238 ms 22136 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 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 255 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 10 ms 1280 KB Output is correct
13 Correct 228 ms 22136 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 896 KB Output is correct
17 Correct 111 ms 12152 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 58 ms 5880 KB Output is correct
21 Correct 248 ms 22136 KB Output is correct
22 Correct 228 ms 22136 KB Output is correct
23 Correct 259 ms 22136 KB Output is correct
24 Correct 257 ms 22136 KB Output is correct
25 Correct 99 ms 12152 KB Output is correct
26 Correct 101 ms 12152 KB Output is correct
27 Correct 268 ms 22136 KB Output is correct
28 Correct 233 ms 22136 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 0 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 1 ms 384 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 252 ms 22128 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 267 ms 22120 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 0 ms 384 KB Output is correct
44 Correct 8 ms 856 KB Output is correct
45 Correct 112 ms 12148 KB Output is correct
46 Correct 0 ms 384 KB Output is correct
47 Correct 0 ms 384 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 58 ms 5824 KB Output is correct
50 Correct 251 ms 22264 KB Output is correct
51 Correct 229 ms 22136 KB Output is correct
52 Correct 286 ms 22264 KB Output is correct
53 Correct 118 ms 12284 KB Output is correct
54 Correct 99 ms 12256 KB Output is correct
55 Correct 231 ms 22136 KB Output is correct
56 Correct 259 ms 22136 KB Output is correct
57 Correct 100 ms 12280 KB Output is correct
58 Correct 1 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 119 ms 12152 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 5880 KB Output is correct
66 Correct 98 ms 12152 KB Output is correct
67 Correct 104 ms 12200 KB Output is correct
68 Correct 95 ms 12156 KB Output is correct
69 Incorrect 232 ms 22264 KB Answer gives possible 1 while actual possible 0

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 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 255 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 10 ms 1280 KB Output is correct
13 Correct 228 ms 22136 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 896 KB Output is correct
17 Correct 111 ms 12152 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 58 ms 5880 KB Output is correct
21 Correct 248 ms 22136 KB Output is correct
22 Correct 228 ms 22136 KB Output is correct
23 Correct 259 ms 22136 KB Output is correct
24 Correct 257 ms 22136 KB Output is correct
25 Correct 99 ms 12152 KB Output is correct
26 Correct 101 ms 12152 KB Output is correct
27 Correct 268 ms 22136 KB Output is correct
28 Correct 233 ms 22136 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 0 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 1 ms 384 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 252 ms 22128 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 267 ms 22120 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 0 ms 384 KB Output is correct
44 Correct 8 ms 856 KB Output is correct
45 Correct 112 ms 12148 KB Output is correct
46 Correct 0 ms 384 KB Output is correct
47 Correct 0 ms 384 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 58 ms 5824 KB Output is correct
50 Correct 251 ms 22264 KB Output is correct
51 Correct 229 ms 22136 KB Output is correct
52 Correct 286 ms 22264 KB Output is correct
53 Correct 118 ms 12284 KB Output is correct
54 Correct 99 ms 12256 KB Output is correct
55 Correct 231 ms 22136 KB Output is correct
56 Correct 259 ms 22136 KB Output is correct
57 Correct 100 ms 12280 KB Output is correct
58 Correct 0 ms 304 KB Output is correct
59 Correct 0 ms 384 KB Output is correct
60 Correct 1 ms 384 KB Output is correct
61 Correct 63 ms 5880 KB Output is correct
62 Correct 234 ms 22136 KB Output is correct
63 Correct 242 ms 22100 KB Output is correct
64 Correct 267 ms 22136 KB Output is correct
65 Correct 1 ms 384 KB Output is correct
66 Correct 58 ms 5864 KB Output is correct
67 Correct 235 ms 22156 KB Output is correct
68 Correct 237 ms 22136 KB Output is correct
69 Correct 256 ms 22392 KB Output is correct
70 Correct 1 ms 384 KB Output is correct
71 Correct 1 ms 384 KB Output is correct
72 Correct 1 ms 384 KB Output is correct
73 Correct 59 ms 5916 KB Output is correct
74 Correct 238 ms 22264 KB Output is correct
75 Correct 248 ms 22304 KB Output is correct
76 Correct 231 ms 22136 KB Output is correct
77 Correct 238 ms 22136 KB Output is correct
78 Correct 1 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 119 ms 12152 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 5880 KB Output is correct
86 Correct 98 ms 12152 KB Output is correct
87 Correct 104 ms 12200 KB Output is correct
88 Correct 95 ms 12156 KB Output is correct
89 Incorrect 232 ms 22264 KB Answer gives possible 1 while actual possible 0