oj.uz

Submission #300447

# Submission time Handle Problem Language Result Execution time Memory
300447 2020-09-17T07:22:33 Z faustaadp Connecting Supertrees (IOI20_supertrees) C++17
100 / 100
 261 ms 26276 KB 
#include "supertrees.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
const ll NN = 1e3 + 5;
ll n, bisa = 1, p[NN], x[NN], kel[NN], ket[NN];
std::vector<std::vector<int>> answer;
vector<ll> v[NN];
std::vector<std::vector<int>> px;
ll car(ll pos)
{
	if(p[pos] == pos)
		return pos;
	else
		return p[pos] = car(p[pos]);
}
int construct(std::vector<std::vector<int>> pt) {
	px = pt;
	n = px.size();
	for (int i = 0; i < n; i++) {
		std::vector<int> row;
		row.resize(n, 0);
		answer.push_back(row);
	}
	for (int i = 0; i < n; i++) 
		p[i] = i;
	for (int i = 0; i < n; i++) 
		for (int j = i + 1; j < n; j++) 
			if(px[i][j])
				p[car(i)] = car(j); 
	for (int i = 0; i < n; i++) 
		v[car(i)].pb(i);
	for (int i = 0; i < n; i++) 
	{
		if(!bisa)
			break;
		ll sz = v[i].size();
		x[0] = 0;
		x[1] = 0;
		x[2] = 0;
		x[3] = 0;
		for(ll j = 0; j < sz; j++)
			for(ll k = j + 1; k < sz; k++)
				x[px[v[i][j]][v[i][k]]] = 1;
		if(x[0] + x[1] + x[2] + x[3] == 0) 
			continue;
		else
		if(x[0])
			bisa = 0;
		else
		if(x[2] == 1 && x[3] == 1)
			bisa = 0;
		else
		if(x[1] == 1 && x[2] == 0 && x[3] == 0)
		{
			for(ll j = 1; j < sz; j++)
			{
				answer[v[i][j - 1]][v[i][j]] = 1;
				answer[v[i][j]][v[i][j - 1]] = 1;
			}
		}
		else
		if(x[2] == 1)
		{
			ll te = 0;
			for(ll j = 0; j < sz; j++)
			{
				if(kel[v[i][j]])
					continue;
				te++;
				kel[v[i][j]] = te;
				ket[te] = v[i][j];
				// cout << te << " " << ket[te] << "_\n"
				for(ll k = 0; k < sz; k++)
				{
					if(j == k)
						continue;
					if(px[v[i][j]][v[i][k]] == 1)
					{
						kel[v[i][k]] = te;
						// cout << v[i][j] << " " << v[i][k] << "_\n";
						answer[v[i][j]][v[i][k]] = 1;
						answer[v[i][k]][v[i][j]] = 1;
					}
				}
			}
			for(ll j = 0; j < sz; j++)
				for(ll k = j + 1; k < sz; k++)
				{
					if(px[v[i][j]][v[i][k]] == 1 && kel[v[i][j]] != kel[v[i][k]])
						bisa = 0;
					if(px[v[i][j]][v[i][k]] != 1 && kel[v[i][j]] == kel[v[i][k]])
						bisa = 0;
				}
			if(te <= 2)
				bisa = 0;
			if(!bisa)
				break;
			for(ll j = 1; j < te; j++)
			{
				// cout << ket[j] << " " << ket[j + 1] << "_\n";
				answer[ket[j]][ket[j + 1]] = 1;
				answer[ket[j + 1]][ket[j]] = 1;
			}
			answer[ket[te]][ket[1]] = 1;
			answer[ket[1]][ket[te]] = 1;
		}
		else
		if(x[3] == 1)
		{
			bisa = 0;
		}
	}
	if(!bisa)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 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 10 ms 1408 KB Output is correct
7 Correct 241 ms 26104 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 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 10 ms 1408 KB Output is correct
7 Correct 241 ms 26104 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 288 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1408 KB Output is correct
13 Correct 236 ms 26124 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 1024 KB Output is correct
17 Correct 116 ms 16248 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 62 ms 6904 KB Output is correct
21 Correct 245 ms 26104 KB Output is correct
22 Correct 249 ms 26104 KB Output is correct
23 Correct 260 ms 26104 KB Output is correct
24 Correct 242 ms 26104 KB Output is correct
25 Correct 104 ms 16120 KB Output is correct
26 Correct 128 ms 16124 KB Output is correct
27 Correct 261 ms 26224 KB Output is correct
28 Correct 237 ms 26104 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 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 11 ms 1408 KB Output is correct
9 Correct 248 ms 26104 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 1408 KB Output is correct
13 Correct 255 ms 26156 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 1024 KB Output is correct
17 Correct 114 ms 16120 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 61 ms 6904 KB Output is correct
22 Correct 241 ms 26104 KB Output is correct
23 Correct 241 ms 26232 KB Output is correct
24 Correct 256 ms 26104 KB Output is correct
25 Correct 99 ms 16372 KB Output is correct
26 Correct 103 ms 16120 KB Output is correct
27 Correct 243 ms 26104 KB Output is correct
28 Correct 254 ms 26104 KB Output is correct
29 Correct 98 ms 16120 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 60 ms 6904 KB Output is correct
5 Correct 240 ms 26104 KB Output is correct
6 Correct 239 ms 26276 KB Output is correct
7 Correct 252 ms 26104 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 61 ms 6904 KB Output is correct
10 Correct 251 ms 26232 KB Output is correct
11 Correct 238 ms 26232 KB Output is correct
12 Correct 252 ms 26156 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 60 ms 6904 KB Output is correct
17 Correct 244 ms 26232 KB Output is correct
18 Correct 247 ms 26104 KB Output is correct
19 Correct 244 ms 26104 KB Output is correct
20 Correct 242 ms 26232 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 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 10 ms 1408 KB Output is correct
7 Correct 241 ms 26104 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 288 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1408 KB Output is correct
13 Correct 236 ms 26124 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 1024 KB Output is correct
17 Correct 116 ms 16248 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 62 ms 6904 KB Output is correct
21 Correct 245 ms 26104 KB Output is correct
22 Correct 249 ms 26104 KB Output is correct
23 Correct 260 ms 26104 KB Output is correct
24 Correct 242 ms 26104 KB Output is correct
25 Correct 104 ms 16120 KB Output is correct
26 Correct 128 ms 16124 KB Output is correct
27 Correct 261 ms 26224 KB Output is correct
28 Correct 237 ms 26104 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 11 ms 1408 KB Output is correct
37 Correct 248 ms 26104 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 1408 KB Output is correct
41 Correct 255 ms 26156 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 5 ms 1024 KB Output is correct
45 Correct 114 ms 16120 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 61 ms 6904 KB Output is correct
50 Correct 241 ms 26104 KB Output is correct
51 Correct 241 ms 26232 KB Output is correct
52 Correct 256 ms 26104 KB Output is correct
53 Correct 99 ms 16372 KB Output is correct
54 Correct 103 ms 16120 KB Output is correct
55 Correct 243 ms 26104 KB Output is correct
56 Correct 254 ms 26104 KB Output is correct
57 Correct 98 ms 16120 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 1024 KB Output is correct
61 Correct 115 ms 16120 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 60 ms 6904 KB Output is correct
66 Correct 105 ms 16120 KB Output is correct
67 Correct 106 ms 16120 KB Output is correct
68 Correct 99 ms 16120 KB Output is correct
69 Correct 101 ms 16124 KB Output is correct

Subtask #6
4.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 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 10 ms 1408 KB Output is correct
7 Correct 241 ms 26104 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 288 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1408 KB Output is correct
13 Correct 236 ms 26124 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 1024 KB Output is correct
17 Correct 116 ms 16248 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 62 ms 6904 KB Output is correct
21 Correct 245 ms 26104 KB Output is correct
22 Correct 249 ms 26104 KB Output is correct
23 Correct 260 ms 26104 KB Output is correct
24 Correct 242 ms 26104 KB Output is correct
25 Correct 104 ms 16120 KB Output is correct
26 Correct 128 ms 16124 KB Output is correct
27 Correct 261 ms 26224 KB Output is correct
28 Correct 237 ms 26104 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 11 ms 1408 KB Output is correct
37 Correct 248 ms 26104 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 1408 KB Output is correct
41 Correct 255 ms 26156 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 5 ms 1024 KB Output is correct
45 Correct 114 ms 16120 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 61 ms 6904 KB Output is correct
50 Correct 241 ms 26104 KB Output is correct
51 Correct 241 ms 26232 KB Output is correct
52 Correct 256 ms 26104 KB Output is correct
53 Correct 99 ms 16372 KB Output is correct
54 Correct 103 ms 16120 KB Output is correct
55 Correct 243 ms 26104 KB Output is correct
56 Correct 254 ms 26104 KB Output is correct
57 Correct 98 ms 16120 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 60 ms 6904 KB Output is correct
62 Correct 240 ms 26104 KB Output is correct
63 Correct 239 ms 26276 KB Output is correct
64 Correct 252 ms 26104 KB Output is correct
65 Correct 1 ms 384 KB Output is correct
66 Correct 61 ms 6904 KB Output is correct
67 Correct 251 ms 26232 KB Output is correct
68 Correct 238 ms 26232 KB Output is correct
69 Correct 252 ms 26156 KB Output is correct
70 Correct 1 ms 384 KB Output is correct
71 Correct 1 ms 512 KB Output is correct
72 Correct 1 ms 384 KB Output is correct
73 Correct 60 ms 6904 KB Output is correct
74 Correct 244 ms 26232 KB Output is correct
75 Correct 247 ms 26104 KB Output is correct
76 Correct 244 ms 26104 KB Output is correct
77 Correct 242 ms 26232 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 1024 KB Output is correct
81 Correct 115 ms 16120 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 60 ms 6904 KB Output is correct
86 Correct 105 ms 16120 KB Output is correct
87 Correct 106 ms 16120 KB Output is correct
88 Correct 99 ms 16120 KB Output is correct
89 Correct 101 ms 16124 KB Output is correct
90 Correct 1 ms 384 KB Output is correct
91 Correct 1 ms 384 KB Output is correct
92 Correct 5 ms 1024 KB Output is correct
93 Correct 111 ms 16224 KB Output is correct
94 Correct 1 ms 384 KB Output is correct
95 Correct 1 ms 512 KB Output is correct
96 Correct 1 ms 384 KB Output is correct
97 Correct 25 ms 4480 KB Output is correct
98 Correct 102 ms 16120 KB Output is correct
99 Correct 103 ms 16120 KB Output is correct
100 Correct 100 ms 16120 KB Output is correct
101 Correct 99 ms 16124 KB Output is correct
102 Correct 109 ms 16124 KB Output is correct
103 Correct 108 ms 16120 KB Output is correct
104 Correct 107 ms 16124 KB Output is correct
105 Correct 117 ms 16120 KB Output is correct