# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
592799 | Blagojce | 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>
#define fr(i, n, m) for(int i = (n); i <= (m); i ++)
#define st first
#define nd second
#define pb push_back
#define pq priority_queue
#define all(x) begin(x), end(x)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
//#include "art.h"
/*
void answer(vector<int> v){
for(auto u : v) cout<<u <<' ';
cout<<endl;
}
long long publish(vector<int> v){
for(auto u : v) cout<<u <<' ';
cout<<endl;
long long c;
cin >> c;
return c;
}
*/
void solve(int N){
vector<int> v;
fr(i, 1, N){
v.pb(i);
}
vector<int> ans(N);
fr(i, 0, N-1) ans[i] = N;
long long XpA = publish(v);
long long ApB = N-1;
fr(i, 0, N-2){
v.pb(v[0]);
v.erase(v.begin());
long long XpB = publish(v);
int pos = (XpA-XpB + ApB)/2;
XpA = XpB;
ans[pos] = v.back();
}
answer(ans);
}/*
int main(){
solve(3);
}*/