답안 #518375

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
518375	2022-01-23T15:23:58 Z	sliviu	동굴 (IOI13_cave)	C++14	100 / 100	241 ms	584 KB

cave

#include <bits/stdc++.h>
#include "cave.h"

using namespace std;


void exploreCave(int n) {
	int* s = new int[n], * d = new int[n], * cur = new int[n], * pos = new int[n], N = 31 - __builtin_clz(n);
	for (int i = 0; i < n; ++i)
		cur[i] = s[i] = d[i] = pos[i] = 0;
	//for (int i = 0; i < n; ++i)
		//cout << cur[i] << ' ';
	//cout << '\n';
	vector<int> solved(n);
	for (int i = 0; i < n; ++i) {
		int spos, dpos = 0;
		auto ok = [&](int cur[]) {
			int ok = tryCombination(cur);
			//cout << "TRYCOMB " << i << ' ' << ok << '\n';
			return !(ok > i || ok == -1);
		};
		spos = ok(cur);
		//cout << i << ' ' << spos << '\n';
		for (int j = 1; j <= N; ++j) {
			for (int t = 0; t < n; ++t)
				pos[t] = cur[t];
			//cout << "POSB CHECK : ";
			//for (int i = 0; i < n; ++i)
				//cout << pos[i] << ' ';
			//cout << '\n';
			for (int k = dpos; k < n; k += (1 << j))
				if (!solved[k])
					pos[k] = 1;
			//cout << "POSA CHECK : ";
			//for (int i = 0; i < n; ++i)
				//cout << pos[i] << ' ';
			//cout << '\n';
			dpos |= ((ok(pos) ^ spos ^ 1) << (j - 1));
		}
		for (int t = 0; t < n; ++t)
			pos[t] = cur[t];
		//cout << "DB " << dpos << '\n';
		if (!solved[dpos]) {
			pos[dpos] = 1;
			dpos |= ((ok(pos) ^ spos ^ 1) << N);
		}
		else
			dpos |= 1 << N;
		//cout << "DA " << dpos << '\n';
		cur[dpos] = spos;
		d[dpos] = i;
		s[dpos] = spos;
		solved[dpos] = 1;
		//cout << "CUR CHECK : ";
		//for (int i = 0; i < n; ++i)
			//cout << cur[i] << ' ';
		//cout << '\n';
	}
	answer(s, d);
}

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	104 ms	384 KB	Output is correct
2	Correct	104 ms	428 KB	Output is correct
3	Correct	150 ms	464 KB	Output is correct
4	Correct	106 ms	440 KB	Output is correct
5	Correct	186 ms	464 KB	Output is correct
6	Correct	190 ms	464 KB	Output is correct
7	Correct	171 ms	480 KB	Output is correct
8	Correct	1 ms	208 KB	Output is correct
9	Correct	1 ms	296 KB	Output is correct
10	Correct	1 ms	208 KB	Output is correct
11	Correct	0 ms	208 KB	Output is correct
12	Correct	164 ms	464 KB	Output is correct
13	Correct	160 ms	468 KB	Output is correct
14	Correct	163 ms	464 KB	Output is correct

Subtask #2
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	197 ms	440 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	170 ms	464 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	0 ms	208 KB	Output is correct
6	Correct	174 ms	464 KB	Output is correct
7	Correct	187 ms	484 KB	Output is correct
8	Correct	241 ms	444 KB	Output is correct
9	Correct	239 ms	464 KB	Output is correct
10	Correct	236 ms	464 KB	Output is correct
11	Correct	235 ms	464 KB	Output is correct

Subtask #3
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	224 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	208 KB	Output is correct
10	Correct	1 ms	216 KB	Output is correct
11	Correct	0 ms	220 KB	Output is correct
12	Correct	1 ms	220 KB	Output is correct
13	Correct	1 ms	208 KB	Output is correct
14	Correct	1 ms	300 KB	Output is correct

Subtask #4
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	224 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	208 KB	Output is correct
10	Correct	1 ms	216 KB	Output is correct
11	Correct	0 ms	220 KB	Output is correct
12	Correct	1 ms	220 KB	Output is correct
13	Correct	1 ms	208 KB	Output is correct
14	Correct	1 ms	300 KB	Output is correct
15	Correct	0 ms	300 KB	Output is correct
16	Correct	1 ms	208 KB	Output is correct
17	Correct	0 ms	208 KB	Output is correct
18	Correct	0 ms	208 KB	Output is correct
19	Correct	0 ms	208 KB	Output is correct
20	Correct	30 ms	336 KB	Output is correct
21	Correct	1 ms	300 KB	Output is correct
22	Correct	1 ms	208 KB	Output is correct
23	Correct	28 ms	336 KB	Output is correct
24	Correct	29 ms	336 KB	Output is correct
25	Correct	27 ms	364 KB	Output is correct
26	Correct	1 ms	208 KB	Output is correct
27	Correct	1 ms	296 KB	Output is correct
28	Correct	21 ms	336 KB	Output is correct
29	Correct	0 ms	208 KB	Output is correct
30	Correct	22 ms	336 KB	Output is correct
31	Correct	23 ms	312 KB	Output is correct
32	Correct	1 ms	300 KB	Output is correct
33	Correct	1 ms	300 KB	Output is correct
34	Correct	1 ms	300 KB	Output is correct
35	Correct	29 ms	336 KB	Output is correct
36	Correct	29 ms	336 KB	Output is correct
37	Correct	0 ms	324 KB	Output is correct

Subtask #5
24.0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Correct	104 ms	384 KB	Output is correct
2	Correct	104 ms	428 KB	Output is correct
3	Correct	150 ms	464 KB	Output is correct
4	Correct	106 ms	440 KB	Output is correct
5	Correct	186 ms	464 KB	Output is correct
6	Correct	190 ms	464 KB	Output is correct
7	Correct	171 ms	480 KB	Output is correct
8	Correct	1 ms	208 KB	Output is correct
9	Correct	1 ms	296 KB	Output is correct
10	Correct	1 ms	208 KB	Output is correct
11	Correct	0 ms	208 KB	Output is correct
12	Correct	164 ms	464 KB	Output is correct
13	Correct	160 ms	468 KB	Output is correct
14	Correct	163 ms	464 KB	Output is correct
15	Correct	197 ms	440 KB	Output is correct
16	Correct	0 ms	208 KB	Output is correct
17	Correct	170 ms	464 KB	Output is correct
18	Correct	1 ms	208 KB	Output is correct
19	Correct	0 ms	208 KB	Output is correct
20	Correct	174 ms	464 KB	Output is correct
21	Correct	187 ms	484 KB	Output is correct
22	Correct	241 ms	444 KB	Output is correct
23	Correct	239 ms	464 KB	Output is correct
24	Correct	236 ms	464 KB	Output is correct
25	Correct	235 ms	464 KB	Output is correct
26	Correct	1 ms	224 KB	Output is correct
27	Correct	0 ms	204 KB	Output is correct
28	Correct	0 ms	204 KB	Output is correct
29	Correct	1 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	1 ms	204 KB	Output is correct
33	Correct	0 ms	204 KB	Output is correct
34	Correct	1 ms	208 KB	Output is correct
35	Correct	1 ms	216 KB	Output is correct
36	Correct	0 ms	220 KB	Output is correct
37	Correct	1 ms	220 KB	Output is correct
38	Correct	1 ms	208 KB	Output is correct
39	Correct	1 ms	300 KB	Output is correct
40	Correct	0 ms	300 KB	Output is correct
41	Correct	1 ms	208 KB	Output is correct
42	Correct	0 ms	208 KB	Output is correct
43	Correct	0 ms	208 KB	Output is correct
44	Correct	0 ms	208 KB	Output is correct
45	Correct	30 ms	336 KB	Output is correct
46	Correct	1 ms	300 KB	Output is correct
47	Correct	1 ms	208 KB	Output is correct
48	Correct	28 ms	336 KB	Output is correct
49	Correct	29 ms	336 KB	Output is correct
50	Correct	27 ms	364 KB	Output is correct
51	Correct	1 ms	208 KB	Output is correct
52	Correct	1 ms	296 KB	Output is correct
53	Correct	21 ms	336 KB	Output is correct
54	Correct	0 ms	208 KB	Output is correct
55	Correct	22 ms	336 KB	Output is correct
56	Correct	23 ms	312 KB	Output is correct
57	Correct	1 ms	300 KB	Output is correct
58	Correct	1 ms	300 KB	Output is correct
59	Correct	1 ms	300 KB	Output is correct
60	Correct	29 ms	336 KB	Output is correct
61	Correct	29 ms	336 KB	Output is correct
62	Correct	0 ms	324 KB	Output is correct
63	Correct	108 ms	452 KB	Output is correct
64	Correct	117 ms	444 KB	Output is correct
65	Correct	163 ms	464 KB	Output is correct
66	Correct	113 ms	440 KB	Output is correct
67	Correct	215 ms	464 KB	Output is correct
68	Correct	159 ms	472 KB	Output is correct
69	Correct	167 ms	360 KB	Output is correct
70	Correct	1 ms	220 KB	Output is correct
71	Correct	1 ms	220 KB	Output is correct
72	Correct	208 ms	464 KB	Output is correct
73	Correct	196 ms	464 KB	Output is correct
74	Correct	166 ms	584 KB	Output is correct
75	Correct	201 ms	464 KB	Output is correct
76	Correct	1 ms	208 KB	Output is correct
77	Correct	1 ms	300 KB	Output is correct
78	Correct	183 ms	468 KB	Output is correct
79	Correct	173 ms	464 KB	Output is correct
80	Correct	227 ms	584 KB	Output is correct
81	Correct	221 ms	464 KB	Output is correct
82	Correct	238 ms	464 KB	Output is correct
83	Correct	178 ms	464 KB	Output is correct
84	Correct	1 ms	208 KB	Output is correct
85	Correct	25 ms	336 KB	Output is correct
86	Correct	160 ms	464 KB	Output is correct
87	Correct	1 ms	208 KB	Output is correct
88	Correct	1 ms	208 KB	Output is correct
89	Correct	28 ms	336 KB	Output is correct
90	Correct	27 ms	336 KB	Output is correct
91	Correct	28 ms	336 KB	Output is correct
92	Correct	215 ms	464 KB	Output is correct
93	Correct	231 ms	464 KB	Output is correct
94	Correct	214 ms	464 KB	Output is correct
95	Correct	1 ms	208 KB	Output is correct
96	Correct	1 ms	208 KB	Output is correct
97	Correct	158 ms	560 KB	Output is correct
98	Correct	24 ms	376 KB	Output is correct
99	Correct	161 ms	464 KB	Output is correct
100	Correct	1 ms	292 KB	Output is correct
101	Correct	24 ms	336 KB	Output is correct
102	Correct	30 ms	336 KB	Output is correct
103	Correct	173 ms	464 KB	Output is correct
104	Correct	1 ms	208 KB	Output is correct
105	Correct	1 ms	208 KB	Output is correct
106	Correct	1 ms	208 KB	Output is correct
107	Correct	28 ms	336 KB	Output is correct
108	Correct	28 ms	336 KB	Output is correct
109	Correct	216 ms	464 KB	Output is correct
110	Correct	212 ms	464 KB	Output is correct
111	Correct	1 ms	208 KB	Output is correct

답안 #518375

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 13.0 / 13.0

Subtask #3 21.0 / 21.0

Subtask #4 30.0 / 30.0

Subtask #5 24.0 / 24.0

Subtask #1
12.0 / 12.0

Subtask #2
13.0 / 13.0

Subtask #3
21.0 / 21.0

Subtask #4
30.0 / 30.0

Subtask #5
24.0 / 24.0