oj.uz

Submission #1000715

# Submission time Handle Problem Language Result Execution time Memory
1000715 2024-06-18T07:33:52 Z shenfe1 Split the sequence (APIO14_sequence) C++17
0 / 100
 46 ms 131072 KB 
#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];
ll dp[MAX][211];
int pr[MAX][211];
int p[MAX];

struct CHT{

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

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

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

  void add(ll k,ll x,int i){
    // cout<<k<<" "<<x<<"\n";
    while(!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);
  }

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

  ll get(ll 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;
  }
  k++;
  for(int K=2;K<=k;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]<<"\n";
  vector<int> ans;
  int cur=n;
  while(k>0){
    ans.pb(cur);
    cur=pr[cur][k];
    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
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 0 ms 348 KB contestant found the optimal answer: 1542524 == 1542524
5 Incorrect 0 ms 348 KB declared answer doesn't correspond to the split scheme: declared = 30269803776, real = 4500000000
6 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 1 ms 604 KB contestant found the optimal answer: 302460000 == 302460000
3 Incorrect 1 ms 604 KB declared answer doesn't correspond to the split scheme: declared = 4155427745305, real = 122453454361
4 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 860 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 860 KB contestant found the optimal answer: 311760000 == 311760000
3 Incorrect 1 ms 860 KB declared answer doesn't correspond to the split scheme: declared = 266542021581429, real = 1989216017013
4 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 2968 KB contestant found the optimal answer: 140412195 == 140412195
3 Incorrect 5 ms 2908 KB declared answer doesn't correspond to the split scheme: declared = 16195970589416914, real = 17902527208914
4 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 25436 KB declared answer doesn't correspond to the split scheme: declared = 10285334592, real = 1695400000
2 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Runtime error 46 ms 131072 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -