oj.uz

Submission #975305

# Submission time Handle Problem Language Result Execution time Memory
975305 2024-05-04T18:01:42 Z raspy Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 184 ms 24656 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);
			}
		}
	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;
	// for (int i = 0; i < n; i++)
	// {
	// 	int x = par(i);
	// 	if (obd[x])
	// 		continue;
	// 	obd[x] = true;
	// 	vector<int> dv;
	// 	for (int j = 0; j < n; j++)
	// 	{
	// 		if (p[x][j] == 2)
	// 		{
	// 			// if (par(x) == par(j))
	// 			// 	return 0;
	// 			zd(x, j, false);
	// 			dv.push_back(j);
	// 		}
	// 	}
	// 	vector<int>& vsi = el[i];
	// 	for (int k = 1; k < vsi.size(); k++)
	// 	{
	// 		int cnt = 0;
	// 		for (int j = 0; j < n; j++)
	// 		{
	// 			if (p[vsi[k]][j] == 2)
	// 			{
	// 				// if (par(vsi[k]) != par(j))
	// 				// 	return 0;
	// 				zd(vsi[k], j, false);
	// 				cnt++;
	// 			}
	// 		}
	// 		if (cnt != dv.size())
	// 			return 0;
	// 	}
	// 	if (!dv.empty())
	// 	{
	// 		// if (dv.size() < 2)
	// 		// 	return 0;
	// 		gr[x][dv[0]] = 1;
	// 		gr[dv[0]][x] = 1;
	// 		dv.push_back(x);
	// 		for (int k = 0; k < dv.size()-1; k++)
	// 			gr[dv[k]][dv[k+1]] = gr[dv[k+1]][dv[k]] = 1;
	// 	}
	// }
	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 860 KB Output is correct
3 Correct 0 ms 860 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 1 ms 860 KB Output is correct
6 Correct 7 ms 1580 KB Output is correct
7 Correct 184 ms 22576 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 860 KB Output is correct
3 Correct 0 ms 860 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 1 ms 860 KB Output is correct
6 Correct 7 ms 1580 KB Output is correct
7 Correct 184 ms 22576 KB Output is correct
8 Correct 1 ms 856 KB Output is correct
9 Correct 1 ms 856 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 1628 KB Output is correct
13 Correct 153 ms 22516 KB Output is correct
14 Correct 1 ms 856 KB Output is correct
15 Correct 1 ms 856 KB Output is correct
16 Correct 4 ms 1372 KB Output is correct
17 Correct 74 ms 14520 KB Output is correct
18 Correct 1 ms 856 KB Output is correct
19 Correct 1 ms 860 KB Output is correct
20 Correct 40 ms 6788 KB Output is correct
21 Correct 156 ms 24540 KB Output is correct
22 Correct 155 ms 24416 KB Output is correct
23 Correct 160 ms 24640 KB Output is correct
24 Correct 153 ms 24656 KB Output is correct
25 Correct 65 ms 14568 KB Output is correct
26 Correct 60 ms 14680 KB Output is correct
27 Correct 166 ms 24636 KB Output is correct
28 Correct 182 ms 24400 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 0 ms 860 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Incorrect 1 ms 856 KB Answer gives possible 1 while actual possible 0
5 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 0
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 860 KB Output is correct
3 Correct 0 ms 860 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 1 ms 860 KB Output is correct
6 Correct 7 ms 1580 KB Output is correct
7 Correct 184 ms 22576 KB Output is correct
8 Correct 1 ms 856 KB Output is correct
9 Correct 1 ms 856 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 1628 KB Output is correct
13 Correct 153 ms 22516 KB Output is correct
14 Correct 1 ms 856 KB Output is correct
15 Correct 1 ms 856 KB Output is correct
16 Correct 4 ms 1372 KB Output is correct
17 Correct 74 ms 14520 KB Output is correct
18 Correct 1 ms 856 KB Output is correct
19 Correct 1 ms 860 KB Output is correct
20 Correct 40 ms 6788 KB Output is correct
21 Correct 156 ms 24540 KB Output is correct
22 Correct 155 ms 24416 KB Output is correct
23 Correct 160 ms 24640 KB Output is correct
24 Correct 153 ms 24656 KB Output is correct
25 Correct 65 ms 14568 KB Output is correct
26 Correct 60 ms 14680 KB Output is correct
27 Correct 166 ms 24636 KB Output is correct
28 Correct 182 ms 24400 KB Output is correct
29 Correct 1 ms 860 KB Output is correct
30 Correct 0 ms 860 KB Output is correct
31 Correct 1 ms 860 KB Output is correct
32 Incorrect 1 ms 856 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 860 KB Output is correct
2 Correct 1 ms 860 KB Output is correct
3 Correct 0 ms 860 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 1 ms 860 KB Output is correct
6 Correct 7 ms 1580 KB Output is correct
7 Correct 184 ms 22576 KB Output is correct
8 Correct 1 ms 856 KB Output is correct
9 Correct 1 ms 856 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 1628 KB Output is correct
13 Correct 153 ms 22516 KB Output is correct
14 Correct 1 ms 856 KB Output is correct
15 Correct 1 ms 856 KB Output is correct
16 Correct 4 ms 1372 KB Output is correct
17 Correct 74 ms 14520 KB Output is correct
18 Correct 1 ms 856 KB Output is correct
19 Correct 1 ms 860 KB Output is correct
20 Correct 40 ms 6788 KB Output is correct
21 Correct 156 ms 24540 KB Output is correct
22 Correct 155 ms 24416 KB Output is correct
23 Correct 160 ms 24640 KB Output is correct
24 Correct 153 ms 24656 KB Output is correct
25 Correct 65 ms 14568 KB Output is correct
26 Correct 60 ms 14680 KB Output is correct
27 Correct 166 ms 24636 KB Output is correct
28 Correct 182 ms 24400 KB Output is correct
29 Correct 1 ms 860 KB Output is correct
30 Correct 0 ms 860 KB Output is correct
31 Correct 1 ms 860 KB Output is correct
32 Incorrect 1 ms 856 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -