oj.uz

Submission #975307

# Submission time Handle Problem Language Result Execution time Memory
975307 2024-05-04T18:12:32 Z raspy Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 170 ms 22624 KB 
#include "supertrees.h"
#include <vector>
#include <iostream>

using namespace std;

bool obd[20005];
int dis[20005];
vector<int> el[20005];

int par(int x)
{
	return dis[x] = (dis[x] == x ? x : par(dis[x]));
}

void zd(int x, int y, bool zlij = true)
{
	x = par(x);
	y = par(y);
	if (x == y)
		return;
	if (el[x].size() < el[y].size())
		swap(x, y);
	if (zlij)
	{
		for (auto e : el[y])
			el[x].push_back(e);
	}
	el[y].clear();
	dis[y] = x;
	return;
}

int construct(vector<vector<int>> p)
{
	int n = p.size();
	vector<vector<int>> gr(n, vector<int>(n, 0));
	for (int i = 0; i < n; i++)
	{
		el[i].push_back(i);
		dis[i] = i;
	}
	for (int i = 0; i < n; i++)
		for (int j = i+1; j < n; j++)
		{
			if (p[i][j] == 1 && par(i)-par(j))
			{
				gr[par(i)][par(j)] = gr[par(j)][par(i)] = 1;
				zd(i, j, 0);
			}
		}
	int dalje = 0;
	for (int i = 0; i < n; i++)
		for (int j = i+1; j < n; j++)
		{
			if (p[i][j] == 2 && par(i)-par(j))
			{
				dalje = 1;
				zd(i, j);
			}
		}
	if (dalje)
	{
		for (int i = 0; i < n; i++)
		{
			int x = par(i);
			if (obd[x])
				continue;
			obd[x] = 1;			
			vector<int> tr = el[x];
			if (tr.size() <= 2)
				return 0;
			tr.push_back(x);
			int pr = -1;
			for (auto v : el[x])
			{
				if (pr != -1)
					gr[v][pr] = gr[pr][v] = 1;
				pr = v;
			}
		}
	}
	for (int i = 0; i < n; i++)
		for (int j = i+1; j < n; j++)
			if (p[i][j] == 0 && par(i) == par(j))
				return 0;
	build(gr);
	return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 1 ms 856 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 0 ms 860 KB Output is correct
6 Correct 7 ms 1628 KB Output is correct
7 Correct 151 ms 22444 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 1 ms 856 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 0 ms 860 KB Output is correct
6 Correct 7 ms 1628 KB Output is correct
7 Correct 151 ms 22444 KB Output is correct
8 Correct 1 ms 856 KB Output is correct
9 Correct 0 ms 860 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 860 KB Output is correct
12 Correct 7 ms 1752 KB Output is correct
13 Correct 150 ms 22612 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 1 ms 860 KB Output is correct
16 Correct 3 ms 1372 KB Output is correct
17 Correct 69 ms 12532 KB Output is correct
18 Correct 0 ms 860 KB Output is correct
19 Correct 1 ms 860 KB Output is correct
20 Correct 42 ms 6224 KB Output is correct
21 Correct 170 ms 22512 KB Output is correct
22 Correct 152 ms 22608 KB Output is correct
23 Correct 154 ms 22476 KB Output is correct
24 Correct 154 ms 22476 KB Output is correct
25 Correct 63 ms 12628 KB Output is correct
26 Correct 65 ms 12628 KB Output is correct
27 Correct 163 ms 22496 KB Output is correct
28 Correct 154 ms 22624 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 1 ms 856 KB Output is correct
3 Correct 0 ms 860 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Incorrect 1 ms 860 KB Too few ways to get from 0 to 1, should be 2 found 1
6 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 860 KB Output is correct
2 Incorrect 0 ms 860 KB Too few ways to get from 0 to 1, should be 2 found 1
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 1 ms 856 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 0 ms 860 KB Output is correct
6 Correct 7 ms 1628 KB Output is correct
7 Correct 151 ms 22444 KB Output is correct
8 Correct 1 ms 856 KB Output is correct
9 Correct 0 ms 860 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 860 KB Output is correct
12 Correct 7 ms 1752 KB Output is correct
13 Correct 150 ms 22612 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 1 ms 860 KB Output is correct
16 Correct 3 ms 1372 KB Output is correct
17 Correct 69 ms 12532 KB Output is correct
18 Correct 0 ms 860 KB Output is correct
19 Correct 1 ms 860 KB Output is correct
20 Correct 42 ms 6224 KB Output is correct
21 Correct 170 ms 22512 KB Output is correct
22 Correct 152 ms 22608 KB Output is correct
23 Correct 154 ms 22476 KB Output is correct
24 Correct 154 ms 22476 KB Output is correct
25 Correct 63 ms 12628 KB Output is correct
26 Correct 65 ms 12628 KB Output is correct
27 Correct 163 ms 22496 KB Output is correct
28 Correct 154 ms 22624 KB Output is correct
29 Correct 1 ms 860 KB Output is correct
30 Correct 1 ms 856 KB Output is correct
31 Correct 0 ms 860 KB Output is correct
32 Correct 1 ms 860 KB Output is correct
33 Incorrect 1 ms 860 KB Too few ways to get from 0 to 1, should be 2 found 1
34 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 1 ms 856 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 0 ms 860 KB Output is correct
6 Correct 7 ms 1628 KB Output is correct
7 Correct 151 ms 22444 KB Output is correct
8 Correct 1 ms 856 KB Output is correct
9 Correct 0 ms 860 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 860 KB Output is correct
12 Correct 7 ms 1752 KB Output is correct
13 Correct 150 ms 22612 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 1 ms 860 KB Output is correct
16 Correct 3 ms 1372 KB Output is correct
17 Correct 69 ms 12532 KB Output is correct
18 Correct 0 ms 860 KB Output is correct
19 Correct 1 ms 860 KB Output is correct
20 Correct 42 ms 6224 KB Output is correct
21 Correct 170 ms 22512 KB Output is correct
22 Correct 152 ms 22608 KB Output is correct
23 Correct 154 ms 22476 KB Output is correct
24 Correct 154 ms 22476 KB Output is correct
25 Correct 63 ms 12628 KB Output is correct
26 Correct 65 ms 12628 KB Output is correct
27 Correct 163 ms 22496 KB Output is correct
28 Correct 154 ms 22624 KB Output is correct
29 Correct 1 ms 860 KB Output is correct
30 Correct 1 ms 856 KB Output is correct
31 Correct 0 ms 860 KB Output is correct
32 Correct 1 ms 860 KB Output is correct
33 Incorrect 1 ms 860 KB Too few ways to get from 0 to 1, should be 2 found 1
34 Halted 0 ms 0 KB -