# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
473734 | zorz | Carnival (CEOI14_carnival) | C++14 | 13 ms | 320 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define pb push_back
#define MOD 1000000007
#define int LL
#define vi vector<long long>
#define pi pair<long long, long long>
int sze[155], ans[155];
vi unq;
main()
{
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n;
cin >> n;
ans[1] = 1;
unq.pb(1);
sze[1] = 1;
int input;
for (int i = 2; i <= n; ++i)
{
cout << i << " ";
for (int j = 1; j <= i; ++j) cout << j << " ";
cout << endl;
cin >> input;
sze[i] = input;
if (sze[i] == sze[i - 1]) // repeat
{
int l = 0, r = unq.size(), mid;
while (l != r)
{
mid = (l + r) / 2;
vi query;
for (int j = l; j <= mid; ++j)
query.pb(unq[j]);
query.pb(i);
cout << query.size() << " ";
for (auto i : query) cout << i << " ";
cout << endl;
cin >> input;
if (input == query.size()) // no repeat
l = mid + 1;
else
r = mid;
}
ans[i] = ans[unq[l]];
}
else
{
unq.pb(i);
ans[i] = unq.size();
}
}
cout << 0 << " ";
for (int i = 1; i <= n; ++i) cout << ans[i] << " ";
cout << endl;
return 0;
}
Compilation message (stderr)
# | 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... |