답안 #795416

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
795416	2023-07-27T09:21:02 Z	adrilen	슈퍼트리 잇기 (IOI20_supertrees)	C++17	96 / 100	216 ms	27640 KB

supertrees

#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 };
bool done[maxn] = { 0 };

vector <int> adj[2][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[i]) goto impossible;
		}

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

		set <int> seen;
		for (int y = 0; y < i; y++)
		{
			if (seen.count(groups[y])) continue;

			if (p[i][y] == 2) {
				adj[0][g].push_back(groups[y]);
				adj[0][groups[y]].push_back(g);
			}
			if (p[i][y] == 3) {
				adj[1][g].push_back(groups[y]);
				adj[1][groups[y]].push_back(g);
			}
			seen.insert(groups[y]);
		}
	}


	// 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;

		if (!adj[0][i].empty() && !adj[1][i].empty()) goto impossible;

		int t;
		if (!adj[0][i].empty()) t = 0;
		else t = 1;
		
		
		vector<int> gs = adj[t][i];
		gs.insert(gs.begin(), i);

		if (gs.size() == 1) continue;
		if (gs.size() == 2) goto impossible;

		for (int x : gs)
		{
			if (!adj[t ^ 1][x].empty()) goto impossible;

			vector<int> test = adj[t][x];
			test.insert(lower_bound(test.begin(), test.end(), x), x);

			if (test != gs) goto impossible;

			assert(!done[x]);
			done[x] = true;
		}

		// 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 (t == 0)
		{
			if (gs.size() < 3) goto impossible;
		}
		else
		{
			if (gs.size() < 4) goto impossible;

			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	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	352 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	8 ms	1236 KB	Output is correct
7	Correct	187 ms	23460 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	352 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	8 ms	1236 KB	Output is correct
7	Correct	187 ms	23460 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	352 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	9 ms	1208 KB	Output is correct
13	Correct	216 ms	23484 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	3 ms	872 KB	Output is correct
17	Correct	79 ms	13656 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	40 ms	6248 KB	Output is correct
21	Correct	152 ms	23464 KB	Output is correct
22	Correct	160 ms	23528 KB	Output is correct
23	Correct	166 ms	23524 KB	Output is correct
24	Correct	190 ms	23464 KB	Output is correct
25	Correct	64 ms	13628 KB	Output is correct
26	Correct	72 ms	13580 KB	Output is correct
27	Correct	157 ms	23456 KB	Output is correct
28	Correct	185 ms	23520 KB	Output is correct

Subtask #3
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	356 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	352 KB	Output is correct
7	Correct	1 ms	356 KB	Output is correct
8	Correct	10 ms	1316 KB	Output is correct
9	Correct	202 ms	23524 KB	Output is correct
10	Correct	1 ms	352 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	12 ms	1536 KB	Output is correct
13	Correct	197 ms	27640 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	352 KB	Output is correct
16	Correct	5 ms	980 KB	Output is correct
17	Correct	125 ms	16200 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	48 ms	6304 KB	Output is correct
22	Correct	189 ms	23952 KB	Output is correct
23	Correct	200 ms	23400 KB	Output is correct
24	Correct	212 ms	26676 KB	Output is correct
25	Correct	94 ms	13500 KB	Output is correct
26	Correct	95 ms	13948 KB	Output is correct
27	Correct	212 ms	23472 KB	Output is correct
28	Correct	197 ms	25428 KB	Output is correct
29	Correct	96 ms	13592 KB	Output is correct

Subtask #4
35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	38 ms	6268 KB	Output is correct
5	Correct	152 ms	23480 KB	Output is correct
6	Correct	194 ms	23520 KB	Output is correct
7	Correct	156 ms	23532 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	45 ms	6372 KB	Output is correct
10	Correct	194 ms	24152 KB	Output is correct
11	Correct	186 ms	23568 KB	Output is correct
12	Correct	197 ms	26804 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	43 ms	6276 KB	Output is correct
17	Correct	212 ms	24072 KB	Output is correct
18	Correct	164 ms	23868 KB	Output is correct
19	Correct	175 ms	23688 KB	Output is correct
20	Correct	197 ms	23620 KB	Output is correct

Subtask #5
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	352 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	8 ms	1236 KB	Output is correct
7	Correct	187 ms	23460 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	352 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	9 ms	1208 KB	Output is correct
13	Correct	216 ms	23484 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	3 ms	872 KB	Output is correct
17	Correct	79 ms	13656 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	40 ms	6248 KB	Output is correct
21	Correct	152 ms	23464 KB	Output is correct
22	Correct	160 ms	23528 KB	Output is correct
23	Correct	166 ms	23524 KB	Output is correct
24	Correct	190 ms	23464 KB	Output is correct
25	Correct	64 ms	13628 KB	Output is correct
26	Correct	72 ms	13580 KB	Output is correct
27	Correct	157 ms	23456 KB	Output is correct
28	Correct	185 ms	23520 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	356 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	1 ms	352 KB	Output is correct
35	Correct	1 ms	356 KB	Output is correct
36	Correct	10 ms	1316 KB	Output is correct
37	Correct	202 ms	23524 KB	Output is correct
38	Correct	1 ms	352 KB	Output is correct
39	Correct	1 ms	340 KB	Output is correct
40	Correct	12 ms	1536 KB	Output is correct
41	Correct	197 ms	27640 KB	Output is correct
42	Correct	1 ms	340 KB	Output is correct
43	Correct	1 ms	352 KB	Output is correct
44	Correct	5 ms	980 KB	Output is correct
45	Correct	125 ms	16200 KB	Output is correct
46	Correct	1 ms	348 KB	Output is correct
47	Correct	1 ms	340 KB	Output is correct
48	Correct	1 ms	340 KB	Output is correct
49	Correct	48 ms	6304 KB	Output is correct
50	Correct	189 ms	23952 KB	Output is correct
51	Correct	200 ms	23400 KB	Output is correct
52	Correct	212 ms	26676 KB	Output is correct
53	Correct	94 ms	13500 KB	Output is correct
54	Correct	95 ms	13948 KB	Output is correct
55	Correct	212 ms	23472 KB	Output is correct
56	Correct	197 ms	25428 KB	Output is correct
57	Correct	96 ms	13592 KB	Output is correct
58	Correct	1 ms	340 KB	Output is correct
59	Correct	1 ms	352 KB	Output is correct
60	Correct	4 ms	848 KB	Output is correct
61	Correct	65 ms	13436 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	43 ms	6284 KB	Output is correct
66	Correct	76 ms	13616 KB	Output is correct
67	Correct	66 ms	13592 KB	Output is correct
68	Correct	64 ms	13576 KB	Output is correct
69	Correct	91 ms	13620 KB	Output is correct

Subtask #6
0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	352 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	8 ms	1236 KB	Output is correct
7	Correct	187 ms	23460 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	352 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	9 ms	1208 KB	Output is correct
13	Correct	216 ms	23484 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	3 ms	872 KB	Output is correct
17	Correct	79 ms	13656 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	40 ms	6248 KB	Output is correct
21	Correct	152 ms	23464 KB	Output is correct
22	Correct	160 ms	23528 KB	Output is correct
23	Correct	166 ms	23524 KB	Output is correct
24	Correct	190 ms	23464 KB	Output is correct
25	Correct	64 ms	13628 KB	Output is correct
26	Correct	72 ms	13580 KB	Output is correct
27	Correct	157 ms	23456 KB	Output is correct
28	Correct	185 ms	23520 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	356 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	1 ms	352 KB	Output is correct
35	Correct	1 ms	356 KB	Output is correct
36	Correct	10 ms	1316 KB	Output is correct
37	Correct	202 ms	23524 KB	Output is correct
38	Correct	1 ms	352 KB	Output is correct
39	Correct	1 ms	340 KB	Output is correct
40	Correct	12 ms	1536 KB	Output is correct
41	Correct	197 ms	27640 KB	Output is correct
42	Correct	1 ms	340 KB	Output is correct
43	Correct	1 ms	352 KB	Output is correct
44	Correct	5 ms	980 KB	Output is correct
45	Correct	125 ms	16200 KB	Output is correct
46	Correct	1 ms	348 KB	Output is correct
47	Correct	1 ms	340 KB	Output is correct
48	Correct	1 ms	340 KB	Output is correct
49	Correct	48 ms	6304 KB	Output is correct
50	Correct	189 ms	23952 KB	Output is correct
51	Correct	200 ms	23400 KB	Output is correct
52	Correct	212 ms	26676 KB	Output is correct
53	Correct	94 ms	13500 KB	Output is correct
54	Correct	95 ms	13948 KB	Output is correct
55	Correct	212 ms	23472 KB	Output is correct
56	Correct	197 ms	25428 KB	Output is correct
57	Correct	96 ms	13592 KB	Output is correct
58	Correct	1 ms	340 KB	Output is correct
59	Correct	1 ms	340 KB	Output is correct
60	Correct	0 ms	340 KB	Output is correct
61	Correct	38 ms	6268 KB	Output is correct
62	Correct	152 ms	23480 KB	Output is correct
63	Correct	194 ms	23520 KB	Output is correct
64	Correct	156 ms	23532 KB	Output is correct
65	Correct	1 ms	340 KB	Output is correct
66	Correct	45 ms	6372 KB	Output is correct
67	Correct	194 ms	24152 KB	Output is correct
68	Correct	186 ms	23568 KB	Output is correct
69	Correct	197 ms	26804 KB	Output is correct
70	Correct	1 ms	340 KB	Output is correct
71	Correct	1 ms	340 KB	Output is correct
72	Correct	1 ms	348 KB	Output is correct
73	Correct	43 ms	6276 KB	Output is correct
74	Correct	212 ms	24072 KB	Output is correct
75	Correct	164 ms	23868 KB	Output is correct
76	Correct	175 ms	23688 KB	Output is correct
77	Correct	197 ms	23620 KB	Output is correct
78	Correct	1 ms	340 KB	Output is correct
79	Correct	1 ms	352 KB	Output is correct
80	Correct	4 ms	848 KB	Output is correct
81	Correct	65 ms	13436 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	43 ms	6284 KB	Output is correct
86	Correct	76 ms	13616 KB	Output is correct
87	Correct	66 ms	13592 KB	Output is correct
88	Correct	64 ms	13576 KB	Output is correct
89	Correct	91 ms	13620 KB	Output is correct
90	Correct	1 ms	340 KB	Output is correct
91	Correct	1 ms	340 KB	Output is correct
92	Correct	3 ms	876 KB	Output is correct
93	Correct	74 ms	13580 KB	Output is correct
94	Correct	1 ms	340 KB	Output is correct
95	Correct	1 ms	340 KB	Output is correct
96	Correct	1 ms	348 KB	Output is correct
97	Correct	23 ms	3748 KB	Output is correct
98	Correct	97 ms	14176 KB	Output is correct
99	Correct	67 ms	13584 KB	Output is correct
100	Correct	67 ms	13532 KB	Output is correct
101	Correct	99 ms	13616 KB	Output is correct
102	Incorrect	197 ms	27216 KB	Answer gives possible 1 while actual possible 0
103	Halted	0 ms	0 KB	-

답안 #795416

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 10.0 / 10.0

Subtask #3 19.0 / 19.0

Subtask #4 35.0 / 35.0

Subtask #5 21.0 / 21.0

Subtask #6 0 / 4.0

Subtask #1
11.0 / 11.0

Subtask #2
10.0 / 10.0

Subtask #3
19.0 / 19.0

Subtask #4
35.0 / 35.0

Subtask #5
21.0 / 21.0

Subtask #6
0 / 4.0