답안 #223405

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
223405	2020-04-15T08:51:28 Z	staniewzki	동굴 (IOI13_cave)	C++17	100 / 100	263 ms	632 KB

cave

#include<bits/stdc++.h>
using namespace std;
 
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, a, b) for(int i = a; i <= b; i++)
#define ST first
#define ND second
 
ostream& operator<<(ostream &out, string str) {
	for(char c : str) out << c;
	return out;
}
 
template<class L, class R> ostream& operator<<(ostream &out, pair<L, R> p) {
	return out << "(" << p.ST << ", " << p.ND << ")";
}
 
template<class T> auto operator<<(ostream &out, T a) -> decltype(a.begin(), out) {
	out << "{";
	for(auto it = a.begin(); it != a.end(); it = next(it))
		out << (it != a.begin() ? ", " : "") << *it;
	return out << "}";
}
 
void dump() { cerr << "\n"; }
template<class T, class... Ts> void dump(T a, Ts... x) {
	cerr << a << ", ";
	dump(x...);
}
 
#ifdef DEBUG
#  define debug(...) cerr << "[" #__VA_ARGS__ "]: ", dump(__VA_ARGS__)
#else
#  define debug(...) false
#endif
 
template<class T> int size(T && a) { return (int) a.size(); }
 
using LL = long long;
using PII = pair<int, int>;

#include "cave.h"

void exploreCave(int n) {
	vector<int> states(n), door(n, -1);
	auto query = [&]() {
		int r = tryCombination(states.data());
		return r != -1 ? r : n;
	};

	auto range_flip = [&](int l, int r) {
		FOR(i, l, r) 
			if(door[i] == -1)
				states[i] ^= 1;
	};

	REP(i, n) {
		auto taken = [&]() {
			return i < query();
		};

		bool t = taken();
		int l = 0, r = n - 1;
		while(l < r) {
			int m = (l + r) / 2;
			
			range_flip(l, m);
			if(taken() != t)
				r = m;	
			else
				l = m + 1;

			range_flip(l, m);
		}

		if(!t) range_flip(l, l);
		door[l] = i;
	}

	answer(states.data(), door.data());
}

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	120 ms	384 KB	Output is correct
2	Correct	130 ms	504 KB	Output is correct
3	Correct	185 ms	512 KB	Output is correct
4	Correct	130 ms	384 KB	Output is correct
5	Correct	241 ms	488 KB	Output is correct
6	Correct	181 ms	504 KB	Output is correct
7	Correct	241 ms	384 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 ms	256 KB	Output is correct
12	Correct	193 ms	492 KB	Output is correct
13	Correct	182 ms	512 KB	Output is correct
14	Correct	178 ms	384 KB	Output is correct

Subtask #2
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	257 ms	384 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	196 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	4 ms	384 KB	Output is correct
6	Correct	238 ms	632 KB	Output is correct
7	Correct	208 ms	384 KB	Output is correct
8	Correct	248 ms	384 KB	Output is correct
9	Correct	251 ms	504 KB	Output is correct
10	Correct	250 ms	512 KB	Output is correct
11	Correct	208 ms	384 KB	Output is correct

Subtask #3
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	256 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	256 KB	Output is correct
8	Correct	5 ms	256 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	5 ms	384 KB	Output is correct
14	Correct	5 ms	384 KB	Output is correct

Subtask #4
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	256 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	256 KB	Output is correct
8	Correct	5 ms	256 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	5 ms	384 KB	Output is correct
14	Correct	5 ms	384 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	5 ms	384 KB	Output is correct
18	Correct	5 ms	256 KB	Output is correct
19	Correct	5 ms	256 KB	Output is correct
20	Correct	30 ms	384 KB	Output is correct
21	Correct	5 ms	384 KB	Output is correct
22	Correct	5 ms	384 KB	Output is correct
23	Correct	40 ms	384 KB	Output is correct
24	Correct	39 ms	384 KB	Output is correct
25	Correct	41 ms	384 KB	Output is correct
26	Correct	5 ms	384 KB	Output is correct
27	Correct	5 ms	384 KB	Output is correct
28	Correct	31 ms	384 KB	Output is correct
29	Correct	5 ms	384 KB	Output is correct
30	Correct	34 ms	384 KB	Output is correct
31	Correct	30 ms	384 KB	Output is correct
32	Correct	5 ms	384 KB	Output is correct
33	Correct	5 ms	384 KB	Output is correct
34	Correct	5 ms	384 KB	Output is correct
35	Correct	41 ms	384 KB	Output is correct
36	Correct	39 ms	384 KB	Output is correct
37	Correct	5 ms	384 KB	Output is correct

Subtask #5
24.0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Correct	120 ms	384 KB	Output is correct
2	Correct	130 ms	504 KB	Output is correct
3	Correct	185 ms	512 KB	Output is correct
4	Correct	130 ms	384 KB	Output is correct
5	Correct	241 ms	488 KB	Output is correct
6	Correct	181 ms	504 KB	Output is correct
7	Correct	241 ms	384 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 ms	256 KB	Output is correct
12	Correct	193 ms	492 KB	Output is correct
13	Correct	182 ms	512 KB	Output is correct
14	Correct	178 ms	384 KB	Output is correct
15	Correct	257 ms	384 KB	Output is correct
16	Correct	4 ms	384 KB	Output is correct
17	Correct	196 ms	384 KB	Output is correct
18	Correct	5 ms	384 KB	Output is correct
19	Correct	4 ms	384 KB	Output is correct
20	Correct	238 ms	632 KB	Output is correct
21	Correct	208 ms	384 KB	Output is correct
22	Correct	248 ms	384 KB	Output is correct
23	Correct	251 ms	504 KB	Output is correct
24	Correct	250 ms	512 KB	Output is correct
25	Correct	208 ms	384 KB	Output is correct
26	Correct	5 ms	384 KB	Output is correct
27	Correct	5 ms	256 KB	Output is correct
28	Correct	5 ms	384 KB	Output is correct
29	Correct	5 ms	384 KB	Output is correct
30	Correct	5 ms	384 KB	Output is correct
31	Correct	5 ms	384 KB	Output is correct
32	Correct	5 ms	256 KB	Output is correct
33	Correct	5 ms	256 KB	Output is correct
34	Correct	5 ms	384 KB	Output is correct
35	Correct	5 ms	384 KB	Output is correct
36	Correct	5 ms	384 KB	Output is correct
37	Correct	5 ms	384 KB	Output is correct
38	Correct	5 ms	384 KB	Output is correct
39	Correct	5 ms	384 KB	Output is correct
40	Correct	5 ms	384 KB	Output is correct
41	Correct	5 ms	384 KB	Output is correct
42	Correct	5 ms	384 KB	Output is correct
43	Correct	5 ms	256 KB	Output is correct
44	Correct	5 ms	256 KB	Output is correct
45	Correct	30 ms	384 KB	Output is correct
46	Correct	5 ms	384 KB	Output is correct
47	Correct	5 ms	384 KB	Output is correct
48	Correct	40 ms	384 KB	Output is correct
49	Correct	39 ms	384 KB	Output is correct
50	Correct	41 ms	384 KB	Output is correct
51	Correct	5 ms	384 KB	Output is correct
52	Correct	5 ms	384 KB	Output is correct
53	Correct	31 ms	384 KB	Output is correct
54	Correct	5 ms	384 KB	Output is correct
55	Correct	34 ms	384 KB	Output is correct
56	Correct	30 ms	384 KB	Output is correct
57	Correct	5 ms	384 KB	Output is correct
58	Correct	5 ms	384 KB	Output is correct
59	Correct	5 ms	384 KB	Output is correct
60	Correct	41 ms	384 KB	Output is correct
61	Correct	39 ms	384 KB	Output is correct
62	Correct	5 ms	384 KB	Output is correct
63	Correct	121 ms	384 KB	Output is correct
64	Correct	120 ms	384 KB	Output is correct
65	Correct	188 ms	512 KB	Output is correct
66	Correct	128 ms	512 KB	Output is correct
67	Correct	240 ms	384 KB	Output is correct
68	Correct	191 ms	384 KB	Output is correct
69	Correct	245 ms	384 KB	Output is correct
70	Correct	5 ms	384 KB	Output is correct
71	Correct	5 ms	384 KB	Output is correct
72	Correct	188 ms	384 KB	Output is correct
73	Correct	178 ms	384 KB	Output is correct
74	Correct	179 ms	384 KB	Output is correct
75	Correct	202 ms	504 KB	Output is correct
76	Correct	5 ms	384 KB	Output is correct
77	Correct	5 ms	384 KB	Output is correct
78	Correct	240 ms	384 KB	Output is correct
79	Correct	209 ms	384 KB	Output is correct
80	Correct	255 ms	512 KB	Output is correct
81	Correct	244 ms	384 KB	Output is correct
82	Correct	260 ms	508 KB	Output is correct
83	Correct	209 ms	384 KB	Output is correct
84	Correct	5 ms	384 KB	Output is correct
85	Correct	31 ms	384 KB	Output is correct
86	Correct	181 ms	384 KB	Output is correct
87	Correct	5 ms	384 KB	Output is correct
88	Correct	5 ms	384 KB	Output is correct
89	Correct	44 ms	384 KB	Output is correct
90	Correct	43 ms	384 KB	Output is correct
91	Correct	46 ms	384 KB	Output is correct
92	Correct	254 ms	512 KB	Output is correct
93	Correct	258 ms	384 KB	Output is correct
94	Correct	260 ms	384 KB	Output is correct
95	Correct	5 ms	256 KB	Output is correct
96	Correct	5 ms	384 KB	Output is correct
97	Correct	185 ms	512 KB	Output is correct
98	Correct	31 ms	384 KB	Output is correct
99	Correct	180 ms	384 KB	Output is correct
100	Correct	5 ms	384 KB	Output is correct
101	Correct	30 ms	384 KB	Output is correct
102	Correct	35 ms	504 KB	Output is correct
103	Correct	183 ms	512 KB	Output is correct
104	Correct	5 ms	384 KB	Output is correct
105	Correct	5 ms	384 KB	Output is correct
106	Correct	5 ms	384 KB	Output is correct
107	Correct	38 ms	384 KB	Output is correct
108	Correct	39 ms	384 KB	Output is correct
109	Correct	263 ms	504 KB	Output is correct
110	Correct	248 ms	512 KB	Output is correct
111	Correct	5 ms	384 KB	Output is correct

답안 #223405

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