oj.uz

답안 #795183

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
795183 2023-07-27T07:21:23 Z adrilen 슈퍼트리 잇기 (IOI20_supertrees) C++17
96 / 100
 215 ms 28060 KB 
#include "supertrees.h"
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using arr = array<int, 2>;
using arrr = array<int, 3>;

constexpr int maxn = 1e3 + 5;

int next_group = 1;
int groups[maxn] = { 0 }, gnode[maxn] = { 0 }, siz[maxn] = { 0 };
bool done[maxn] = { 0 };

vector <int> adj[maxn];


int construct(std::vector<std::vector<int>> p) {

	int g;
	int n = p.size();

	vector<vector<int>> output(n, vector<int>(n));


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

		g = next_group++;

		vector<int> clique = { i };

		for (int y = i + 1; y < n; y++)
		{
			if (p[i][y] == 1) clique.emplace_back(y);
		}
		gnode[g] = i;

		for (int y : clique) {
			groups[y] = g;

			if (p[y] != p[gnode[g]]) goto impossible;
		}

		for (int i = 1; i < (int)clique.size(); i++)
		{
			output[clique[i]][clique[i - 1]] = output[clique[i - 1]][clique[i]] = 1;
		}

		siz[g] = clique.size();

		set <int> seen;
		for (int y = 0; y < i; y++)
		{
			if (p[i][y] != 0 && seen.count(groups[y]) == 0) {
				adj[g].push_back(groups[y]);
				seen.insert(groups[y]);
				adj[groups[y]].push_back(g);
			}
		}
	}

	// cerr << "Groups complete\n";

	// Combining groups
	// in each connected component, there must be either 2, 3, or none, but not both

	for (int i = 1; i < next_group; i++)
	{
		if (done[i]) continue;

		vector<int> gs = adj[i];
		gs.insert(gs.begin(), i);

		vector<int> twos, threes, ones;

		if (gs.size() == 1) continue;
		// cout << i << "\n";
		// for (int y : gs) cout << y << " ";
		// cout << "\n";

		for (int x : gs)
		{
			vector<int> test = adj[x];

			test.insert(lower_bound(test.begin(), test.end(), x), x);

			if (test != gs) goto impossible;



			done[x] = true;
			int one = 0;
			bool two, three;
			two = three = false;

			for (int y : p[gnode[x]])
			{
				if (y == 1) one ++;
				else if (y == 2) two = true;
				else if (y == 3) three = true;
			}
			
			if (two && three) goto impossible;
			
			if (two) twos.emplace_back(x);
			else if (three) threes.emplace_back(x);
		}

		// cout << "Counting finished\n";

		// cerr << ones.size() << " " << twos.size() << " " << threes.size() << " \n";

		if (threes.empty())
		{
			// Twos

			if (gs.size() < 3) goto impossible;

			// Make a cycle
			for (int y = 0; y < (int)gs.size() - 1; y++)
			{
				output[gnode[gs[y]]][gnode[gs[y + 1]]] = output[gnode[gs[y + 1]]][gnode[gs[y]]] = 1;
			}
			output[gnode[gs[0]]][gnode[gs[gs.size() - 1]]] = output[gnode[gs[gs.size() - 1]]][gnode[gs[0]]] = 1;
		}

		if (twos.empty() && !threes.empty())
		{
			if (gs.size() < 4) goto impossible;

			for (int y = 0; y < (int)gs.size() - 1; y++) {
				output[gnode[gs[y]]][gnode[gs[y + 1]]] = output[gnode[gs[y + 1]]][gnode[gs[y]]] = 1;
			}
			output[gnode[gs[0]]][gnode[gs[gs.size() - 1]]] = output[gnode[gs[gs.size() - 1]]][gnode[gs[0]]] = 1;
			output[gnode[gs[0]]][gnode[gs[2]]] = output[gnode[gs[2]]][gnode[gs[0]]] = 1;

		}
	}


	
	// Build
	build(output);
	return 1;


	impossible:

	return 0;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 6 ms 1236 KB Output is correct
7 Correct 165 ms 22636 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 6 ms 1236 KB Output is correct
7 Correct 165 ms 22636 KB Output is correct
8 Correct 1 ms 376 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 7 ms 1236 KB Output is correct
13 Correct 157 ms 22660 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 3 ms 852 KB Output is correct
17 Correct 65 ms 12792 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 53 ms 6008 KB Output is correct
21 Correct 150 ms 22648 KB Output is correct
22 Correct 150 ms 22712 KB Output is correct
23 Correct 155 ms 22712 KB Output is correct
24 Correct 152 ms 22616 KB Output is correct
25 Correct 59 ms 12692 KB Output is correct
26 Correct 59 ms 12700 KB Output is correct
27 Correct 176 ms 22700 KB Output is correct
28 Correct 151 ms 22644 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 324 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 7 ms 1280 KB Output is correct
9 Correct 185 ms 22600 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 8 ms 1492 KB Output is correct
13 Correct 195 ms 26696 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 4 ms 980 KB Output is correct
17 Correct 95 ms 15116 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 40 ms 6024 KB Output is correct
22 Correct 163 ms 22832 KB Output is correct
23 Correct 157 ms 22320 KB Output is correct
24 Correct 175 ms 25580 KB Output is correct
25 Correct 73 ms 12320 KB Output is correct
26 Correct 64 ms 12980 KB Output is correct
27 Correct 160 ms 22340 KB Output is correct
28 Correct 215 ms 24396 KB Output is correct
29 Correct 77 ms 12436 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 42 ms 6048 KB Output is correct
5 Correct 170 ms 22608 KB Output is correct
6 Correct 170 ms 22656 KB Output is correct
7 Correct 164 ms 22712 KB Output is correct
8 Correct 1 ms 356 KB Output is correct
9 Correct 43 ms 6112 KB Output is correct
10 Correct 157 ms 23256 KB Output is correct
11 Correct 152 ms 22700 KB Output is correct
12 Correct 199 ms 25980 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 39 ms 6080 KB Output is correct
17 Correct 162 ms 23264 KB Output is correct
18 Correct 194 ms 22956 KB Output is correct
19 Correct 169 ms 22808 KB Output is correct
20 Correct 156 ms 22620 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 6 ms 1236 KB Output is correct
7 Correct 165 ms 22636 KB Output is correct
8 Correct 1 ms 376 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 7 ms 1236 KB Output is correct
13 Correct 157 ms 22660 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 3 ms 852 KB Output is correct
17 Correct 65 ms 12792 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 53 ms 6008 KB Output is correct
21 Correct 150 ms 22648 KB Output is correct
22 Correct 150 ms 22712 KB Output is correct
23 Correct 155 ms 22712 KB Output is correct
24 Correct 152 ms 22616 KB Output is correct
25 Correct 59 ms 12692 KB Output is correct
26 Correct 59 ms 12700 KB Output is correct
27 Correct 176 ms 22700 KB Output is correct
28 Correct 151 ms 22644 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 324 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 328 KB Output is correct
36 Correct 7 ms 1280 KB Output is correct
37 Correct 185 ms 22600 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 8 ms 1492 KB Output is correct
41 Correct 195 ms 26696 KB Output is correct
42 Correct 0 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 4 ms 980 KB Output is correct
45 Correct 95 ms 15116 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 328 KB Output is correct
48 Correct 1 ms 328 KB Output is correct
49 Correct 40 ms 6024 KB Output is correct
50 Correct 163 ms 22832 KB Output is correct
51 Correct 157 ms 22320 KB Output is correct
52 Correct 175 ms 25580 KB Output is correct
53 Correct 73 ms 12320 KB Output is correct
54 Correct 64 ms 12980 KB Output is correct
55 Correct 160 ms 22340 KB Output is correct
56 Correct 215 ms 24396 KB Output is correct
57 Correct 77 ms 12436 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 4 ms 852 KB Output is correct
61 Correct 75 ms 12396 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 1 ms 340 KB Output is correct
65 Correct 50 ms 6048 KB Output is correct
66 Correct 61 ms 12672 KB Output is correct
67 Correct 70 ms 12576 KB Output is correct
68 Correct 63 ms 12596 KB Output is correct
69 Correct 65 ms 12584 KB Output is correct

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 6 ms 1236 KB Output is correct
7 Correct 165 ms 22636 KB Output is correct
8 Correct 1 ms 376 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 7 ms 1236 KB Output is correct
13 Correct 157 ms 22660 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 3 ms 852 KB Output is correct
17 Correct 65 ms 12792 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 53 ms 6008 KB Output is correct
21 Correct 150 ms 22648 KB Output is correct
22 Correct 150 ms 22712 KB Output is correct
23 Correct 155 ms 22712 KB Output is correct
24 Correct 152 ms 22616 KB Output is correct
25 Correct 59 ms 12692 KB Output is correct
26 Correct 59 ms 12700 KB Output is correct
27 Correct 176 ms 22700 KB Output is correct
28 Correct 151 ms 22644 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 324 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 328 KB Output is correct
36 Correct 7 ms 1280 KB Output is correct
37 Correct 185 ms 22600 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 8 ms 1492 KB Output is correct
41 Correct 195 ms 26696 KB Output is correct
42 Correct 0 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 4 ms 980 KB Output is correct
45 Correct 95 ms 15116 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 328 KB Output is correct
48 Correct 1 ms 328 KB Output is correct
49 Correct 40 ms 6024 KB Output is correct
50 Correct 163 ms 22832 KB Output is correct
51 Correct 157 ms 22320 KB Output is correct
52 Correct 175 ms 25580 KB Output is correct
53 Correct 73 ms 12320 KB Output is correct
54 Correct 64 ms 12980 KB Output is correct
55 Correct 160 ms 22340 KB Output is correct
56 Correct 215 ms 24396 KB Output is correct
57 Correct 77 ms 12436 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 324 KB Output is correct
60 Correct 1 ms 328 KB Output is correct
61 Correct 42 ms 6048 KB Output is correct
62 Correct 170 ms 22608 KB Output is correct
63 Correct 170 ms 22656 KB Output is correct
64 Correct 164 ms 22712 KB Output is correct
65 Correct 1 ms 356 KB Output is correct
66 Correct 43 ms 6112 KB Output is correct
67 Correct 157 ms 23256 KB Output is correct
68 Correct 152 ms 22700 KB Output is correct
69 Correct 199 ms 25980 KB Output is correct
70 Correct 1 ms 340 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 1 ms 212 KB Output is correct
73 Correct 39 ms 6080 KB Output is correct
74 Correct 162 ms 23264 KB Output is correct
75 Correct 194 ms 22956 KB Output is correct
76 Correct 169 ms 22808 KB Output is correct
77 Correct 156 ms 22620 KB Output is correct
78 Correct 1 ms 212 KB Output is correct
79 Correct 1 ms 212 KB Output is correct
80 Correct 4 ms 852 KB Output is correct
81 Correct 75 ms 12396 KB Output is correct
82 Correct 1 ms 340 KB Output is correct
83 Correct 1 ms 340 KB Output is correct
84 Correct 1 ms 340 KB Output is correct
85 Correct 50 ms 6048 KB Output is correct
86 Correct 61 ms 12672 KB Output is correct
87 Correct 70 ms 12576 KB Output is correct
88 Correct 63 ms 12596 KB Output is correct
89 Correct 65 ms 12584 KB Output is correct
90 Correct 1 ms 340 KB Output is correct
91 Correct 1 ms 328 KB Output is correct
92 Correct 3 ms 852 KB Output is correct
93 Correct 64 ms 12616 KB Output is correct
94 Correct 0 ms 212 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 1 ms 340 KB Output is correct
97 Correct 16 ms 3532 KB Output is correct
98 Correct 65 ms 13116 KB Output is correct
99 Correct 62 ms 12568 KB Output is correct
100 Correct 85 ms 12576 KB Output is correct
101 Correct 60 ms 12676 KB Output is correct
102 Incorrect 203 ms 28060 KB Answer gives possible 1 while actual possible 0
103 Halted 0 ms 0 KB -