oj.uz

Submission #300294

# Submission time Handle Problem Language Result Execution time Memory
300294 2020-09-17T04:31:29 Z jtnydv25 Connecting Supertrees (IOI20_supertrees) C++17
56 / 100
 338 ms 24868 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++){
		if(p[i][i] != 1) return 0;
		for(int j = i + 1; j < n; j++){
			if(p[i][j] != p[j][i]) return 0;
			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 > 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 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 12 ms 1280 KB Output is correct
7 Correct 274 ms 24868 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 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 12 ms 1280 KB Output is correct
7 Correct 274 ms 24868 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 1268 KB Output is correct
13 Correct 338 ms 22104 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 115 ms 14844 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 64 ms 5880 KB Output is correct
21 Correct 245 ms 22520 KB Output is correct
22 Correct 260 ms 22136 KB Output is correct
23 Correct 268 ms 23616 KB Output is correct
24 Correct 289 ms 22136 KB Output is correct
25 Correct 106 ms 12540 KB Output is correct
26 Correct 109 ms 12280 KB Output is correct
27 Correct 264 ms 23480 KB Output is correct
28 Correct 289 ms 22392 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Incorrect 1 ms 256 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 288 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 64 ms 5884 KB Output is correct
5 Correct 249 ms 22400 KB Output is correct
6 Correct 265 ms 22264 KB Output is correct
7 Correct 264 ms 23612 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 62 ms 5880 KB Output is correct
10 Correct 249 ms 22520 KB Output is correct
11 Correct 251 ms 22208 KB Output is correct
12 Correct 254 ms 23416 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 64 ms 5880 KB Output is correct
17 Correct 243 ms 22520 KB Output is correct
18 Correct 241 ms 22520 KB Output is correct
19 Correct 247 ms 22356 KB Output is correct
20 Correct 286 ms 22136 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 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 12 ms 1280 KB Output is correct
7 Correct 274 ms 24868 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 1268 KB Output is correct
13 Correct 338 ms 22104 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 115 ms 14844 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 64 ms 5880 KB Output is correct
21 Correct 245 ms 22520 KB Output is correct
22 Correct 260 ms 22136 KB Output is correct
23 Correct 268 ms 23616 KB Output is correct
24 Correct 289 ms 22136 KB Output is correct
25 Correct 106 ms 12540 KB Output is correct
26 Correct 109 ms 12280 KB Output is correct
27 Correct 264 ms 23480 KB Output is correct
28 Correct 289 ms 22392 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Incorrect 1 ms 256 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 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 12 ms 1280 KB Output is correct
7 Correct 274 ms 24868 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 1268 KB Output is correct
13 Correct 338 ms 22104 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 115 ms 14844 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 64 ms 5880 KB Output is correct
21 Correct 245 ms 22520 KB Output is correct
22 Correct 260 ms 22136 KB Output is correct
23 Correct 268 ms 23616 KB Output is correct
24 Correct 289 ms 22136 KB Output is correct
25 Correct 106 ms 12540 KB Output is correct
26 Correct 109 ms 12280 KB Output is correct
27 Correct 264 ms 23480 KB Output is correct
28 Correct 289 ms 22392 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Incorrect 1 ms 256 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -