QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#843366 | #9963. Express Rotations | ucup-team3586# | TL | 54ms | 19036kb | C++23 | 2.2kb | 2025-01-04 18:19:01 | 2025-01-04 18:19:02 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int N=5e5+10;
#define ll long long
ll F[N],G[N],f[N],g[N],t[N];
vector<int>h[N<<1];
const int P=1e6+1;
const ll I=1e18;
void ad(ll &x,ll y){if(x>y)x=y;}
ll s[N],S;
void doi(int n,ll w){
if(n==1){G[1]=F[1];return;}
t[0]=0;
for(int i=1;i<=n;i++)s[i]=s[i-1]+t[i-1],G[i]=I;
t[0]=t[n],S=s[n]+t[n];
/*ll p1=I,p2=I;
for(int i=1;i<=n;i++){
ad(G[i],p1+s[i]-t[i-1]*2+S+w*(n-i));
ad(G[i],p2-s[i]+S*2-t[i]*2+w*(n-i-1));
ad(p1,F[i]-s[i]+w*i),ad(p2,F[i]+s[i]+w*i);
}
p1=p2=I;
for(int i=n;i;i--){
ad(G[i],p1+S*2+s[i]-t[i-1]*2-w*i);
ad(G[i],p2-s[i]-t[i]*2+S+w*(i-1));
ad(p1,F[i]-s[i]+w*i);
ad(p2,F[i]+s[i]+w*i);
}*/
for(int i=1;i<n;i++)for(int j=i+1;j<=n;j++)
ad(G[j],F[i]+s[j]-s[i]-t[j-1]*2+w*(n-j+i)+S),
ad(G[j],F[i]+S-s[j]+s[i]-t[j]*2+w*(n-j+i-1)+S),
ad(G[i],F[j]+S-s[j]+s[i]-t[i-1]*2+w*(j-i)+S),
ad(G[i],F[j]+s[j]-s[i]-t[i]*2+w*(j-i-1)+S);
}
#define pb push_back
ll tr[N];int n;
void ADD(int x,ll z){
for(;x<=n;x+=(x&-x))tr[x]+=z;
}
ll ask(int x){
ll s=0;
for(;x;x-=(x&-x))s+=tr[x];
return s;
}
ll ab(int l,int r){
if(l<r)return ask(r)-ask(l);
return ask(n)-(ask(l)-ask(r));
}
int a[N];
int main(){
scanf("%d",&n);n++;
a[1]=P;
for(int i=2;i<=n;i++)scanf("%d",&a[i]);
for(int i=1;i<=n;i++)ADD(i,a[i]),h[a[i]].pb(i);
int w=0;
for(int i=1;i<=n;i++)f[i]=g[i]=I;
for(int i=P;i;i--)if(!h[i].empty()){
for(int x:h[i])ADD(x,-i);
if(!w){w=i,f[1]=g[1]=0;continue;}
int sz=h[i].size();
for(int x:h[w]){
int o=lower_bound(h[i].begin(),h[i].end(),x)-h[i].begin();
int q=(o<sz)?h[i][o]:h[i][0];
ad(f[q],g[x]+ab(x,q));
o--;
q=(o>=0)?h[i][o]:h[i][sz-1];
ad(f[q],g[x]+ab(q,x)+i);
}
for(int j=0;j<sz;j++)t[j+1]=ab(h[i][j],h[i][(j+1)%sz]),F[j+1]=f[h[i][j]];
doi(sz,i);
for(int j=0;j<sz;j++)g[h[i][j]]=G[j+1];
w=i;
}
ll ans=I;
for(int x:h[w])ad(ans,g[x]);
printf("%lld",ans);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 14144kb
input:
6 6 10 6 5 4 5
output:
16
result:
ok 1 number(s): "16"
Test #2:
score: 0
Accepted
time: 0ms
memory: 14076kb
input:
1 525434
output:
0
result:
ok 1 number(s): "0"
Test #3:
score: 0
Accepted
time: 0ms
memory: 14180kb
input:
20 724315 660084 703741 660084 33388 703741 724315 608476 703741 33388 660084 33388 703741 703741 724315 33388 660084 703741 703741 33388
output:
10450373
result:
ok 1 number(s): "10450373"
Test #4:
score: 0
Accepted
time: 0ms
memory: 14204kb
input:
1000 205212 781871 811133 847754 365647 686203 781871 811133 205212 811133 365647 553550 205212 365647 811133 205212 205212 781871 875225 781871 365647 344701 205212 875225 365647 365647 811133 781871 875225 811133 781871 365647 553550 686203 365647 79214 553550 686203 781871 781871 875225 811133 20...
output:
1703022119
result:
ok 1 number(s): "1703022119"
Test #5:
score: 0
Accepted
time: 0ms
memory: 17788kb
input:
1000 301641 35540 535041 598876 422289 932926 891853 928749 403425 515013 323155 468767 875308 397761 252409 674812 40987 889920 172600 98116 799381 718712 739731 228116 729441 314232 916892 391198 205018 977734 406583 970126 527675 752117 616274 614112 241590 226939 726732 976461 657267 705600 9482...
output:
40529669812
result:
ok 1 number(s): "40529669812"
Test #6:
score: 0
Accepted
time: 54ms
memory: 19036kb
input:
100000 94951 895049 212507 728671 498212 74168 617364 727973 327553 437083 222970 617364 575451 478998 352348 386134 274500 366753 57576 139115 368828 29040 930954 301558 521133 343205 520174 291315 53520 354416 89181 852743 480847 499918 602700 770649 61483 524841 957354 355385 376270 327553 402615...
output:
8404763653182
result:
ok 1 number(s): "8404763653182"
Test #7:
score: -100
Time Limit Exceeded
input:
500000 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770 96770...