oj.uz

Submission #300688

# Submission time Handle Problem Language Result Execution time Memory
300688 2020-09-17T12:00:14 Z gs14004 Connecting Supertrees (IOI20_supertrees) C++17
96 / 100
 279 ms 22356 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
using namespace std;
using lint = long long;
using llf = long double;
const int MAXN = 1505;

struct disj{
	int pa[MAXN];
	int sz[MAXN];
	void init(int n){
		iota(pa, pa + n + 1, 0);
		fill(sz, sz + n + 1, 1);
	}
	int find(int x){
		return pa[x] = (pa[x] == x ? x : find(pa[x]));
	}
	int getsz(int x){ return sz[find(x)]; }
	bool uni(int p, int q){
		p = find(p);
		q = find(q);
		if(p == q) return 0;
		sz[p] += sz[q];
		pa[q] = p; return 1;
	}
}disj, cx, cy;

int n;

int construct(std::vector<std::vector<int>> a) {
	n = sz(a);
	disj.init(n);
	std::vector<std::vector<int>> answer(n);
	for(int i=0; i<n; i++){
		for(int j=0; j<n; j++){
			if(a[i][j] == 1) disj.uni(i, j);
		}
		answer[i].resize(n);
	}
	vector<int> v;
	for(int i=0; i<n; i++){
		if(disj.find(i) != i){
			answer[i][disj.find(i)] = 1;
			answer[disj.find(i)][i] = 1;
		}
		else v.push_back(i);
	}
	for(int i=0; i<n; i++){
		for(int j=0; j<n; j++){
			if(a[i][j] != a[disj.find(i)][disj.find(j)]) return 0;
		}
	}
	cx.init(n);
	cy.init(n);
	for(auto &i : v){
		for(auto &j : v){
			if(a[i][j] == 2){
				cx.uni(i, j);
			}
			if(a[i][j] == 3){
				cy.uni(i, j);
			}
		}
	}
	vector<int> v2[MAXN], v3[MAXN];
	for(auto &i : v){
		if(cx.getsz(i) > 1 && cy.getsz(i) > 1) return 0;
		if(cx.getsz(i) > 1) v2[cx.find(i)].push_back(i);
		if(cy.getsz(i) > 1) v3[cy.find(i)].push_back(i);
	}
	for(int i=0; i<n; i++){
		if(sz(v2[i]) && sz(v2[i]) <= 2) return 0;
		if(sz(v3[i]) && sz(v3[i]) <= 3) return 0;
		for(auto &x : v2[i]){
			for(auto &y : v2[i]){
				if(x != y && a[x][y] != 2) return 0;
			}
		}
		for(auto &x : v3[i]){
			for(auto &y : v3[i]){
				if(x != y && a[x][y] != 3) return 0;
			}
		}
		if(sz(v2[i])){
			for(int j=0; j<sz(v2[i]); j++){
				int l = v2[i][j];
				int r = v2[i][(j+1)%sz(v2[i])];
				answer[l][r] = answer[r][l] = 1;
			}
		}
		if(sz(v3[i])){
			for(int j=0; j<sz(v3[i]); j++){
				int l = v3[i][j];
				int r = v3[i][(j+1)%sz(v3[i])];
				answer[l][r] = answer[r][l] = 1;
			}
			answer[v3[i][1]][v3[i][3]] = 1;
			answer[v3[i][3]][v3[i][1]] = 1;
		}
	}
	disj.init(n);
	for(int i=0; i<n; i++){
		for(int j=0; j<n; j++){
			if(answer[i][j]) disj.uni(i, j);
		}
	}
	for(int i=0; i<n; i++){
		for(int j=0; j<n; j++){
			if(a[i][j] == 0 && disj.find(i) == disj.find(j)) return 0;
		}
	}
	build(answer);
	return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory 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 1 ms 416 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 274 ms 22264 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 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 416 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 274 ms 22264 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 15 ms 1280 KB Output is correct
13 Correct 269 ms 22264 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 820 KB Output is correct
17 Correct 119 ms 12128 KB Output is correct
18 Correct 0 ms 288 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 67 ms 5928 KB Output is correct
21 Correct 265 ms 22240 KB Output is correct
22 Correct 263 ms 22300 KB Output is correct
23 Correct 269 ms 22264 KB Output is correct
24 Correct 249 ms 22264 KB Output is correct
25 Correct 104 ms 12152 KB Output is correct
26 Correct 99 ms 12152 KB Output is correct
27 Correct 268 ms 22264 KB Output is correct
28 Correct 252 ms 22228 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory 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 1 ms 384 KB Output is correct
5 Correct 1 ms 416 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 10 ms 1280 KB Output is correct
9 Correct 277 ms 22252 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 17 ms 1280 KB Output is correct
13 Correct 273 ms 22264 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 8 ms 896 KB Output is correct
17 Correct 130 ms 12188 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 63 ms 5880 KB Output is correct
22 Correct 256 ms 22172 KB Output is correct
23 Correct 247 ms 22136 KB Output is correct
24 Correct 265 ms 22136 KB Output is correct
25 Correct 103 ms 12252 KB Output is correct
26 Correct 111 ms 12280 KB Output is correct
27 Correct 257 ms 22232 KB Output is correct
28 Correct 270 ms 22232 KB Output is correct
29 Correct 102 ms 12252 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory 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 69 ms 5924 KB Output is correct
5 Correct 265 ms 22136 KB Output is correct
6 Correct 251 ms 22136 KB Output is correct
7 Correct 267 ms 22136 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 66 ms 5880 KB Output is correct
10 Correct 262 ms 22264 KB Output is correct
11 Correct 257 ms 22192 KB Output is correct
12 Correct 279 ms 22164 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 416 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 67 ms 5880 KB Output is correct
17 Correct 261 ms 22244 KB Output is correct
18 Correct 264 ms 22136 KB Output is correct
19 Correct 260 ms 22264 KB Output is correct
20 Correct 243 ms 22136 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory 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 1 ms 416 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 274 ms 22264 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 15 ms 1280 KB Output is correct
13 Correct 269 ms 22264 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 820 KB Output is correct
17 Correct 119 ms 12128 KB Output is correct
18 Correct 0 ms 288 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 67 ms 5928 KB Output is correct
21 Correct 265 ms 22240 KB Output is correct
22 Correct 263 ms 22300 KB Output is correct
23 Correct 269 ms 22264 KB Output is correct
24 Correct 249 ms 22264 KB Output is correct
25 Correct 104 ms 12152 KB Output is correct
26 Correct 99 ms 12152 KB Output is correct
27 Correct 268 ms 22264 KB Output is correct
28 Correct 252 ms 22228 KB Output is correct
29 Correct 1 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 1 ms 384 KB Output is correct
33 Correct 1 ms 416 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 512 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 277 ms 22252 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 17 ms 1280 KB Output is correct
41 Correct 273 ms 22264 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 8 ms 896 KB Output is correct
45 Correct 130 ms 12188 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 63 ms 5880 KB Output is correct
50 Correct 256 ms 22172 KB Output is correct
51 Correct 247 ms 22136 KB Output is correct
52 Correct 265 ms 22136 KB Output is correct
53 Correct 103 ms 12252 KB Output is correct
54 Correct 111 ms 12280 KB Output is correct
55 Correct 257 ms 22232 KB Output is correct
56 Correct 270 ms 22232 KB Output is correct
57 Correct 102 ms 12252 KB Output is correct
58 Correct 1 ms 256 KB Output is correct
59 Correct 1 ms 256 KB Output is correct
60 Correct 5 ms 768 KB Output is correct
61 Correct 132 ms 12156 KB Output is correct
62 Correct 1 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 65 ms 5880 KB Output is correct
66 Correct 99 ms 12152 KB Output is correct
67 Correct 102 ms 12152 KB Output is correct
68 Correct 106 ms 12120 KB Output is correct
69 Correct 109 ms 12248 KB Output is correct

Subtask #6
0 / 4.0

# Verdict Execution time Memory 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 1 ms 416 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 274 ms 22264 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 15 ms 1280 KB Output is correct
13 Correct 269 ms 22264 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 820 KB Output is correct
17 Correct 119 ms 12128 KB Output is correct
18 Correct 0 ms 288 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 67 ms 5928 KB Output is correct
21 Correct 265 ms 22240 KB Output is correct
22 Correct 263 ms 22300 KB Output is correct
23 Correct 269 ms 22264 KB Output is correct
24 Correct 249 ms 22264 KB Output is correct
25 Correct 104 ms 12152 KB Output is correct
26 Correct 99 ms 12152 KB Output is correct
27 Correct 268 ms 22264 KB Output is correct
28 Correct 252 ms 22228 KB Output is correct
29 Correct 1 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 1 ms 384 KB Output is correct
33 Correct 1 ms 416 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 512 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 277 ms 22252 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 17 ms 1280 KB Output is correct
41 Correct 273 ms 22264 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 8 ms 896 KB Output is correct
45 Correct 130 ms 12188 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 63 ms 5880 KB Output is correct
50 Correct 256 ms 22172 KB Output is correct
51 Correct 247 ms 22136 KB Output is correct
52 Correct 265 ms 22136 KB Output is correct
53 Correct 103 ms 12252 KB Output is correct
54 Correct 111 ms 12280 KB Output is correct
55 Correct 257 ms 22232 KB Output is correct
56 Correct 270 ms 22232 KB Output is correct
57 Correct 102 ms 12252 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 69 ms 5924 KB Output is correct
62 Correct 265 ms 22136 KB Output is correct
63 Correct 251 ms 22136 KB Output is correct
64 Correct 267 ms 22136 KB Output is correct
65 Correct 1 ms 384 KB Output is correct
66 Correct 66 ms 5880 KB Output is correct
67 Correct 262 ms 22264 KB Output is correct
68 Correct 257 ms 22192 KB Output is correct
69 Correct 279 ms 22164 KB Output is correct
70 Correct 1 ms 512 KB Output is correct
71 Correct 1 ms 416 KB Output is correct
72 Correct 1 ms 384 KB Output is correct
73 Correct 67 ms 5880 KB Output is correct
74 Correct 261 ms 22244 KB Output is correct
75 Correct 264 ms 22136 KB Output is correct
76 Correct 260 ms 22264 KB Output is correct
77 Correct 243 ms 22136 KB Output is correct
78 Correct 1 ms 256 KB Output is correct
79 Correct 1 ms 256 KB Output is correct
80 Correct 5 ms 768 KB Output is correct
81 Correct 132 ms 12156 KB Output is correct
82 Correct 1 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 65 ms 5880 KB Output is correct
86 Correct 99 ms 12152 KB Output is correct
87 Correct 102 ms 12152 KB Output is correct
88 Correct 106 ms 12120 KB Output is correct
89 Correct 109 ms 12248 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 768 KB Output is correct
93 Correct 116 ms 12156 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 512 KB Output is correct
97 Correct 30 ms 3456 KB Output is correct
98 Correct 109 ms 12280 KB Output is correct
99 Correct 107 ms 12152 KB Output is correct
100 Correct 105 ms 12152 KB Output is correct
101 Correct 104 ms 12280 KB Output is correct
102 Incorrect 263 ms 22356 KB Answer gives possible 1 while actual possible 0
103 Halted 0 ms 0 KB -