#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 160;
int n, s[N], c[N];
int main() {
ios :: sync_with_stdio(0); cin.tie(0);
auto ask = [&](int x, int y) {
cout << y + 1 << endl;
for (int i = 1; i <= y; ++i) cout << i << ' ';
cout << x << endl;
int z;
cin >> z;
return z;
};
cin >> n;
for (int i = 1; i <= n; ++i) {
int L = 0, R = i - 1;
while (R - L > 1) {
int mid = L + R >> 1;
if (s[mid] != ask(i, mid)) L = mid;
else R = mid;
}
int j = (s[L] == ask(i, L) ? L : R);
s[i] = s[i - 1];
if (j == 0) c[i] = ++s[i];
else c[i] = c[j];
}
cout << 0 << ' ';
for (int i = 1; i <= n; ++i) cout << c[i] << ' ';
}
Compilation message
carnival.cpp: In function 'int main()':
carnival.cpp:31:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
31 | int mid = L + R >> 1;
| ~~^~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
19 ms |
208 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
19 ms |
208 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
8 ms |
208 KB |
Output is correct |
2 |
Incorrect |
14 ms |
208 KB |
Incorrect |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
17 ms |
208 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
16 ms |
208 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |