oj.uz

답안 #971169

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
971169 2024-04-28T05:48:52 Z kilkuwu 수열 (APIO14_sequence) C++17
50 / 100
 2000 ms 8728 KB 
#include <bits/stdc++.h>

#define nl '\n'

const int mxN = 1e4 + 5, mxK = 205;
int A[mxN];
int64_t pref[mxN];
int way[mxN][mxK];
int N, K;

signed main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  std::cin >> N >> K;
  for (int i = 1; i <= N; i++) {
    std::cin >> A[i];
    pref[i] = pref[i - 1] + A[i];
  }

  std::vector<int64_t> dp(N + 1, -1e18);
  std::vector<int64_t> ndp(N + 1, -1e18);
  dp[0] = 0;

  for (int j = 1; j <= K + 1; j++) {
    ndp[0] = -1e18;
    for (int i = 1; i <= N; i++) {
      ndp[i] = -1e18;
      for (int k = i - 1; k >= 0; k--) {
        auto cand = dp[k] + (pref[i] - pref[k]) * pref[k];
        if (ndp[i] < cand) {
          ndp[i] = cand;
          way[i][j] = k;
        }
      }  
    }

    std::swap(dp, ndp);
  }

  std::cout << dp[N] << nl;
  std::vector<int> ans;

  int x = N;
  int y = K + 1;
  while (x > 0 && y > 1) {
    ans.push_back(way[x][y]);
    x = way[x][y];
    y--;
  }

  for (int i : ans) std::cout << i << " ";
  std::cout << nl;

}


/*
7 3
4 1 3 4 0 2 3
*/

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 Correct 1 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 344 KB contestant found the optimal answer: 1 == 1
8 Correct 1 ms 344 KB contestant found the optimal answer: 1 == 1
9 Correct 1 ms 504 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 0 ms 344 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 0 ms 348 KB contestant found the optimal answer: 140072 == 140072
14 Correct 0 ms 348 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 0 ms 344 KB contestant found the optimal answer: 805 == 805
16 Correct 1 ms 348 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

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2808 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 3 ms 2652 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 74 ms 2848 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 2 ms 2652 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 78 ms 2704 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 70 ms 2648 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 78 ms 2708 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 75 ms 2704 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 17 ms 2720 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 32 ms 2648 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 228 ms 8728 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 192 ms 8484 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Execution timed out 2058 ms 8532 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 760 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -