oj.uz

답안 #282642

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
282642 2020-08-24T16:33:36 Z jainbot27 수열 (APIO14_sequence) C++17
39 / 100
 2000 ms 32512 KB 
#include <bits/stdc++.h>
using namespace std;
//#define int int64_t
signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n, k;
    cin >> n >> k;
    vector<int> a(n+1), p(n+1);
    for(int i=0; i < n; i++){
        cin >> a[i+1];
        p[i+1] = p[i] + a[i+1];
    }
    vector<vector<int64_t>> dp(n+1, vector<int64_t>(k+1, 0));
    vector<vector<int64_t>> par(n + 1, vector<int64_t>(k + 1, 0));
    int besti, bestj;
    int64_t ans = -1;
    for(int i=1; i <= n; i++){
        for(int j=1; j <= k; j++){
            for(int l = 0; l < i; l++){
                if(dp[i][j] < dp[l][j-1] + (int64_t)(p[i]-p[l]) * (p[n]-p[i])){
                    dp[i][j] = dp[l][j-1] + (int64_t)(p[i] - p[l]) * (p[n] - p[i]);
                    par[i][j] = l;
                }
                if(j==k){
                    if(ans < dp[i][j]){
                        ans = dp[i][j];
                        besti = i; bestj = j;
                    }
                }
                //cerr << "I: " << i << " J: " << j << " K: " << k << " P[i]: " << p[i] << " P[l-1] " << p[l-1] << "\n";
            }
            //cerr << "(" << i << "," << j << ") " << dp[i][j] << "\n";
        }
    }
    cout << ans << "\n";
    assert(bestj == k);
    vector<int> res;
    for(int i=0; i < k; i++){
        res.push_back(besti);
        besti = par[besti][bestj];
        bestj--;
    }
    reverse(res.begin(), res.end());
    for(int i : res){
        cout << i << " ";
    }
    cout << "\n";
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:15:16: warning: 'bestj' may be used uninitialized in this function [-Wmaybe-uninitialized]
   15 |     int besti, bestj;
      |                ^~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 384 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 13 ms 1024 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 384 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 9 ms 768 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Incorrect 14 ms 896 KB Integer 0 violates the range [1, 199]
7 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 512 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 3 ms 512 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 323 ms 3584 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 4 ms 640 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 334 ms 3604 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 280 ms 3072 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 319 ms 3584 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 321 ms 3584 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 71 ms 1024 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 157 ms 1664 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 467 ms 1792 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 269 ms 1792 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Execution timed out 2089 ms 32512 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2058 ms 15232 KB Time limit exceeded
2 Halted 0 ms 0 KB -