# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
600878 | CSQ31 | Art Collections (BOI22_art) | C++17 | 1541 ms | 708 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;
// --- 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){
//find inversion sequence
vector<int>q(n),qq(n);
for(int i=0;i<n;i++)q[i] = i+1;
int cur = publish(q);
vector<int>inv(n);
for(int i=1;i<n;i++){
qq = q;
for(int j=i;j>0;j--)qq[j] = qq[j-1];
qq[0] = q[i];
int ncur = publish(qq);
//a = #bigger than p(i)
//b = #smaller than p(i);
//a+b = i
//cur - ncur = a-b
inv[i] = i + (cur-ncur);
inv[i]/=2;
}
//for(int i=0;i<n;i++)cout<<inv[i]<<" ";
//cout<<'\n';
vector<bool>used(n+1,0);
vector<int>ans(n),p(n);
for(int i=n-1;i>=0;i--){
for(int j=n;j>=1;j--){
if(used[j])continue;
if(!inv[i]){
ans[i] = j;
used[j] = 1;
break;
}
inv[i]--;
}
}
for(int i=0;i<n;i++)p[ans[i]-1] = i+1;
answer(p);
}
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... |