oj.uz

답안 #750580

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
750580 2023-05-29T18:28:59 Z M_W 수열 (APIO14_sequence) C++17
100 / 100
 845 ms 82004 KB 
#include <bits/stdc++.h>
#define ar array<long long, 3> 
using namespace std;
long long dp[2][100001];
int pos[201][100001], qs[100001];
deque<ar> cht;
int idx = 0;

bool should_pop(ar cur, ar line1, ar line2){
  if(cur[0] == line1[0] && cur[1] > line1[1]) return true; 
  return (line2[1] - cur[1]) * (cur[0] - line1[0]) >= (line1[1] - cur[1]) * (cur[0] - line2[0]);
}

long long f(ar line, long long x){
  return line[0] * x + line[1];
}

pair<long long, int> query(long long x){
  while(idx < cht.size() - 1 && f(cht[idx + 1], x) >= f(cht[idx], x)) cht.pop_front();
  return {f(cht[0], x), cht[0][2]};
}

int main(int argc, char* argv[]){
  int N, K; scanf("%d %d", &N, &K);
  for(int i = 1; i <= N; i++){
    scanf("%d", &qs[i]);
    qs[i] += qs[i - 1];
  }

  long long ans = 0;
  int maxj = 0;

  for(int i = 1; i <= K; i++){
    cht.push_back({qs[i - 1] * 1ll, dp[(i - 1) % 2][i - 1] - (qs[N] * 1ll * (qs[i - 1] * 1ll)), i - 1});
    for(int j = i; j < N; j++){
      long long const_val = qs[j] * 1ll * (qs[N] * 1ll - qs[j] * 1ll); 
      pair<long long, int> res = query(qs[j] * 1ll);

      dp[i % 2][j] = const_val + res.first;
      pos[i][j] = res.second;

      if(dp[i % 2][j] >= ans){
        ans = dp[i % 2][j];
        maxj = j;
      }

      ar cur = {qs[j] * 1ll, dp[(i - 1) % 2][j] - (qs[N] * 1ll * (qs[j] * 1ll)), j};
      while(cht.size() > 1){
        int sz = cht.size();
        if(should_pop(cur, cht[sz - 1], cht[sz - 2])) cht.pop_back();
        else break;
      }
      if(cht.empty() || cur[0] > cht.back()[0] || (cur[0] == cht.back()[0] && cur[1] >= cht.back()[1])) cht.push_back(cur);
    }
    cht.clear();
  }
  printf("%lld\n", ans);
  for(int i = K; i > 0; i--){
    printf("%d ", maxj);
    maxj = pos[i][maxj];
  }
  return 0;
}

Compilation message

sequence.cpp: In function 'std::pair<long long int, int> query(long long int)':
sequence.cpp:19:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<std::array<long long int, 3> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |   while(idx < cht.size() - 1 && f(cht[idx + 1], x) >= f(cht[idx], x)) cht.pop_front();
      |         ~~~~^~~~~~~~~~~~~~~~
sequence.cpp: In function 'int main(int, char**)':
sequence.cpp:24:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |   int N, K; scanf("%d %d", &N, &K);
      |             ~~~~~^~~~~~~~~~~~~~~~~
sequence.cpp:26:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |     scanf("%d", &qs[i]);
      |     ~~~~~^~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 0 ms 340 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 1 ms 1236 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 340 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 1 ms 980 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 2 ms 1236 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 2 ms 1236 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 1 ms 468 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 1 ms 468 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 1 ms 596 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 724 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 2 ms 724 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 61 ms 9300 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 4 ms 724 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 51 ms 5880 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 58 ms 6580 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 61 ms 7136 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 42 ms 5840 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 50 ms 6628 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 63 ms 8392 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 4416 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 18 ms 4272 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 613 ms 82004 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 18 ms 4804 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 845 ms 81568 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 567 ms 58236 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 577 ms 62420 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 453 ms 51272 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 503 ms 58256 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 632 ms 73984 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845