| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1192000 | hmmm | 사육제 (CEOI14_carnival) | C++20 | 6 ms | 432 KiB |
#include <bits/stdc++.h>
using namespace std;
const int N = 155;
int a[N];
int F(int l, int r) {
int x;
cout << r - l + 1;
for (int i = l; i <= r; i++) cout << ' ' << i;
cout << '\n' << flush; // flush สำคัญมาก
cin >> x;
return x;
}
int main() {
ios::sync_with_stdio(0); cin.tie(0);
int n, cnt = 1;
cin >> n;
a[1] = 1;
for (int i = 2; i <= n; i++) {
int x = F(1, i);
if (x != cnt) {
a[i] = ++cnt;
} else {
int l = 1, r = i - 1, pos = -1;
while (l <= r) {
int mid = (l + r) / 2;
int t1 = F(mid, i);
int t2 = F(mid, i - 1);
if (t1 == t2) {
l = mid + 1;
} else {
pos = mid;
r = mid - 1;
}
}
a[i] = a[pos];
}
}
cout << "0";
for (int i = 1; i <= n; i++) {
if (a[i] == 0) a[i] = 1;
cout << ' ' << a[i];
}
cout << '\n' << flush;
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
