Submission #1000687

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1000687	2024-06-18T07:15:01 Z	vjudge1	Split the sequence (APIO14_sequence)	C++17	33 / 100	13 ms	4956 KB

sequence

#include <bits/stdc++.h>
 
#define ll long long
#define lb lower_bound
#define pii pair<int,int>
#define pll pair<ll,ll>
#define F first
#define S second
#define ld long double
#define pb push_back
#define all(v) v.begin(),v.end()
#define in insert
#define sz(s) (int)s.size()
#define int ll
#define ppb pop_back

using namespace std;
 
const int MAX=1e5+10;
const int inf=2e9;

int n,k;
int a[MAX];
int dp[211][MAX];
int pr[211][MAX];
int p[MAX];

struct CHT{

  vector<pii> vec;
  vector<int> num;
  int pos;

  void init(){
    pos=0;
    vec.clear();
    num.clear();
  }

  ld inter(pii a,pii b){
    // cout<<b.F<<" "<<a.F<<"\n";
    return (0.0+a.S-b.S)/(b.F-a.F);
  }

  void add(int k,int x,int i){
    // cout<<k<<" "<<x<<"\n";
    if(!vec.empty()&&vec.back().F==k){
      if(vec.back().S<x){
        vec.ppb();
        num.ppb();
      }
      else{
        return;
      }
    }
    while(sz(vec)>=2&&inter(vec.back(),vec[sz(vec)-2])>=inter(vec[sz(vec)-2],{k,x})){
      vec.ppb();
      num.ppb();
    }
    vec.pb({k,x});
    num.pb(i);
    pos=min(pos,sz(vec)-1);
  }

  int get(pii a,int x){
    return a.F*x+a.S;
  }

  int get(int X){
    while(pos+1<sz(vec)&&get(vec[pos],X)<=get(vec[pos+1],X))pos++;
    return get(vec[pos],X);
  }

}C;

void solve(){
  cin>>n>>k;
  for(int i=1;i<=n;i++)cin>>a[i];
  for(int i=1;i<=n;i++){
    p[i]=p[i-1]+a[i];
    dp[i][1]=0;
  }
  for(int K=2;K<=k+1;K++){
    C.init();
    for(int i=K;i<=n;i++){
      C.add(p[i-1],dp[i-1][K-1]-p[i-1]*p[i-1],i-1);
      dp[i][K]=C.get(p[i]);
      pr[i][K]=C.num[C.pos];
      // cout<<i<<" "<<K<<" "<<pr[i][K]<<"\n";
    }
  }
  cout<<dp[n][k+1]<<"\n";
  vector<int> ans;
  int cur=n;
  while(k>=0){
    ans.pb(cur);
    cur=pr[cur][(k+1)];
    k--;
  }
  sort(all(ans));
  ans.ppb();
  for(int x:ans){
    cout<<x;
    if(x!=ans.back())cout<<" ";
  }
}

// #ifdef LOCAL
signed main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t=1;
  // cin>>t;
  while(t--)solve();
}
// #endif

Subtask #1
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	2396 KB	contestant found the optimal answer: 108 == 108
2	Correct	0 ms	348 KB	contestant found the optimal answer: 999 == 999
3	Correct	0 ms	348 KB	contestant found the optimal answer: 0 == 0
4	Correct	1 ms	348 KB	contestant found the optimal answer: 1542524 == 1542524
5	Correct	0 ms	348 KB	contestant found the optimal answer: 4500000000 == 4500000000
6	Correct	0 ms	348 KB	contestant found the optimal answer: 1 == 1
7	Correct	1 ms	348 KB	contestant found the optimal answer: 1 == 1
8	Correct	0 ms	348 KB	contestant found the optimal answer: 1 == 1
9	Correct	1 ms	348 KB	contestant found the optimal answer: 100400096 == 100400096
10	Correct	0 ms	348 KB	contestant found the optimal answer: 900320000 == 900320000
11	Correct	0 ms	348 KB	contestant found the optimal answer: 3698080248 == 3698080248
12	Correct	0 ms	348 KB	contestant found the optimal answer: 3200320000 == 3200320000
13	Correct	1 ms	2396 KB	contestant found the optimal answer: 140072 == 140072
14	Correct	0 ms	348 KB	contestant found the optimal answer: 376041456 == 376041456
15	Correct	1 ms	2396 KB	contestant found the optimal answer: 805 == 805
16	Correct	1 ms	344 KB	contestant found the optimal answer: 900189994 == 900189994
17	Correct	0 ms	348 KB	contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	856 KB	contestant found the optimal answer: 1093956 == 1093956
2	Correct	1 ms	860 KB	contestant found the optimal answer: 302460000 == 302460000
3	Correct	0 ms	860 KB	contestant found the optimal answer: 122453454361 == 122453454361
4	Correct	1 ms	856 KB	contestant found the optimal answer: 93663683509 == 93663683509
5	Correct	0 ms	860 KB	contestant found the optimal answer: 1005304678 == 1005304678
6	Correct	0 ms	860 KB	contestant found the optimal answer: 933702 == 933702
7	Correct	1 ms	860 KB	contestant found the optimal answer: 25082842857 == 25082842857
8	Correct	0 ms	860 KB	contestant found the optimal answer: 687136 == 687136
9	Correct	1 ms	860 KB	contestant found the optimal answer: 27295930079 == 27295930079
10	Correct	0 ms	860 KB	contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2648 KB	contestant found the optimal answer: 610590000 == 610590000
2	Correct	1 ms	2648 KB	contestant found the optimal answer: 311760000 == 311760000
3	Correct	2 ms	3028 KB	contestant found the optimal answer: 1989216017013 == 1989216017013
4	Correct	1 ms	2652 KB	contestant found the optimal answer: 1499437552673 == 1499437552673
5	Correct	2 ms	2904 KB	contestant found the optimal answer: 1019625819 == 1019625819
6	Correct	2 ms	4956 KB	contestant found the optimal answer: 107630884 == 107630884
7	Correct	1 ms	2908 KB	contestant found the optimal answer: 475357671774 == 475357671774
8	Correct	1 ms	2652 KB	contestant found the optimal answer: 193556962 == 193556962
9	Correct	1 ms	2652 KB	contestant found the optimal answer: 482389919803 == 482389919803
10	Correct	1 ms	2652 KB	contestant found the optimal answer: 490686959791 == 490686959791