# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
954196 | PM1 | Art Collections (BOI22_art) | C++17 | 1 ms | 344 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>
#include "art.h"
using namespace std;
const int mxn=4e3+5;
void solve(int n){
bool mark[mxn];
vector<int>ans,fake;
for(int i=1;i<=n;i++){
ans.push_back(i);
fake.push_back(i);
}
int now=publish(ans);
for(int i=1;i<n;i++){
for(int j=0;j<n;j++){
if(mark[ans[j]])
assert(0);
mark[ans[j]]=1;
fake[j]=ans[j];
}
memset(mark,0,sizeof mark);
int x=fake[i];
auto it=fake.begin()+i;
fake.erase(it);
it=fake.begin();
fake.insert(it,x);
int y=publish(fake);
int z=y-now;
z++;
if(z==i+1)continue;
it=ans.begin()+i;
ans.erase(it);
it=ans.begin()+z;
ans.insert(it,x);
now--;
}
answer(ans);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |