# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
579593 | Elias | Art Collections (BOI22_art) | C++17 | 0 ms | 0 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>
#ifndef _DEBUG
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#endif
using namespace std;
#define lint int64_t
#ifdef _DEBUG
int publish(vector<int> R)
{
for (int i : R)
cout << i << " ";
cout << "\n";
int x;
cin >> x;
return x;
}
void answer(vector<int> R)
{
cout << "Answer: ";
for (int i : R)
cout << i << " ";
cout << "\n";
}
#endif
void solve(int N)
{
int n = N;
vector<int> position(n);
vector<int> empty(n);
for (int i = 0; i < n; i++)
empty[i] = i + 1;
map<vector<int>, int> answers;
for (int i = 0; i < n; i++)
{
vector<int> queryA = empty;
vector<int> queryB = empty;
swap(queryA.back(), queryA[i]);
swap(queryB[0], queryB[i]);
int a, b;
if (answers.count(queryA))
a = answers[queryA];
else
a = answers[queryA] = publish(queryA);
if (answers.count(queryB))
b = answers[queryB];
else
b = answers[queryB] = publish(queryB);
int diff = b - a;
int pos = (n + diff - 1) / 2;
position[i] = pos;
}
vector<int> sol(n);
for (int i = 0; i < n; i++)
{
sol[position[i]] = i + 1;
}
answer(sol);
}
int main()
{
int n;
cin >> n;
solve(n);
}