# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
617123 | Andyvanh1 | 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 "art.h"
#include <bits/stdc++.h>
using namespace std;
#define vt vector
#define pb push_back
#define all(x) x.begin(),x.end()
#define FORR1(x) for(int i = 0; i < (x); i++)
#define FORR2(j,x) for(int (j) = 0; (j) < (x); (j)++)
#define f first
#define s second
#define MOD 998244353
typedef vt<int> vi;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
//
// --- Sample implementation for the task art ---
//
// To compile this program with the sample grader, place:
// art.h art_sample.cpp sample_grader.cpp
// in a single folder, then open the terminal in this directory (right-click onto an empty spot in the directory,
// left click on "Open in terminal") and enter e.g.:
// g++ -std=c++17 art_sample.cpp sample_grader.cpp
// in this folder. This will create a file a.out in the current directory which you can execute from the terminal
// as ./a.out
// See task statement or sample_grader.cpp for the input specification
//
void solve(int N) {
vi ans(N);
vi cur;
FORR1(N)cur.pb(i+1);
int vb = publish(cur);
cout.flush();
FORR1(N-1){
cur.clear();
FORR2(j,i){
cur.pb(j+1);
}
for(int j = i+1; j < N; j++){
cur.pb(j+1);
}
cur.pb(i+1);
int fr = publish(cur);
int m = N-1-i;
ans[i] = (fr-vb+m)/2;
}
ans[N-1] = 0;
vi anss = {N};
for(int i = N-2; i>=0; i--){
vi cop;
for(int j = 0; j < N-1-i-ans[i]; j++){
cop.pb(anss[j]);
}
cop.pb(i+1);
for(int j = N-1-i-ans[i]; j < N-1-i; j++){
cop.pb(anss[j]);
}
anss = cop;
}
answer(anss);
}
int main(){
int N;
cin>>N;
solve(N);
return 0;
}