답안 #300350

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
300350	2020-09-17T05:45:21 Z	Elegia	슈퍼트리 잇기 (IOI20_supertrees)	C++17	96 / 100	262 ms	22264 KB

supertrees

#include "supertrees.h"
#include <functional>
#include <vector>
#include <iostream>

using namespace std;

int construct(vector<vector<int>> p) {
	int n = p.size();
	vector<vector<int>> answer(n, vector<int>(n));
	vector<int> vis(n, -1);
	int cur = 0, mask = 0;
	function<void(int)> dfs = [&](int u) {
		vis[u] = cur;
		for (int v = 0; v < n; ++v)
			if (vis[v] == -1 && ((mask >> p[u][v]) & 1))
				dfs(v);
	};
	mask = 14;
	for (int i = 0; i < n; ++i)
		if (vis[i] == -1) {
			cur = i;
			dfs(i);
		}
	for (int i = 0; i < n; ++i)
		for (int j = 0; j < n; ++j)
			if (vis[i] == vis[j] && !p[i][j])
				return 0;
	mask = 2;
	auto vis2 = vis;
	vis.assign(n, -1);
	for (int i = 0; i < n; ++i)
		if (vis[i] == -1) {
			cur = i;
			dfs(i);
		}
	for (int i = 0; i < n; ++i)
		for (int j = 0; j < n; ++j)
			if (vis[i] == vis[j] && p[i][j] == 2)
				return 0;
	vector<int> cand(n, -1);
	vector<vector<int>> cycs(n);
	for (int i = 0; i < n; ++i) {
		if (cand[vis[i]] == -1) {
			cand[vis[i]] = i;
			cycs[vis2[i]].push_back(i);
		} else {
			answer[cand[vis[i]]][i] = answer[i][cand[vis[i]]] = 1;
		}
	}
	for (int i = 0; i < n; ++i)
		for (int j = 0; j < n; ++j)
			if (vis[i] != vis[j] && p[cand[vis[i]]][cand[vis[j]]] != p[i][j])
				return 0;
	for (auto cyc : cycs) {
		if (cyc.size() > 1) {
			int val = p[cyc[0]][cyc[1]];
			if (val == 2) {
				if (cyc.size() < 3) return 0;
				answer[cyc[0]][cyc.back()] = answer[cyc.back()][cyc[0]] = 1;
				for (int i = 1; i < cyc.size(); ++i)
					answer[cyc[i - 1]][cyc[i]] = answer[cyc[i]][cyc[i - 1]] = 1;
			} else {
				if (cyc.size() < 4) return 0;
				answer[cyc[0]][cyc.back()] = answer[cyc.back()][cyc[0]] = 1;
				answer[cyc[0]][cyc[2]] = answer[cyc[2]][cyc[0]] = 1;
				for (int i = 1; i < cyc.size(); ++i)
					answer[cyc[i - 1]][cyc[i]] = answer[cyc[i]][cyc[i - 1]] = 1;
			}
		}
	}
	build(answer);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:61:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |     for (int i = 1; i < cyc.size(); ++i)
      |                     ~~^~~~~~~~~~~~
supertrees.cpp:67:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |     for (int i = 1; i < cyc.size(); ++i)
      |                     ~~^~~~~~~~~~~~

Subtask #1
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	416 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	1 ms	288 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	10 ms	1280 KB	Output is correct
7	Correct	251 ms	22264 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	416 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	1 ms	288 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	10 ms	1280 KB	Output is correct
7	Correct	251 ms	22264 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	1 ms	256 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	11 ms	1152 KB	Output is correct
13	Correct	247 ms	22140 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	109 ms	12152 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	1 ms	256 KB	Output is correct
20	Correct	63 ms	5880 KB	Output is correct
21	Correct	250 ms	22136 KB	Output is correct
22	Correct	247 ms	22264 KB	Output is correct
23	Correct	256 ms	22136 KB	Output is correct
24	Correct	252 ms	22136 KB	Output is correct
25	Correct	106 ms	12156 KB	Output is correct
26	Correct	104 ms	12152 KB	Output is correct
27	Correct	252 ms	22136 KB	Output is correct
28	Correct	250 ms	22136 KB	Output is correct

Subtask #3
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	1 ms	256 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	11 ms	1152 KB	Output is correct
9	Correct	253 ms	22236 KB	Output is correct
10	Correct	1 ms	256 KB	Output is correct
11	Correct	1 ms	256 KB	Output is correct
12	Correct	11 ms	1152 KB	Output is correct
13	Correct	251 ms	22136 KB	Output is correct
14	Correct	0 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	110 ms	12152 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	1 ms	256 KB	Output is correct
20	Correct	1 ms	256 KB	Output is correct
21	Correct	63 ms	5880 KB	Output is correct
22	Correct	247 ms	22136 KB	Output is correct
23	Correct	255 ms	22136 KB	Output is correct
24	Correct	262 ms	22264 KB	Output is correct
25	Correct	109 ms	12152 KB	Output is correct
26	Correct	106 ms	12152 KB	Output is correct
27	Correct	254 ms	22264 KB	Output is correct
28	Correct	254 ms	22136 KB	Output is correct
29	Correct	115 ms	12152 KB	Output is correct

Subtask #4
35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	64 ms	5892 KB	Output is correct
5	Correct	250 ms	22140 KB	Output is correct
6	Correct	247 ms	22136 KB	Output is correct
7	Correct	254 ms	22136 KB	Output is correct
8	Correct	1 ms	512 KB	Output is correct
9	Correct	62 ms	5880 KB	Output is correct
10	Correct	255 ms	22264 KB	Output is correct
11	Correct	253 ms	22264 KB	Output is correct
12	Correct	257 ms	22136 KB	Output is correct
13	Correct	1 ms	256 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	64 ms	5880 KB	Output is correct
17	Correct	255 ms	22136 KB	Output is correct
18	Correct	257 ms	22136 KB	Output is correct
19	Correct	255 ms	22136 KB	Output is correct
20	Correct	251 ms	22228 KB	Output is correct

Subtask #5
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	416 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	1 ms	288 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	10 ms	1280 KB	Output is correct
7	Correct	251 ms	22264 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	1 ms	256 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	11 ms	1152 KB	Output is correct
13	Correct	247 ms	22140 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	109 ms	12152 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	1 ms	256 KB	Output is correct
20	Correct	63 ms	5880 KB	Output is correct
21	Correct	250 ms	22136 KB	Output is correct
22	Correct	247 ms	22264 KB	Output is correct
23	Correct	256 ms	22136 KB	Output is correct
24	Correct	252 ms	22136 KB	Output is correct
25	Correct	106 ms	12156 KB	Output is correct
26	Correct	104 ms	12152 KB	Output is correct
27	Correct	252 ms	22136 KB	Output is correct
28	Correct	250 ms	22136 KB	Output is correct
29	Correct	0 ms	256 KB	Output is correct
30	Correct	1 ms	256 KB	Output is correct
31	Correct	1 ms	256 KB	Output is correct
32	Correct	0 ms	256 KB	Output is correct
33	Correct	1 ms	256 KB	Output is correct
34	Correct	1 ms	256 KB	Output is correct
35	Correct	1 ms	256 KB	Output is correct
36	Correct	11 ms	1152 KB	Output is correct
37	Correct	253 ms	22236 KB	Output is correct
38	Correct	1 ms	256 KB	Output is correct
39	Correct	1 ms	256 KB	Output is correct
40	Correct	11 ms	1152 KB	Output is correct
41	Correct	251 ms	22136 KB	Output is correct
42	Correct	0 ms	256 KB	Output is correct
43	Correct	1 ms	256 KB	Output is correct
44	Correct	5 ms	768 KB	Output is correct
45	Correct	110 ms	12152 KB	Output is correct
46	Correct	1 ms	256 KB	Output is correct
47	Correct	1 ms	256 KB	Output is correct
48	Correct	1 ms	256 KB	Output is correct
49	Correct	63 ms	5880 KB	Output is correct
50	Correct	247 ms	22136 KB	Output is correct
51	Correct	255 ms	22136 KB	Output is correct
52	Correct	262 ms	22264 KB	Output is correct
53	Correct	109 ms	12152 KB	Output is correct
54	Correct	106 ms	12152 KB	Output is correct
55	Correct	254 ms	22264 KB	Output is correct
56	Correct	254 ms	22136 KB	Output is correct
57	Correct	115 ms	12152 KB	Output is correct
58	Correct	1 ms	384 KB	Output is correct
59	Correct	1 ms	256 KB	Output is correct
60	Correct	5 ms	768 KB	Output is correct
61	Correct	108 ms	12152 KB	Output is correct
62	Correct	1 ms	256 KB	Output is correct
63	Correct	1 ms	256 KB	Output is correct
64	Correct	1 ms	384 KB	Output is correct
65	Correct	63 ms	5880 KB	Output is correct
66	Correct	106 ms	12152 KB	Output is correct
67	Correct	105 ms	12152 KB	Output is correct
68	Correct	107 ms	12156 KB	Output is correct
69	Correct	118 ms	12248 KB	Output is correct

Subtask #6
0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	416 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	1 ms	288 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	10 ms	1280 KB	Output is correct
7	Correct	251 ms	22264 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	1 ms	256 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	11 ms	1152 KB	Output is correct
13	Correct	247 ms	22140 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	109 ms	12152 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	1 ms	256 KB	Output is correct
20	Correct	63 ms	5880 KB	Output is correct
21	Correct	250 ms	22136 KB	Output is correct
22	Correct	247 ms	22264 KB	Output is correct
23	Correct	256 ms	22136 KB	Output is correct
24	Correct	252 ms	22136 KB	Output is correct
25	Correct	106 ms	12156 KB	Output is correct
26	Correct	104 ms	12152 KB	Output is correct
27	Correct	252 ms	22136 KB	Output is correct
28	Correct	250 ms	22136 KB	Output is correct
29	Correct	0 ms	256 KB	Output is correct
30	Correct	1 ms	256 KB	Output is correct
31	Correct	1 ms	256 KB	Output is correct
32	Correct	0 ms	256 KB	Output is correct
33	Correct	1 ms	256 KB	Output is correct
34	Correct	1 ms	256 KB	Output is correct
35	Correct	1 ms	256 KB	Output is correct
36	Correct	11 ms	1152 KB	Output is correct
37	Correct	253 ms	22236 KB	Output is correct
38	Correct	1 ms	256 KB	Output is correct
39	Correct	1 ms	256 KB	Output is correct
40	Correct	11 ms	1152 KB	Output is correct
41	Correct	251 ms	22136 KB	Output is correct
42	Correct	0 ms	256 KB	Output is correct
43	Correct	1 ms	256 KB	Output is correct
44	Correct	5 ms	768 KB	Output is correct
45	Correct	110 ms	12152 KB	Output is correct
46	Correct	1 ms	256 KB	Output is correct
47	Correct	1 ms	256 KB	Output is correct
48	Correct	1 ms	256 KB	Output is correct
49	Correct	63 ms	5880 KB	Output is correct
50	Correct	247 ms	22136 KB	Output is correct
51	Correct	255 ms	22136 KB	Output is correct
52	Correct	262 ms	22264 KB	Output is correct
53	Correct	109 ms	12152 KB	Output is correct
54	Correct	106 ms	12152 KB	Output is correct
55	Correct	254 ms	22264 KB	Output is correct
56	Correct	254 ms	22136 KB	Output is correct
57	Correct	115 ms	12152 KB	Output is correct
58	Correct	1 ms	256 KB	Output is correct
59	Correct	1 ms	256 KB	Output is correct
60	Correct	1 ms	256 KB	Output is correct
61	Correct	64 ms	5892 KB	Output is correct
62	Correct	250 ms	22140 KB	Output is correct
63	Correct	247 ms	22136 KB	Output is correct
64	Correct	254 ms	22136 KB	Output is correct
65	Correct	1 ms	512 KB	Output is correct
66	Correct	62 ms	5880 KB	Output is correct
67	Correct	255 ms	22264 KB	Output is correct
68	Correct	253 ms	22264 KB	Output is correct
69	Correct	257 ms	22136 KB	Output is correct
70	Correct	1 ms	256 KB	Output is correct
71	Correct	1 ms	256 KB	Output is correct
72	Correct	1 ms	256 KB	Output is correct
73	Correct	64 ms	5880 KB	Output is correct
74	Correct	255 ms	22136 KB	Output is correct
75	Correct	257 ms	22136 KB	Output is correct
76	Correct	255 ms	22136 KB	Output is correct
77	Correct	251 ms	22228 KB	Output is correct
78	Correct	1 ms	384 KB	Output is correct
79	Correct	1 ms	256 KB	Output is correct
80	Correct	5 ms	768 KB	Output is correct
81	Correct	108 ms	12152 KB	Output is correct
82	Correct	1 ms	256 KB	Output is correct
83	Correct	1 ms	256 KB	Output is correct
84	Correct	1 ms	384 KB	Output is correct
85	Correct	63 ms	5880 KB	Output is correct
86	Correct	106 ms	12152 KB	Output is correct
87	Correct	105 ms	12152 KB	Output is correct
88	Correct	107 ms	12156 KB	Output is correct
89	Correct	118 ms	12248 KB	Output is correct
90	Correct	0 ms	256 KB	Output is correct
91	Correct	1 ms	256 KB	Output is correct
92	Correct	5 ms	768 KB	Output is correct
93	Correct	108 ms	12152 KB	Output is correct
94	Incorrect	1 ms	256 KB	Answer gives possible 1 while actual possible 0
95	Halted	0 ms	0 KB	-

답안 #300350

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