oj.uz

답안 #1000721

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1000721 2024-06-18T07:37:00 Z shenfe1 수열 (APIO14_sequence) C++17
100 / 100
 470 ms 88580 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];
vector<ll> dp[2];
int pr[MAX][211];
ll 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];
  }
  k++;

  dp[0]=vector<ll>(MAX,0);
  dp[1]=vector<ll>(MAX,0);

  for(int K=2;K<=k;K++){
    C.init();
    for(int i=K;i<=n;i++){
      C.add(p[i-1],dp[0][i-1]-p[i-1]*p[i-1],i-1);
      dp[1][i]=C.get(p[i]);
      pr[i][K]=C.num[C.pos];
      // cout<<i<<" "<<K<<" "<<pr[i][K]<<"\n";
    }
    swap(dp[0],dp[1]);
  }
  cout<<dp[0][n]<<"\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
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3928 KB contestant found the optimal answer: 108 == 108
2 Correct 1 ms 1880 KB contestant found the optimal answer: 999 == 999
3 Correct 1 ms 1884 KB contestant found the optimal answer: 0 == 0
4 Correct 1 ms 1884 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 1 ms 1880 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 1 ms 1884 KB contestant found the optimal answer: 1 == 1
7 Correct 1 ms 1884 KB contestant found the optimal answer: 1 == 1
8 Correct 1 ms 1884 KB contestant found the optimal answer: 1 == 1
9 Correct 1 ms 3932 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 1 ms 1884 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 1 ms 1884 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 1 ms 1884 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 1 ms 1884 KB contestant found the optimal answer: 140072 == 140072
14 Correct 1 ms 3932 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 1 ms 3940 KB contestant found the optimal answer: 805 == 805
16 Correct 1 ms 1884 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 1 ms 1884 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1884 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 1 ms 1884 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 1 ms 1884 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 1 ms 1884 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 1 ms 1884 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 1 ms 3932 KB contestant found the optimal answer: 933702 == 933702
7 Correct 1 ms 3932 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 1 ms 1884 KB contestant found the optimal answer: 687136 == 687136
9 Correct 1 ms 1884 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 1 ms 3932 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2136 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 2140 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 1 ms 2140 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 3928 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 1 ms 2140 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 1 ms 2140 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 1 ms 2140 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 1 ms 3932 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 2 ms 3932 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 1 ms 2004 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3932 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 2908 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 5 ms 4160 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 2908 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 4 ms 2908 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 4 ms 2908 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 5 ms 2928 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 5 ms 2908 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 2 ms 2908 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 3 ms 2908 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 10588 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 5 ms 11100 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 42 ms 11292 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 5 ms 11292 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 32 ms 10588 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 33 ms 10588 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 37 ms 10780 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 30 ms 10828 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 33 ms 10524 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 41 ms 10776 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 87824 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 42 ms 87856 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 430 ms 88580 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 41 ms 88324 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 470 ms 88072 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 330 ms 87812 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 349 ms 88328 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 289 ms 88580 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 324 ms 88324 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 395 ms 88336 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845