| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 604295 | krit3379 | Art Collections (BOI22_art) | C++17 | 1588 ms | 648 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;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define N 10005
int pos[N],fen[N],mi=1e9;
vector<int> v;
void upd(int x,int k){
while(x<N){
fen[x]+=k;
x+=x&-x;
}
}
int sol(int x){
int ans=0;
while(x){
ans+=fen[x];
x-=x&-x;
}
return ans;
}
int lower(int x){
int l=1,r=N-1,mid,pos;
while(l<=r){
mid=(l+r)/2;
if(sol(mid)>=x)pos=mid,r=mid-1;
else l=mid+1;
}
return pos;
}
void solve(int n){
int i,m=5000,pre,now;
for(i=1;i<=n;i++)v.push_back(i);
for(i=1;i<N;i++)fen[i]=i&-i;
pre=publish(v);
pos[1]=m;
upd(pos[1],-1);
for(i=n-1;i>0;i--){
swap(v[0],v[i]);
now=publish(v);
int val=(now-pre)/2+(now-pre)/abs(now-pre);
if(val<0)val++;
pos[v[0]]=lower(sol(pos[v[i]])+val);
upd(pos[v[0]],-1);
pre=now;
}
for(i=1;i<=n;i++)mi=min(mi,pos[i]);
for(i=1;i<=n;i++)pos[i]-=mi;
for(i=1;i<=n;i++)v[pos[i]]=i;
answer(v);
return ;
}
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... | ||||
