# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
520281 | krit3379 | Split the sequence (APIO14_sequence) | C++14 | 77 ms | 7136 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>
using namespace std;
#define N 100005
struct A{
long long a,b,c;
bool operator<(const A& o)const{
return c>o.c;
}
};
long long val[N],l[N],r[N],qs[N],a,b,c,ans;
int p[N];
priority_queue<A> q;
int fp(int v){return (v==p[v])?v:p[v]=fp(p[v]);}
int main(){
int n,k,i,j,st;
scanf("%d %d",&n,&k);
st=n;
iota(p,p+n+1,0);
for(i=1;i<=n;i++)scanf("%lld",&val[i]),qs[i]=qs[i-1]+val[i],ans+=val[i]*qs[i-1],l[i]=r[i]=i;
for(i=1;i<n;i++)q.push({i,i+1,val[i]*val[i+1]});
while(st!=k+1){
a=q.top().a;
b=q.top().b;
c=q.top().c;
q.pop();
if(val[fp(a)]*val[fp(b)]!=c)continue;
val[fp(a)]+=val[fp(b)];
l[fp(a)]=min(l[fp(a)],l[fp(b)]);
r[fp(a)]=max(r[fp(a)],r[fp(b)]);
p[fp(b)]=fp(a);
if(r[fp(a)]!=1)q.push({fp(a),fp(l[fp(a)]-1),val[fp(a)]*val[fp(l[fp(a)]-1)]});
if(r[fp(a)]!=n)q.push({fp(a),fp(r[fp(a)]+1),val[fp(a)]*val[fp(r[fp(a)]+1)]});
ans-=c;
st--;
}
printf("%lld\n",ans);
for(i=1;r[fp(i)]<n;i++){
printf("%d ",r[fp(i)]);
i=r[fp(i)];
}
return 0;
}
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... |