oj.uz

답안 #300296

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
300296 2020-09-17T04:42:00 Z jtnydv25 슈퍼트리 잇기 (IOI20_supertrees) C++17
100 / 100
 303 ms 24952 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

#define all(c) ((c).begin()), ((c).end())

struct dsu{
	vector<vector<int>> components;
	int n;
	vector<int> par;
	dsu(int n) : n(n), par(n){
		iota(all(par), 0);
		components.resize(n);
		for(int i = 0; i < n; i++) components[i] = {i};
	}
	int root(int x){
		return (x == par[x]) ? x : (par[x] = root(par[x]));
	}
	void merge(int x, int y){
		x = root(x); y = root(y);
		if(x == y) return;
		copy(all(components[x]), back_inserter(components[y]));
		components[x].clear();
		par[x] = y;
	}
};

int construct(vector<vector<int>> p) {
	int n = p.size();
	vector<vector<int>> adj(n, vector<int>(n, 0));
	function<void(int, int)> add_edge = [&](int x, int y){
		adj[x][y] = adj[y][x] = 1;
	};
	dsu D(n);
	for(int i = 0; i < n; i++){
		for(int j = i + 1; j < n; j++){
			if(p[i][j] > 0) D.merge(i, j);
		}
	}

	for(int i = 0; i < n; i++) if(D.par[i] == i){
		vector<int> v = D.components[i];
		for(int x : v) for(int y : v) if(p[x][y] == 0 || p[x][y] == 3) return 0;
		dsu D2(n);
		for(int x : v) for(int y : v) if(x != y && p[x][y] == 1) D2.merge(x, y);
		vector<int> cycle;
		for(int x : v) if(D2.par[x] == x){
			cycle.push_back(x);
			vector<int> U = D2.components[x];
			int lst = -1;
			for(int a : U){
				for(int b : U) if(p[a][b] != 1) return 0;
				if(lst != -1) add_edge(a, lst);
				lst = a;
			}
		}
		int m = cycle.size();
		if(m == 2) return 0;
		if(m > 1)
		for(int k = 0; k < m; k++) add_edge(cycle[k], cycle[(k + 1) % m]);
	}
	build(adj);

	return 1;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 262 ms 24872 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 12 ms 1152 KB Output is correct
13 Correct 294 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 6 ms 896 KB Output is correct
17 Correct 121 ms 14840 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 61 ms 5880 KB Output is correct
21 Correct 240 ms 22392 KB Output is correct
22 Correct 255 ms 22136 KB Output is correct
23 Correct 258 ms 23616 KB Output is correct
24 Correct 288 ms 22136 KB Output is correct
25 Correct 107 ms 12536 KB Output is correct
26 Correct 117 ms 12280 KB Output is correct
27 Correct 255 ms 23480 KB Output is correct
28 Correct 290 ms 22172 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 12 ms 1152 KB Output is correct
9 Correct 293 ms 22136 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 11 ms 1280 KB Output is correct
13 Correct 254 ms 24952 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 122 ms 14840 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 61 ms 5880 KB Output is correct
22 Correct 242 ms 22524 KB Output is correct
23 Correct 253 ms 22140 KB Output is correct
24 Correct 258 ms 23544 KB Output is correct
25 Correct 153 ms 12280 KB Output is correct
26 Correct 109 ms 12620 KB Output is correct
27 Correct 254 ms 22168 KB Output is correct
28 Correct 256 ms 23544 KB Output is correct
29 Correct 152 ms 12280 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 62 ms 5880 KB Output is correct
5 Correct 241 ms 22520 KB Output is correct
6 Correct 258 ms 22136 KB Output is correct
7 Correct 267 ms 23616 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 62 ms 5836 KB Output is correct
10 Correct 243 ms 22392 KB Output is correct
11 Correct 249 ms 22136 KB Output is correct
12 Correct 255 ms 23672 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 63 ms 5880 KB Output is correct
17 Correct 238 ms 22520 KB Output is correct
18 Correct 246 ms 22520 KB Output is correct
19 Correct 264 ms 22264 KB Output is correct
20 Correct 303 ms 22136 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 262 ms 24872 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 12 ms 1152 KB Output is correct
13 Correct 294 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 6 ms 896 KB Output is correct
17 Correct 121 ms 14840 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 61 ms 5880 KB Output is correct
21 Correct 240 ms 22392 KB Output is correct
22 Correct 255 ms 22136 KB Output is correct
23 Correct 258 ms 23616 KB Output is correct
24 Correct 288 ms 22136 KB Output is correct
25 Correct 107 ms 12536 KB Output is correct
26 Correct 117 ms 12280 KB Output is correct
27 Correct 255 ms 23480 KB Output is correct
28 Correct 290 ms 22172 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 12 ms 1152 KB Output is correct
37 Correct 293 ms 22136 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 11 ms 1280 KB Output is correct
41 Correct 254 ms 24952 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 1 ms 256 KB Output is correct
44 Correct 5 ms 896 KB Output is correct
45 Correct 122 ms 14840 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 0 ms 256 KB Output is correct
48 Correct 1 ms 256 KB Output is correct
49 Correct 61 ms 5880 KB Output is correct
50 Correct 242 ms 22524 KB Output is correct
51 Correct 253 ms 22140 KB Output is correct
52 Correct 258 ms 23544 KB Output is correct
53 Correct 153 ms 12280 KB Output is correct
54 Correct 109 ms 12620 KB Output is correct
55 Correct 254 ms 22168 KB Output is correct
56 Correct 256 ms 23544 KB Output is correct
57 Correct 152 ms 12280 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 1 ms 256 KB Output is correct
60 Correct 5 ms 896 KB Output is correct
61 Correct 120 ms 14840 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 1 ms 256 KB Output is correct
64 Correct 1 ms 256 KB Output is correct
65 Correct 63 ms 6008 KB Output is correct
66 Correct 108 ms 12632 KB Output is correct
67 Correct 110 ms 12536 KB Output is correct
68 Correct 105 ms 12284 KB Output is correct
69 Correct 129 ms 12408 KB Output is correct

Subtask #6
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 262 ms 24872 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 12 ms 1152 KB Output is correct
13 Correct 294 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 6 ms 896 KB Output is correct
17 Correct 121 ms 14840 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 61 ms 5880 KB Output is correct
21 Correct 240 ms 22392 KB Output is correct
22 Correct 255 ms 22136 KB Output is correct
23 Correct 258 ms 23616 KB Output is correct
24 Correct 288 ms 22136 KB Output is correct
25 Correct 107 ms 12536 KB Output is correct
26 Correct 117 ms 12280 KB Output is correct
27 Correct 255 ms 23480 KB Output is correct
28 Correct 290 ms 22172 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 12 ms 1152 KB Output is correct
37 Correct 293 ms 22136 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 11 ms 1280 KB Output is correct
41 Correct 254 ms 24952 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 1 ms 256 KB Output is correct
44 Correct 5 ms 896 KB Output is correct
45 Correct 122 ms 14840 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 0 ms 256 KB Output is correct
48 Correct 1 ms 256 KB Output is correct
49 Correct 61 ms 5880 KB Output is correct
50 Correct 242 ms 22524 KB Output is correct
51 Correct 253 ms 22140 KB Output is correct
52 Correct 258 ms 23544 KB Output is correct
53 Correct 153 ms 12280 KB Output is correct
54 Correct 109 ms 12620 KB Output is correct
55 Correct 254 ms 22168 KB Output is correct
56 Correct 256 ms 23544 KB Output is correct
57 Correct 152 ms 12280 KB Output is correct
58 Correct 1 ms 256 KB Output is correct
59 Correct 1 ms 256 KB Output is correct
60 Correct 0 ms 256 KB Output is correct
61 Correct 62 ms 5880 KB Output is correct
62 Correct 241 ms 22520 KB Output is correct
63 Correct 258 ms 22136 KB Output is correct
64 Correct 267 ms 23616 KB Output is correct
65 Correct 1 ms 384 KB Output is correct
66 Correct 62 ms 5836 KB Output is correct
67 Correct 243 ms 22392 KB Output is correct
68 Correct 249 ms 22136 KB Output is correct
69 Correct 255 ms 23672 KB Output is correct
70 Correct 1 ms 256 KB Output is correct
71 Correct 1 ms 384 KB Output is correct
72 Correct 1 ms 256 KB Output is correct
73 Correct 63 ms 5880 KB Output is correct
74 Correct 238 ms 22520 KB Output is correct
75 Correct 246 ms 22520 KB Output is correct
76 Correct 264 ms 22264 KB Output is correct
77 Correct 303 ms 22136 KB Output is correct
78 Correct 1 ms 384 KB Output is correct
79 Correct 1 ms 256 KB Output is correct
80 Correct 5 ms 896 KB Output is correct
81 Correct 120 ms 14840 KB Output is correct
82 Correct 1 ms 384 KB Output is correct
83 Correct 1 ms 256 KB Output is correct
84 Correct 1 ms 256 KB Output is correct
85 Correct 63 ms 6008 KB Output is correct
86 Correct 108 ms 12632 KB Output is correct
87 Correct 110 ms 12536 KB Output is correct
88 Correct 105 ms 12284 KB Output is correct
89 Correct 129 ms 12408 KB Output is correct
90 Correct 1 ms 256 KB Output is correct
91 Correct 1 ms 256 KB Output is correct
92 Correct 5 ms 1024 KB Output is correct
93 Correct 118 ms 14840 KB Output is correct
94 Correct 1 ms 384 KB Output is correct
95 Correct 1 ms 256 KB Output is correct
96 Correct 1 ms 256 KB Output is correct
97 Correct 33 ms 3456 KB Output is correct
98 Correct 108 ms 12536 KB Output is correct
99 Correct 112 ms 12536 KB Output is correct
100 Correct 110 ms 12408 KB Output is correct
101 Correct 125 ms 12408 KB Output is correct
102 Correct 121 ms 14840 KB Output is correct
103 Correct 123 ms 14968 KB Output is correct
104 Correct 119 ms 14968 KB Output is correct
105 Correct 120 ms 14844 KB Output is correct