Submission #1136036

#	Time	Username	Problem	Language	Result	Execution time	Memory
1136036		Zbyszek99	Art Collections (BOI22_art)	C++20	100 / 100	753 ms	472 KiB

art

#include "art.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

void make_step(vi& a)
{
    int x = a.back();
    a.pop_back();
    reverse(all(a));
    a.pb(x);
    reverse(all(a));
}

void solve(int n) 
{
    vi v(n);
    rep(i,n)
    {
        v[i] = n-i;
    }
    ll cur_inv = publish(v);
    vi ans(n,-1);
    rep(i,n-1)
    {
        make_step(v);
        ll new_inv = publish(v);
        int a = (new_inv - cur_inv + n-1)/2;
        ans[a] = v[0];
        cur_inv = new_inv;
    }
    rep(i,n) if(ans[i] == -1) ans[i] = v[n-1];
    answer(ans);
}

• Subtask 1: 5 / 5
• Subtask 2: 15 / 15
• Subtask 3: 15 / 15
• Subtask 4: 15 / 15
• Subtask 5: 20 / 20
• Subtask 6: 30 / 30