| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1340120 | JelalTkm | Carnival (CEOI14_carnival) | C++20 | 0 ms | 444 KiB |
#include "bits/stdc++.h"
using namespace std;
#define int long long
const int N = 2e5 + 10;
const int md = 1e9 + 7;
const int INF = 1e18;
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
int T = 1;
// cin >> T;
while (T--) {
int n;
cin >> n;
vector<int> pref(n + 1), ind, a(n + 1);
int cnt = 2;
pref[1] = 1;
a[1] = 1;
ind.push_back(1);
for (int i = 2; i <= n; i++) {
cout << i << " ";
for (int j = 1; j <= i; j++) {
cout << j << " ";
}
cout << endl;
cin >> pref[i];
if (pref[i] == pref[i - 1]) {
int l = -1, r = (int) ind.size();
while (r - l > 1) {
int mid = (l + r) >> 1;
cout << mid + 2 << " ";
for (int j = 0; j <= mid; j++)
cout << ind[j] << " ";
cout << i << endl;
int x; cin >> x;
cout << mid + 1 << " ";
for (int j = 0; j <= mid; j++)
cout << ind[j] << " ";
cout << endl;
int x1; cin >> x1;
if (x == x1)
r = mid;
else l = mid;
}
a[i] = a[ind[r]];
cout << a[ind[r]] << endl;
} else {
a[i] = cnt++;
ind.push_back(i);
}
}
for (int i = 1; i <= n; i++)
cout << a[i] << " ";
cout << endl;
}
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... | ||||
