oj.uz

Submission #301554

# Submission time Handle Problem Language Result Execution time Memory
301554 2020-09-18T04:19:32 Z jwvg0425 Connecting Supertrees (IOI20_supertrees) C++17
21 / 100
 266 ms 22244 KB 
#include "supertrees.h"
#include <vector>

using namespace std;

int par[1005];

int find(int x)
{
	if (par[x] == x)
		return x;

	return par[x] = find(par[x]);
}

void merge(int x, int y)
{
	x = find(x);
	y = find(y);

	par[x] = y;
}

int construct(vector<vector<int>> p)
{
	int n = p.size();

	for (int i = 0; i < n; i++)
		par[i] = i;

	vector<vector<int>> answer;
	for (int i = 0; i < n; i++)
	{
		vector<int> row;
		row.resize(n);
		answer.push_back(row);
	}

	for (int i = 0; i < n; i++)
	{
		for (int j = i + 1; j < n; j++)
		{
			if (p[i][j] == 0)
				continue;

			if (find(i) == find(j))
				continue;

			merge(i, j);
			answer[i][j] = answer[j][i] = 1;
		}
	}

	for (int i = 0; i < n; i++)
	{
		for (int j = i + 1; j < n; j++)
		{
			if ((p[i][j] == 0 && find(i) == find(j)) ||
				(p[i][j] == 1 && find(i) != find(j)))
				return 0;
		}
	}

	build(answer);
	return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 11 ms 1152 KB Output is correct
7 Correct 255 ms 22136 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 11 ms 1152 KB Output is correct
7 Correct 255 ms 22136 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 10 ms 1152 KB Output is correct
13 Correct 236 ms 22136 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 111 ms 12152 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 61 ms 5880 KB Output is correct
21 Correct 248 ms 22244 KB Output is correct
22 Correct 245 ms 22096 KB Output is correct
23 Correct 266 ms 22136 KB Output is correct
24 Correct 253 ms 22140 KB Output is correct
25 Correct 102 ms 12152 KB Output is correct
26 Correct 106 ms 12108 KB Output is correct
27 Correct 259 ms 22208 KB Output is correct
28 Correct 243 ms 22040 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 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
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Incorrect 1 ms 256 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 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 11 ms 1152 KB Output is correct
7 Correct 255 ms 22136 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 10 ms 1152 KB Output is correct
13 Correct 236 ms 22136 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 111 ms 12152 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 61 ms 5880 KB Output is correct
21 Correct 248 ms 22244 KB Output is correct
22 Correct 245 ms 22096 KB Output is correct
23 Correct 266 ms 22136 KB Output is correct
24 Correct 253 ms 22140 KB Output is correct
25 Correct 102 ms 12152 KB Output is correct
26 Correct 106 ms 12108 KB Output is correct
27 Correct 259 ms 22208 KB Output is correct
28 Correct 243 ms 22040 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 0 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 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 11 ms 1152 KB Output is correct
7 Correct 255 ms 22136 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 10 ms 1152 KB Output is correct
13 Correct 236 ms 22136 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 111 ms 12152 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 61 ms 5880 KB Output is correct
21 Correct 248 ms 22244 KB Output is correct
22 Correct 245 ms 22096 KB Output is correct
23 Correct 266 ms 22136 KB Output is correct
24 Correct 253 ms 22140 KB Output is correct
25 Correct 102 ms 12152 KB Output is correct
26 Correct 106 ms 12108 KB Output is correct
27 Correct 259 ms 22208 KB Output is correct
28 Correct 243 ms 22040 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 0 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 -