oj.uz

답안 #301585

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
301585 2020-09-18T05:01:57 Z jwvg0425 슈퍼트리 잇기 (IOI20_supertrees) C++17
96 / 100
 269 ms 22408 KB 
#include "supertrees.h"
#include <vector>
#include <set>

using namespace std;

int cpar[1005];
int tpar[1005];
vector<int> byTree[1005];
set<int> cv[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++)
	{
		byTree[tfind(i)].push_back(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;

				cv[cfind(i)].insert(p[i][j]);
			}
		}
	}

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

		set<int> ts;

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

			ts.insert(tfind(j));
		}

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

		int k = tv.size();

		if (k <= 1)
			continue;

		if (cv[i].size() >= 2 || *cv[i].begin() < 2)
			return 0;

		if (k <= *cv[i].begin())
			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;
		}

		if (*cv[i].begin() == 3)
			answer[tv[0]][tv[2]] = answer[tv[2]][tv[0]] = 1;
	}

	build(answer);
	return 1;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 416 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 22392 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 416 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 22392 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 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 234 ms 22136 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 512 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 108 ms 12280 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 60 ms 5880 KB Output is correct
21 Correct 237 ms 22136 KB Output is correct
22 Correct 236 ms 22264 KB Output is correct
23 Correct 257 ms 22264 KB Output is correct
24 Correct 237 ms 22292 KB Output is correct
25 Correct 98 ms 12280 KB Output is correct
26 Correct 96 ms 12280 KB Output is correct
27 Correct 256 ms 22264 KB Output is correct
28 Correct 235 ms 22392 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 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 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 10 ms 1280 KB Output is correct
9 Correct 234 ms 22160 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 11 ms 1280 KB Output is correct
13 Correct 262 ms 22168 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 7 ms 1024 KB Output is correct
17 Correct 110 ms 12280 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 448 KB Output is correct
21 Correct 62 ms 5940 KB Output is correct
22 Correct 246 ms 22136 KB Output is correct
23 Correct 251 ms 22384 KB Output is correct
24 Correct 257 ms 22164 KB Output is correct
25 Correct 97 ms 12284 KB Output is correct
26 Correct 103 ms 12280 KB Output is correct
27 Correct 262 ms 22408 KB Output is correct
28 Correct 263 ms 22136 KB Output is correct
29 Correct 100 ms 12408 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 61 ms 5880 KB Output is correct
5 Correct 246 ms 22264 KB Output is correct
6 Correct 236 ms 22136 KB Output is correct
7 Correct 255 ms 22136 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 60 ms 5880 KB Output is correct
10 Correct 245 ms 22264 KB Output is correct
11 Correct 235 ms 22136 KB Output is correct
12 Correct 253 ms 22136 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 60 ms 5880 KB Output is correct
17 Correct 253 ms 22264 KB Output is correct
18 Correct 250 ms 22264 KB Output is correct
19 Correct 251 ms 22136 KB Output is correct
20 Correct 246 ms 22264 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 416 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 22392 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 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 234 ms 22136 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 512 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 108 ms 12280 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 60 ms 5880 KB Output is correct
21 Correct 237 ms 22136 KB Output is correct
22 Correct 236 ms 22264 KB Output is correct
23 Correct 257 ms 22264 KB Output is correct
24 Correct 237 ms 22292 KB Output is correct
25 Correct 98 ms 12280 KB Output is correct
26 Correct 96 ms 12280 KB Output is correct
27 Correct 256 ms 22264 KB Output is correct
28 Correct 235 ms 22392 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 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 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 234 ms 22160 KB Output is correct
38 Correct 1 ms 512 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 11 ms 1280 KB Output is correct
41 Correct 262 ms 22168 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 7 ms 1024 KB Output is correct
45 Correct 110 ms 12280 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 448 KB Output is correct
49 Correct 62 ms 5940 KB Output is correct
50 Correct 246 ms 22136 KB Output is correct
51 Correct 251 ms 22384 KB Output is correct
52 Correct 257 ms 22164 KB Output is correct
53 Correct 97 ms 12284 KB Output is correct
54 Correct 103 ms 12280 KB Output is correct
55 Correct 262 ms 22408 KB Output is correct
56 Correct 263 ms 22136 KB Output is correct
57 Correct 100 ms 12408 KB Output is correct
58 Correct 1 ms 360 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 5 ms 896 KB Output is correct
61 Correct 111 ms 12280 KB Output is correct
62 Correct 0 ms 384 KB Output is correct
63 Correct 1 ms 384 KB Output is correct
64 Correct 1 ms 512 KB Output is correct
65 Correct 60 ms 5880 KB Output is correct
66 Correct 102 ms 12280 KB Output is correct
67 Correct 133 ms 12280 KB Output is correct
68 Correct 100 ms 12280 KB Output is correct
69 Correct 106 ms 12284 KB Output is correct

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 416 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 22392 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 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 234 ms 22136 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 512 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 108 ms 12280 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 60 ms 5880 KB Output is correct
21 Correct 237 ms 22136 KB Output is correct
22 Correct 236 ms 22264 KB Output is correct
23 Correct 257 ms 22264 KB Output is correct
24 Correct 237 ms 22292 KB Output is correct
25 Correct 98 ms 12280 KB Output is correct
26 Correct 96 ms 12280 KB Output is correct
27 Correct 256 ms 22264 KB Output is correct
28 Correct 235 ms 22392 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 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 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 234 ms 22160 KB Output is correct
38 Correct 1 ms 512 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 11 ms 1280 KB Output is correct
41 Correct 262 ms 22168 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 7 ms 1024 KB Output is correct
45 Correct 110 ms 12280 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 448 KB Output is correct
49 Correct 62 ms 5940 KB Output is correct
50 Correct 246 ms 22136 KB Output is correct
51 Correct 251 ms 22384 KB Output is correct
52 Correct 257 ms 22164 KB Output is correct
53 Correct 97 ms 12284 KB Output is correct
54 Correct 103 ms 12280 KB Output is correct
55 Correct 262 ms 22408 KB Output is correct
56 Correct 263 ms 22136 KB Output is correct
57 Correct 100 ms 12408 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 0 ms 384 KB Output is correct
61 Correct 61 ms 5880 KB Output is correct
62 Correct 246 ms 22264 KB Output is correct
63 Correct 236 ms 22136 KB Output is correct
64 Correct 255 ms 22136 KB Output is correct
65 Correct 0 ms 384 KB Output is correct
66 Correct 60 ms 5880 KB Output is correct
67 Correct 245 ms 22264 KB Output is correct
68 Correct 235 ms 22136 KB Output is correct
69 Correct 253 ms 22136 KB Output is correct
70 Correct 0 ms 384 KB Output is correct
71 Correct 1 ms 384 KB Output is correct
72 Correct 1 ms 384 KB Output is correct
73 Correct 60 ms 5880 KB Output is correct
74 Correct 253 ms 22264 KB Output is correct
75 Correct 250 ms 22264 KB Output is correct
76 Correct 251 ms 22136 KB Output is correct
77 Correct 246 ms 22264 KB Output is correct
78 Correct 1 ms 360 KB Output is correct
79 Correct 1 ms 384 KB Output is correct
80 Correct 5 ms 896 KB Output is correct
81 Correct 111 ms 12280 KB Output is correct
82 Correct 0 ms 384 KB Output is correct
83 Correct 1 ms 384 KB Output is correct
84 Correct 1 ms 512 KB Output is correct
85 Correct 60 ms 5880 KB Output is correct
86 Correct 102 ms 12280 KB Output is correct
87 Correct 133 ms 12280 KB Output is correct
88 Correct 100 ms 12280 KB Output is correct
89 Correct 106 ms 12284 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 896 KB Output is correct
93 Correct 114 ms 12280 KB Output is correct
94 Correct 1 ms 384 KB Output is correct
95 Correct 1 ms 384 KB Output is correct
96 Correct 1 ms 416 KB Output is correct
97 Correct 26 ms 3320 KB Output is correct
98 Correct 97 ms 12312 KB Output is correct
99 Correct 104 ms 12180 KB Output is correct
100 Correct 97 ms 12280 KB Output is correct
101 Correct 114 ms 12312 KB Output is correct
102 Incorrect 269 ms 22164 KB Answer gives possible 1 while actual possible 0
103 Halted 0 ms 0 KB -