oj.uz

답안 #651486

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
651486 2022-10-19T01:41:56 Z pauloamed 수열 (APIO14_sequence) C++17
100 / 100
 1305 ms 102576 KB 
#include<bits/stdc++.h>
using namespace std;

#define int long long

const int MAXN = 100010;
const int MAXK = 250;

int S[MAXN], wS[MAXN];

int query(int l, int r){
  int a = S[r];
  int b = S[r] - ((l == 0)? 0 : S[l - 1]);
  int c = wS[r] - ((l == 0)? 0 : wS[l - 1]);
  return a * b - c;
}

int last_dp[MAXN];
int curr_dp[MAXN];
signed ans[MAXN][MAXK];

int get_dp(int i){
  if(i < 0) return 0;
  else return last_dp[i];
}


int K;
void solve(int l, int r, int searchL, int searchR){
  if(l > r) return;
  int j = (l + r) / 2;
  if(curr_dp[j] == -1){
    int validR = min(j, searchR);
    pair<int,int> best = {LLONG_MAX, -1LL};
    for(int k = searchL; k <= validR; ++k){
      int x = query(k, j) + get_dp(k - 1);
      if(x <= best.first) best = {x, k};
    }
    curr_dp[j] = best.first;
    ans[j][K] = best.second;
    solve(l, j - 1, searchL, best.second);
    solve(j + 1, r, best.second, searchR);
  }
}

int32_t main(){
  int n, k; cin >> n >> k;
  vector<int> v(n); for(auto &x : v) cin >> x;

  int tot = 0;
  for(int i = 0; i < n; ++i){
    S[i] = v[i];
    if(i){
      S[i] += S[i - 1];
      tot += v[i] * S[i - 1];
    }
  }

  for(int i = 0; i < n; ++i){
    wS[i] = S[i] * v[i];
    if(i) wS[i] += wS[i - 1];
  }

  // for(int i = 0 ; i < n; ++i){
  //   for(int j = i; j < n; ++j){
  //     cout << i << " " << j << " : " << query(i, j) << "\n";
  //   }
  // }

  for(int i = 0; i < n; ++i){
    last_dp[i] = query(0, i);
  }

  for(K = 0; K < k; ++K){
    memset(curr_dp, -1, sizeof curr_dp);
    solve(0, n - 1, 0, n - 1);
    swap(curr_dp, last_dp);

    // for(int i = 0; i < n; ++i){
    //   cout << i << " : " << ans[i][k].first << " " << ans[i][k].second << "\n";
    // }
    // cout << "=-=-=-=-=-=-\n";
  }

  cout << tot - last_dp[n - 1] << "\n";
  // cout << tot << " " << last_dp[n - 1] << "\n";

  auto curr = n;
  for(int i = 0; i < k; ++i){
    // nao eh isso o rte
    curr = ans[curr - 1][k - i - 1];
    cout << curr << " ";
  }
  cout << "\n";
}

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2004 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 2004 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 24 ms 2088 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 2 ms 2004 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 16 ms 2004 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 19 ms 2004 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 21 ms 2092 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 5 ms 2004 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 5 ms 2080 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 8 ms 2004 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2772 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 3 ms 2772 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 28 ms 2772 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 2 ms 2884 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 26 ms 2888 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 24 ms 2884 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 26 ms 2772 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 27 ms 2876 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 7 ms 2772 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 14 ms 2888 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 11860 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 8 ms 11860 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 99 ms 11900 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 9 ms 11888 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 73 ms 11892 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 86 ms 11832 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 94 ms 11888 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 62 ms 11860 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 73 ms 11896 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 102 ms 11884 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 101956 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 75 ms 102168 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 1154 ms 102576 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 83 ms 102448 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1305 ms 102252 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 952 ms 102264 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 1045 ms 102576 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 815 ms 102436 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 866 ms 102452 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 1090 ms 102416 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845