Submission #1368075

#	Time	Username	Problem	Language	Result	Execution time	Memory
1368075		gvancak	Art Collections (BOI22_art)	C++20	0 / 100	0 ms	348 KiB

art

#include "art.h"
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define ll long long
using namespace std;

void solve(int n) {
    vector <int> v[n+1],order;
    ll a[n+5],b[n+5];
    for (int i=1; i<=n; i++){
    	v[i].clear();
	}
	int x,y,z;
	
	for (int i=1; i<=n; i++){
		order.clear();
        for (int j=i; j<i+n; j++){
            if (j<=n) order.pb(j); else order.pb(j-n);
        }
        b[i]=publish(order);
	}
    for (int i=1; i<=n; i++){
    	z=i+n-1; if (z>n) z-=n;
        x=b[i]; y=b[z];
        z=y-x;
		y=n-1-z; z=y/2;
		a[z+1]=i;
    }
	order.clear();
	for (int i=1; i<=n; i++) order.pb(a[i]);
	
    answer(order);
}

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