# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1079888 | Thanhs | Library (JOI18_library) | C++14 | 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<library.h>
#include <bits/stdc++.h>
using namespace std;
// #define int long long
// #define double long double
// #define endl '\n'
#define fastIO ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#define setmin(x, y) x = min((x), (y))
#define setmax(x, y) x = max((x), (y))
#define sqr(x) ((x) * (x))
#define fi first
#define se second
#define aint(x) x.begin(), x.end()
// mt19937 hdp(chrono::high_resolution_clock::now().time_since_epoch().count());
// int rand(int l, int r){return l + ((hdp() % (r - l + 1)) + r - l + 1) % (r - l + 1);}
const int NM = 1e3 + 5;
vector<int> g[NM];
set<int> s;
// int Query(vector<int>& v)
// {
// cout << "? ";
// for (int t : v)
// cout << t << ' ';
// cout << endl;
// int res;
// cin >> res;
// return res;
// }
// void Answer(vector<int>& v)
// {
// cout << "! ";
// for (int t : v)
// cout << t << ' ';
// cout << endl;
// }
int N;
int ask(int x, int y)
{
vector<int> t(N, 0);
if (y)
t[y] = 1;
auto it = s.begin();
for (int i = 1; i <= x; i++, it = next(it))
t[*it] = 1;
return Query(t);
}
int get(int x)
{
auto it = s.begin();
x--;
while (x--)
it = next(it);
return *it;
}
void Solve(int n)
{
N = n;
if (n == 1)
{
vector<int> t(1, 1);
Answer(t);
return;
}
for (int i = 1; i <= n; i++)
s.insert(i);
for (int i = 1; i <= n; i++)
{
vector<int> tmp;
s.erase(i);
if (s.empty())
break;
while (g[i].size() < 2)
{
if (ask(s.size(), i) != ask(s.size(), 0))
break;
int l = 0, r = s.size();
while (l < r - 1)
{
int m = l + r >> 1;
if (ask(m, i) == ask(m, 0))
r = m;
else
l = m;
}
int t = get(r);
g[i].push_back(t);
g[t].push_back(i);
tmp.push_back(t);
s.erase(t);
}
for (int t : tmp)
s.insert(t);
}
for (int i = 1; i <= n; i++)
if (g[i].size() == 1)
{
vector<int> res;
s.insert(i);
int u = i;
while (1)
{
res.push_back(u);
bool b = 0;
for (auto v : g[u])
if (s.find(v) == s.end())
{
b = 1;
u = v;
break;
}
s.insert(u);
if (!b)
break;
}
Answer(res);
return;
}
}
int main()
{
int n;
cin >> n;
Solve(n);
}