| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1368066 | gvancak | Art Collections (BOI22_art) | C++20 | 0 ms | 0 KiB |
//#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];
for (int i=1; i<=n; i++){
v[i].clear();
}
int x,y,z;
for (int i=1; i<=n; i++){
order.clear();
order.pb(i);
for (int j=1; j<=n; j++){
if (j==i) continue;
order.pb(j);
}
x=publish(order);
for (int j=1; j<order.size(); j++) order[j-1]=order[j];
order[order.size()-1]=i;
y=publish(order);
z=y-x;
cout<<x<<" "<<y<<endl;
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);
}