oj.uz

Submission #300685

# Submission time Handle Problem Language Result Execution time Memory
300685 2020-09-17T11:56:03 Z gs14004 Connecting Supertrees (IOI20_supertrees) C++17
56 / 100
 269 ms 22392 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;
		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;
		}
	}
	build(answer);
	return 1;
}

Subtask #1
11.0 / 11.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 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 22232 KB Output is correct

Subtask #2
10.0 / 10.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 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 22232 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 1 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 248 ms 22228 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 768 KB Output is correct
17 Correct 120 ms 12184 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 62 ms 5880 KB Output is correct
21 Correct 262 ms 22136 KB Output is correct
22 Correct 269 ms 22264 KB Output is correct
23 Correct 256 ms 22136 KB Output is correct
24 Correct 245 ms 22264 KB Output is correct
25 Correct 117 ms 12152 KB Output is correct
26 Correct 107 ms 12152 KB Output is correct
27 Correct 260 ms 22264 KB Output is correct
28 Correct 246 ms 22136 KB Output is correct

Subtask #3
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 512 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 11 ms 1280 KB Output is correct
9 Correct 252 ms 22136 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 251 ms 22392 KB Output is correct
14 Incorrect 1 ms 512 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 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 258 ms 22264 KB Output is correct
6 Correct 258 ms 22264 KB Output is correct
7 Correct 257 ms 22136 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 64 ms 5880 KB Output is correct
10 Correct 250 ms 22264 KB Output is correct
11 Correct 259 ms 22208 KB Output is correct
12 Correct 265 ms 22240 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 63 ms 6004 KB Output is correct
17 Correct 248 ms 22264 KB Output is correct
18 Correct 254 ms 22264 KB Output is correct
19 Correct 258 ms 22360 KB Output is correct
20 Correct 248 ms 22268 KB Output is correct

Subtask #5
0 / 21.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 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 22232 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 1 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 248 ms 22228 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 768 KB Output is correct
17 Correct 120 ms 12184 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 62 ms 5880 KB Output is correct
21 Correct 262 ms 22136 KB Output is correct
22 Correct 269 ms 22264 KB Output is correct
23 Correct 256 ms 22136 KB Output is correct
24 Correct 245 ms 22264 KB Output is correct
25 Correct 117 ms 12152 KB Output is correct
26 Correct 107 ms 12152 KB Output is correct
27 Correct 260 ms 22264 KB Output is correct
28 Correct 246 ms 22136 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 512 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 512 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 11 ms 1280 KB Output is correct
37 Correct 252 ms 22136 KB Output is correct
38 Correct 1 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 251 ms 22392 KB Output is correct
42 Incorrect 1 ms 512 KB Answer gives possible 1 while actual possible 0
43 Halted 0 ms 0 KB -

Subtask #6
0 / 4.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 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 22232 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 1 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 248 ms 22228 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 768 KB Output is correct
17 Correct 120 ms 12184 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 62 ms 5880 KB Output is correct
21 Correct 262 ms 22136 KB Output is correct
22 Correct 269 ms 22264 KB Output is correct
23 Correct 256 ms 22136 KB Output is correct
24 Correct 245 ms 22264 KB Output is correct
25 Correct 117 ms 12152 KB Output is correct
26 Correct 107 ms 12152 KB Output is correct
27 Correct 260 ms 22264 KB Output is correct
28 Correct 246 ms 22136 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 512 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 512 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 11 ms 1280 KB Output is correct
37 Correct 252 ms 22136 KB Output is correct
38 Correct 1 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 251 ms 22392 KB Output is correct
42 Incorrect 1 ms 512 KB Answer gives possible 1 while actual possible 0
43 Halted 0 ms 0 KB -