Submission #896695

# Submission time Handle Problem Language Result Execution time Memory
896695 2024-01-01T21:44:17 Z aqxa Cave (IOI13_cave) C++17
100 / 100
167 ms 760 KB
#include <bits/stdc++.h>
using namespace std;

#include "cave.h"

const int mxn = 5001; 
using ll = long long; 

// namespace tester {
// 	int N; 
// 	int to[mxn], need[mxn]; 
// 	void init() {
// 		cin >> N; 
// 		for (int i = 0; i < N; ++i) {
// 			cin >> need[i]; 
// 		}
// 		for (int i = 0; i < N; ++i) {
// 			cin >> to[i]; 
// 		}
// 	}
// 	int tryCombination(int comb[]) {
// 		int mn = N; 
// 		for (int i = 0; i < N; ++i) {
// 			if (comb[i] != need[i]) {
// 				mn = min(mn, to[i]); 
// 			}
// 		}
// 		if (mn == N) mn = -1; 
// 		return mn; 
// 	}
// 	void answer(int need2[], int to2[]) {
// 		bool ok = 1; 
// 		for (int i = 0; i < N; ++i) {
// 			ok &= to[i] == to2[i] && need[i] == need2[i]; 
// 		}
// 		if (ok) {
// 			cout << "AC\n";
// 		} else {
// 			cout << "WA\n";
// 			cout << "Participant response: \n";
// 			for (int i = 0; i < N; ++i) {
// 				cout << need2[i] << " \n"[i == N - 1]; 
// 			}
// 			for (int i = 0; i < N; ++i) {
// 				cout << to2[i] << " \n"[i == N - 1]; 
// 			}
// 		}
// 	}
// }
// using namespace tester; 


void exploreCave(int n) {
	int ans[n], need[n]; 
	for (int i = 0; i < n; ++i) {
		need[i] = -1; 
	}

	int t[n]; 
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < n; ++j) {
			t[j] = (need[j] == -1 ? 0 : need[j]); 
		}
		int can = tryCombination(t); 
		if (can == -1) can = n; 
		can = (can > i); 

		int lo = 0, hi = n - 1; 
		while (lo < hi) {
			int mid = (lo + hi) / 2; 
			for (int j = lo; j <= mid; ++j) {
				t[j] = (need[j] == -1 ? t[j] ^ 1 : need[j]); 
			}
			int can2 = tryCombination(t); 
			// for (int j = 0; j < n; ++j) {
			// 	cout << t[j] << " \n"[j + 1 == n]; 
			// }
			// cout << "res " << can2 << '\n';

			if (can2 == -1) can2 = n; 
			can2 = (can2 > i); 
			if (can == can2) {
				lo = mid + 1; 
			} else {
				hi = mid; 
				can = can2; 
			}
		}
		need[lo] = can ^ t[lo] ^ 1; 
		ans[lo] = i; 
	}
	answer(need, ans); 
}

// int main() {
// 	ios::sync_with_stdio(false);
// 	cin.tie(nullptr);
	
// 	init(); 
// 	exploreCave(N); 

// 	return 0; 
// }
# Verdict Execution time Memory Grader output
1 Correct 80 ms 344 KB Output is correct
2 Correct 80 ms 536 KB Output is correct
3 Correct 124 ms 348 KB Output is correct
4 Correct 89 ms 536 KB Output is correct
5 Correct 131 ms 564 KB Output is correct
6 Correct 121 ms 556 KB Output is correct
7 Correct 133 ms 556 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 120 ms 556 KB Output is correct
13 Correct 120 ms 556 KB Output is correct
14 Correct 121 ms 560 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 167 ms 520 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 129 ms 556 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 131 ms 452 KB Output is correct
7 Correct 132 ms 556 KB Output is correct
8 Correct 148 ms 344 KB Output is correct
9 Correct 160 ms 556 KB Output is correct
10 Correct 150 ms 344 KB Output is correct
11 Correct 132 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 440 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 19 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 28 ms 348 KB Output is correct
24 Correct 20 ms 504 KB Output is correct
25 Correct 20 ms 600 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 19 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 21 ms 348 KB Output is correct
31 Correct 19 ms 344 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 444 KB Output is correct
35 Correct 22 ms 480 KB Output is correct
36 Correct 20 ms 344 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 80 ms 344 KB Output is correct
2 Correct 80 ms 536 KB Output is correct
3 Correct 124 ms 348 KB Output is correct
4 Correct 89 ms 536 KB Output is correct
5 Correct 131 ms 564 KB Output is correct
6 Correct 121 ms 556 KB Output is correct
7 Correct 133 ms 556 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 120 ms 556 KB Output is correct
13 Correct 120 ms 556 KB Output is correct
14 Correct 121 ms 560 KB Output is correct
15 Correct 167 ms 520 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 129 ms 556 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 131 ms 452 KB Output is correct
21 Correct 132 ms 556 KB Output is correct
22 Correct 148 ms 344 KB Output is correct
23 Correct 160 ms 556 KB Output is correct
24 Correct 150 ms 344 KB Output is correct
25 Correct 132 ms 348 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 440 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 19 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 28 ms 348 KB Output is correct
49 Correct 20 ms 504 KB Output is correct
50 Correct 20 ms 600 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 19 ms 348 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 21 ms 348 KB Output is correct
56 Correct 19 ms 344 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 1 ms 444 KB Output is correct
60 Correct 22 ms 480 KB Output is correct
61 Correct 20 ms 344 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 80 ms 348 KB Output is correct
64 Correct 83 ms 348 KB Output is correct
65 Correct 128 ms 560 KB Output is correct
66 Correct 84 ms 348 KB Output is correct
67 Correct 130 ms 344 KB Output is correct
68 Correct 127 ms 560 KB Output is correct
69 Correct 129 ms 560 KB Output is correct
70 Correct 1 ms 344 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 122 ms 556 KB Output is correct
73 Correct 126 ms 760 KB Output is correct
74 Correct 121 ms 344 KB Output is correct
75 Correct 129 ms 344 KB Output is correct
76 Correct 0 ms 348 KB Output is correct
77 Correct 0 ms 348 KB Output is correct
78 Correct 134 ms 556 KB Output is correct
79 Correct 133 ms 560 KB Output is correct
80 Correct 149 ms 344 KB Output is correct
81 Correct 149 ms 556 KB Output is correct
82 Correct 159 ms 556 KB Output is correct
83 Correct 135 ms 556 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 19 ms 504 KB Output is correct
86 Correct 123 ms 348 KB Output is correct
87 Correct 0 ms 344 KB Output is correct
88 Correct 0 ms 344 KB Output is correct
89 Correct 20 ms 348 KB Output is correct
90 Correct 21 ms 348 KB Output is correct
91 Correct 20 ms 348 KB Output is correct
92 Correct 141 ms 344 KB Output is correct
93 Correct 143 ms 560 KB Output is correct
94 Correct 142 ms 560 KB Output is correct
95 Correct 0 ms 348 KB Output is correct
96 Correct 1 ms 348 KB Output is correct
97 Correct 124 ms 560 KB Output is correct
98 Correct 18 ms 344 KB Output is correct
99 Correct 128 ms 596 KB Output is correct
100 Correct 0 ms 348 KB Output is correct
101 Correct 19 ms 348 KB Output is correct
102 Correct 19 ms 348 KB Output is correct
103 Correct 120 ms 344 KB Output is correct
104 Correct 1 ms 348 KB Output is correct
105 Correct 0 ms 348 KB Output is correct
106 Correct 0 ms 344 KB Output is correct
107 Correct 21 ms 504 KB Output is correct
108 Correct 23 ms 344 KB Output is correct
109 Correct 144 ms 556 KB Output is correct
110 Correct 142 ms 556 KB Output is correct
111 Correct 0 ms 348 KB Output is correct