답안 #451998

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
451998	2021-08-03T15:48:41 Z	rainboy	슈퍼트리 잇기 (IOI20_supertrees)	C++17	40 / 100	263 ms	23968 KB

supertrees

#include "supertrees.h"
#include <stdio.h>
#include <string.h>

using namespace std;

typedef vector<int> vi;

const int N = 1000;

int abs_(int a) { return a > 0 ? a : -a; }

int ds[N];

int find(int i) {
	return ds[i] < 0 ? i : (ds[i] = find(ds[i]));
}

void join(int i, int j) {
	i = find(i);
	j = find(j);
	if (i == j)
		return;
	if (ds[i] > ds[j])
		ds[i] = j;
	else {
		if (ds[i] == ds[j])
			ds[i]--;
		ds[j] = i;
	}
}

int construct(vector<vi> pp) {
	int n = pp.size(), i, j, k;
	vector<vi> aa(n);

	for (i = 0; i < n; i++)
		aa[i].resize(n);
	memset(ds, -1, n * sizeof *ds);
	for (i = 0; i < n; i++)
		for (j = i + 1; j < n; j++)
			if (pp[i][j] == 1)
				join(i, j);
	for (i = 0; i < n; i++)
		for (j = i + 1; j < n; j++)
			if ((find(i) == find(j)) != (pp[i][j] == 1))
				return 0;
	for (i = 0; i < n; i++)
		if ((j = find(i)) != i)
			aa[i][j] = aa[j][i] = 1;
	memset(ds, -1, n * sizeof *ds);
	for (i = 0; i < n; i++)
		for (j = i + 1; j < n; j++)
			if (pp[i][j] == 2)
				join(i, j);
	for (i = 0; i < n; i++)
		for (j = i + 1; j < n; j++)
			if ((find(i) == find(j)) != (pp[i][j] == 2))
				return 0;
	for (i = 0; i < n; i++)
		if (ds[i] < 0) {
			int c;

			k = i, c = 1;
			for (j = 0; j < n; j++)
				if (j != i && find(j) == i)
					aa[j][k] = aa[k][j] = 1, k = j, c++;
			if (c == 2)
				return 0;
			if (k != i)
				aa[i][k] = aa[k][i] = 1, k = j;
		}
	build(aa);
	return 1;
}

Subtask #1
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	10 ms	1120 KB	Output is correct
7	Correct	243 ms	22020 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	10 ms	1120 KB	Output is correct
7	Correct	243 ms	22020 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	10 ms	1136 KB	Output is correct
13	Correct	245 ms	22016 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	5 ms	716 KB	Output is correct
17	Correct	119 ms	12032 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	60 ms	5656 KB	Output is correct
21	Correct	237 ms	21956 KB	Output is correct
22	Correct	244 ms	21956 KB	Output is correct
23	Correct	263 ms	22000 KB	Output is correct
24	Correct	237 ms	21964 KB	Output is correct
25	Correct	109 ms	12100 KB	Output is correct
26	Correct	104 ms	12028 KB	Output is correct
27	Correct	249 ms	22004 KB	Output is correct
28	Correct	245 ms	22124 KB	Output is correct

Subtask #3
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	280 KB	Output is correct
8	Correct	10 ms	1244 KB	Output is correct
9	Correct	249 ms	23908 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	10 ms	1228 KB	Output is correct
13	Correct	241 ms	23924 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	5 ms	840 KB	Output is correct
17	Correct	120 ms	14052 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	0 ms	284 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	61 ms	6112 KB	Output is correct
22	Correct	235 ms	23968 KB	Output is correct
23	Correct	252 ms	23912 KB	Output is correct
24	Correct	248 ms	23876 KB	Output is correct
25	Correct	111 ms	14020 KB	Output is correct
26	Correct	111 ms	13976 KB	Output is correct
27	Correct	235 ms	23876 KB	Output is correct
28	Correct	246 ms	23904 KB	Output is correct
29	Correct	110 ms	14020 KB	Output is correct

Subtask #4
0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	60 ms	5752 KB	Output is correct
5	Correct	240 ms	21956 KB	Output is correct
6	Correct	246 ms	22016 KB	Output is correct
7	Correct	245 ms	22012 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	61 ms	5660 KB	Output is correct
10	Correct	236 ms	21964 KB	Output is correct
11	Correct	237 ms	21956 KB	Output is correct
12	Correct	247 ms	21956 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Incorrect	0 ms	204 KB	Answer gives possible 0 while actual possible 1
16	Halted	0 ms	0 KB	-

Subtask #5
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	10 ms	1120 KB	Output is correct
7	Correct	243 ms	22020 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	10 ms	1136 KB	Output is correct
13	Correct	245 ms	22016 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	5 ms	716 KB	Output is correct
17	Correct	119 ms	12032 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	60 ms	5656 KB	Output is correct
21	Correct	237 ms	21956 KB	Output is correct
22	Correct	244 ms	21956 KB	Output is correct
23	Correct	263 ms	22000 KB	Output is correct
24	Correct	237 ms	21964 KB	Output is correct
25	Correct	109 ms	12100 KB	Output is correct
26	Correct	104 ms	12028 KB	Output is correct
27	Correct	249 ms	22004 KB	Output is correct
28	Correct	245 ms	22124 KB	Output is correct
29	Correct	0 ms	204 KB	Output is correct
30	Correct	0 ms	204 KB	Output is correct
31	Correct	1 ms	204 KB	Output is correct
32	Correct	0 ms	204 KB	Output is correct
33	Correct	0 ms	204 KB	Output is correct
34	Correct	0 ms	204 KB	Output is correct
35	Correct	0 ms	280 KB	Output is correct
36	Correct	10 ms	1244 KB	Output is correct
37	Correct	249 ms	23908 KB	Output is correct
38	Correct	0 ms	204 KB	Output is correct
39	Correct	0 ms	204 KB	Output is correct
40	Correct	10 ms	1228 KB	Output is correct
41	Correct	241 ms	23924 KB	Output is correct
42	Correct	0 ms	204 KB	Output is correct
43	Correct	0 ms	204 KB	Output is correct
44	Correct	5 ms	840 KB	Output is correct
45	Correct	120 ms	14052 KB	Output is correct
46	Correct	0 ms	204 KB	Output is correct
47	Correct	0 ms	284 KB	Output is correct
48	Correct	1 ms	204 KB	Output is correct
49	Correct	61 ms	6112 KB	Output is correct
50	Correct	235 ms	23968 KB	Output is correct
51	Correct	252 ms	23912 KB	Output is correct
52	Correct	248 ms	23876 KB	Output is correct
53	Correct	111 ms	14020 KB	Output is correct
54	Correct	111 ms	13976 KB	Output is correct
55	Correct	235 ms	23876 KB	Output is correct
56	Correct	246 ms	23904 KB	Output is correct
57	Correct	110 ms	14020 KB	Output is correct
58	Correct	0 ms	204 KB	Output is correct
59	Correct	0 ms	204 KB	Output is correct
60	Correct	5 ms	844 KB	Output is correct
61	Correct	116 ms	13984 KB	Output is correct
62	Correct	0 ms	204 KB	Output is correct
63	Correct	0 ms	204 KB	Output is correct
64	Correct	0 ms	204 KB	Output is correct
65	Incorrect	28 ms	3688 KB	Answer gives possible 0 while actual possible 1
66	Halted	0 ms	0 KB	-

Subtask #6
0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	10 ms	1120 KB	Output is correct
7	Correct	243 ms	22020 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	10 ms	1136 KB	Output is correct
13	Correct	245 ms	22016 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	5 ms	716 KB	Output is correct
17	Correct	119 ms	12032 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	60 ms	5656 KB	Output is correct
21	Correct	237 ms	21956 KB	Output is correct
22	Correct	244 ms	21956 KB	Output is correct
23	Correct	263 ms	22000 KB	Output is correct
24	Correct	237 ms	21964 KB	Output is correct
25	Correct	109 ms	12100 KB	Output is correct
26	Correct	104 ms	12028 KB	Output is correct
27	Correct	249 ms	22004 KB	Output is correct
28	Correct	245 ms	22124 KB	Output is correct
29	Correct	0 ms	204 KB	Output is correct
30	Correct	0 ms	204 KB	Output is correct
31	Correct	1 ms	204 KB	Output is correct
32	Correct	0 ms	204 KB	Output is correct
33	Correct	0 ms	204 KB	Output is correct
34	Correct	0 ms	204 KB	Output is correct
35	Correct	0 ms	280 KB	Output is correct
36	Correct	10 ms	1244 KB	Output is correct
37	Correct	249 ms	23908 KB	Output is correct
38	Correct	0 ms	204 KB	Output is correct
39	Correct	0 ms	204 KB	Output is correct
40	Correct	10 ms	1228 KB	Output is correct
41	Correct	241 ms	23924 KB	Output is correct
42	Correct	0 ms	204 KB	Output is correct
43	Correct	0 ms	204 KB	Output is correct
44	Correct	5 ms	840 KB	Output is correct
45	Correct	120 ms	14052 KB	Output is correct
46	Correct	0 ms	204 KB	Output is correct
47	Correct	0 ms	284 KB	Output is correct
48	Correct	1 ms	204 KB	Output is correct
49	Correct	61 ms	6112 KB	Output is correct
50	Correct	235 ms	23968 KB	Output is correct
51	Correct	252 ms	23912 KB	Output is correct
52	Correct	248 ms	23876 KB	Output is correct
53	Correct	111 ms	14020 KB	Output is correct
54	Correct	111 ms	13976 KB	Output is correct
55	Correct	235 ms	23876 KB	Output is correct
56	Correct	246 ms	23904 KB	Output is correct
57	Correct	110 ms	14020 KB	Output is correct
58	Correct	0 ms	204 KB	Output is correct
59	Correct	0 ms	204 KB	Output is correct
60	Correct	0 ms	204 KB	Output is correct
61	Correct	60 ms	5752 KB	Output is correct
62	Correct	240 ms	21956 KB	Output is correct
63	Correct	246 ms	22016 KB	Output is correct
64	Correct	245 ms	22012 KB	Output is correct
65	Correct	0 ms	204 KB	Output is correct
66	Correct	61 ms	5660 KB	Output is correct
67	Correct	236 ms	21964 KB	Output is correct
68	Correct	237 ms	21956 KB	Output is correct
69	Correct	247 ms	21956 KB	Output is correct
70	Correct	0 ms	204 KB	Output is correct
71	Correct	0 ms	204 KB	Output is correct
72	Incorrect	0 ms	204 KB	Answer gives possible 0 while actual possible 1
73	Halted	0 ms	0 KB	-

답안 #451998

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 10.0 / 10.0

Subtask #3 19.0 / 19.0

Subtask #4 0 / 35.0

Subtask #5 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
0 / 35.0

Subtask #5
0 / 21.0

Subtask #6
0 / 4.0