oj.uz

Submission #301571

# Submission time Handle Problem Language Result Execution time Memory
301571 2020-09-18T04:44:50 Z jwvg0425 Connecting Supertrees (IOI20_supertrees) C++17
96 / 100
 264 ms 22392 KB 
#include "supertrees.h"
#include <vector>
#include <set>

using namespace std;

int cpar[1005];
int tpar[1005];
vector<int> byTree[1005];

int tfind(int x)
{
	if (tpar[x] == x)
		return x;

	return tpar[x] = tfind(tpar[x]);
}

void tmerge(int x, int y)
{
	x = tfind(x);
	y = tfind(y);

	tpar[x] = y;
}

int cfind(int x)
{
	if (cpar[x] == x)
		return x;

	return cpar[x] = cfind(cpar[x]);
}

void cmerge(int x, int y)
{
	x = cfind(x);
	y = cfind(y);

	cpar[x] = y;
}

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

	for (int i = 0; i < n; i++)
		cpar[i] = tpar[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 (p[i][j] == 1)
			{
				if (tfind(i) == tfind(j))
					continue;

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

			if (p[i][j] == 2)
				cmerge(i, j);
		}
	}

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

			if (p[i][j] == 1)
			{
				if (tfind(i) != tfind(j))
					return 0;
			}

			if (p[i][j] == 2)
			{
				if (cfind(i) != cfind(j) || tfind(i) == tfind(j))
					return 0;
			}
		}
	}

	for (int i = 0; i < n; i++)
	{
		if (cfind(i) != i)
			continue;

		vector<int> cs;
		set<int> ts;

		for (int j = 0; j < n; j++)
		{
			if (cfind(j) != i)
				continue;

			cs.push_back(j);
			ts.insert(tfind(j));
		}

		vector<int> tv;
		for (auto ti : ts)
		{
			tv.push_back(ti);

			for (auto &x : byTree[ti])
				for (auto &y : byTree[ti])
					if (p[x][y] != 1)
						return 0;

			for (auto &tj : ts)
			{
				if (ti == tj)
					continue;

				for (auto &x : byTree[ti])
					for (auto &y : byTree[tj])
						if (p[x][y] != 2)
							return 0;
			}
		}

		int k = tv.size();

		if (k <= 1)
			continue;

		if (k == 2)
			return 0;

		for (int x = 0; x < k; x++)
		{
			int nx = (x + 1) % k;
			answer[tv[x]][tv[nx]] = answer[tv[nx]][tv[x]] = 1;
		}
	}

	build(answer);
	return 1;
}

Subtask #1
11.0 / 11.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 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 10 ms 1280 KB Output is correct
7 Correct 247 ms 22264 KB Output is correct

Subtask #2
10.0 / 10.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 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 10 ms 1280 KB Output is correct
7 Correct 247 ms 22264 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 242 ms 22136 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 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 256 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 63 ms 5880 KB Output is correct
21 Correct 245 ms 22136 KB Output is correct
22 Correct 244 ms 22136 KB Output is correct
23 Correct 259 ms 22244 KB Output is correct
24 Correct 236 ms 22136 KB Output is correct
25 Correct 100 ms 12152 KB Output is correct
26 Correct 103 ms 12132 KB Output is correct
27 Correct 262 ms 22136 KB Output is correct
28 Correct 241 ms 22136 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 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 10 ms 1280 KB Output is correct
9 Correct 246 ms 22268 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 11 ms 1280 KB Output is correct
13 Correct 255 ms 22172 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 113 ms 12140 KB Output is correct
18 Correct 1 ms 512 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 66 ms 5856 KB Output is correct
22 Correct 239 ms 22108 KB Output is correct
23 Correct 244 ms 22120 KB Output is correct
24 Correct 261 ms 22392 KB Output is correct
25 Correct 105 ms 12152 KB Output is correct
26 Correct 101 ms 12152 KB Output is correct
27 Correct 241 ms 22136 KB Output is correct
28 Correct 259 ms 22120 KB Output is correct
29 Correct 103 ms 12280 KB Output is correct

Subtask #4
35.0 / 35.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 61 ms 5852 KB Output is correct
5 Correct 248 ms 22136 KB Output is correct
6 Correct 251 ms 22136 KB Output is correct
7 Correct 264 ms 22136 KB Output is correct
8 Correct 0 ms 512 KB Output is correct
9 Correct 61 ms 6008 KB Output is correct
10 Correct 245 ms 22236 KB Output is correct
11 Correct 240 ms 22136 KB Output is correct
12 Correct 257 ms 22204 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 63 ms 5880 KB Output is correct
17 Correct 252 ms 22116 KB Output is correct
18 Correct 248 ms 22136 KB Output is correct
19 Correct 249 ms 22240 KB Output is correct
20 Correct 249 ms 22264 KB Output is correct

Subtask #5
21.0 / 21.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 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 10 ms 1280 KB Output is correct
7 Correct 247 ms 22264 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 242 ms 22136 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 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 256 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 63 ms 5880 KB Output is correct
21 Correct 245 ms 22136 KB Output is correct
22 Correct 244 ms 22136 KB Output is correct
23 Correct 259 ms 22244 KB Output is correct
24 Correct 236 ms 22136 KB Output is correct
25 Correct 100 ms 12152 KB Output is correct
26 Correct 103 ms 12132 KB Output is correct
27 Correct 262 ms 22136 KB Output is correct
28 Correct 241 ms 22136 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 0 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 246 ms 22268 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 11 ms 1280 KB Output is correct
41 Correct 255 ms 22172 KB Output is correct
42 Correct 0 ms 384 KB Output is correct
43 Correct 0 ms 384 KB Output is correct
44 Correct 5 ms 768 KB Output is correct
45 Correct 113 ms 12140 KB Output is correct
46 Correct 1 ms 512 KB Output is correct
47 Correct 0 ms 384 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 66 ms 5856 KB Output is correct
50 Correct 239 ms 22108 KB Output is correct
51 Correct 244 ms 22120 KB Output is correct
52 Correct 261 ms 22392 KB Output is correct
53 Correct 105 ms 12152 KB Output is correct
54 Correct 101 ms 12152 KB Output is correct
55 Correct 241 ms 22136 KB Output is correct
56 Correct 259 ms 22120 KB Output is correct
57 Correct 103 ms 12280 KB Output is correct
58 Correct 0 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 5 ms 768 KB Output is correct
61 Correct 114 ms 12280 KB Output is correct
62 Correct 0 ms 384 KB Output is correct
63 Correct 0 ms 384 KB Output is correct
64 Correct 0 ms 384 KB Output is correct
65 Correct 80 ms 5880 KB Output is correct
66 Correct 101 ms 12152 KB Output is correct
67 Correct 107 ms 12208 KB Output is correct
68 Correct 99 ms 12152 KB Output is correct
69 Correct 101 ms 12152 KB Output is correct

Subtask #6
0 / 4.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 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 10 ms 1280 KB Output is correct
7 Correct 247 ms 22264 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 242 ms 22136 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 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 256 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 63 ms 5880 KB Output is correct
21 Correct 245 ms 22136 KB Output is correct
22 Correct 244 ms 22136 KB Output is correct
23 Correct 259 ms 22244 KB Output is correct
24 Correct 236 ms 22136 KB Output is correct
25 Correct 100 ms 12152 KB Output is correct
26 Correct 103 ms 12132 KB Output is correct
27 Correct 262 ms 22136 KB Output is correct
28 Correct 241 ms 22136 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 0 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 246 ms 22268 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 11 ms 1280 KB Output is correct
41 Correct 255 ms 22172 KB Output is correct
42 Correct 0 ms 384 KB Output is correct
43 Correct 0 ms 384 KB Output is correct
44 Correct 5 ms 768 KB Output is correct
45 Correct 113 ms 12140 KB Output is correct
46 Correct 1 ms 512 KB Output is correct
47 Correct 0 ms 384 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 66 ms 5856 KB Output is correct
50 Correct 239 ms 22108 KB Output is correct
51 Correct 244 ms 22120 KB Output is correct
52 Correct 261 ms 22392 KB Output is correct
53 Correct 105 ms 12152 KB Output is correct
54 Correct 101 ms 12152 KB Output is correct
55 Correct 241 ms 22136 KB Output is correct
56 Correct 259 ms 22120 KB Output is correct
57 Correct 103 ms 12280 KB Output is correct
58 Correct 0 ms 384 KB Output is correct
59 Correct 0 ms 384 KB Output is correct
60 Correct 0 ms 384 KB Output is correct
61 Correct 61 ms 5852 KB Output is correct
62 Correct 248 ms 22136 KB Output is correct
63 Correct 251 ms 22136 KB Output is correct
64 Correct 264 ms 22136 KB Output is correct
65 Correct 0 ms 512 KB Output is correct
66 Correct 61 ms 6008 KB Output is correct
67 Correct 245 ms 22236 KB Output is correct
68 Correct 240 ms 22136 KB Output is correct
69 Correct 257 ms 22204 KB Output is correct
70 Correct 0 ms 384 KB Output is correct
71 Correct 0 ms 384 KB Output is correct
72 Correct 0 ms 384 KB Output is correct
73 Correct 63 ms 5880 KB Output is correct
74 Correct 252 ms 22116 KB Output is correct
75 Correct 248 ms 22136 KB Output is correct
76 Correct 249 ms 22240 KB Output is correct
77 Correct 249 ms 22264 KB Output is correct
78 Correct 0 ms 384 KB Output is correct
79 Correct 1 ms 384 KB Output is correct
80 Correct 5 ms 768 KB Output is correct
81 Correct 114 ms 12280 KB Output is correct
82 Correct 0 ms 384 KB Output is correct
83 Correct 0 ms 384 KB Output is correct
84 Correct 0 ms 384 KB Output is correct
85 Correct 80 ms 5880 KB Output is correct
86 Correct 101 ms 12152 KB Output is correct
87 Correct 107 ms 12208 KB Output is correct
88 Correct 99 ms 12152 KB Output is correct
89 Correct 101 ms 12152 KB Output is correct
90 Correct 0 ms 384 KB Output is correct
91 Correct 1 ms 384 KB Output is correct
92 Correct 7 ms 768 KB Output is correct
93 Correct 112 ms 12152 KB Output is correct
94 Incorrect 0 ms 384 KB Answer gives possible 1 while actual possible 0
95 Halted 0 ms 0 KB -