oj.uz

Submission #477525

# Submission time Handle Problem Language Result Execution time Memory
477525 2021-10-02T11:50:00 Z PiejanVDC Split the sequence (APIO14_sequence) C++17
39 / 100
 2000 ms 31820 KB 
#include <bits/stdc++.h>
using namespace std;

signed main() {
    int64_t n,k; cin>>n>>k;
    vector<int64_t>pref(n+1);
    pref[0]=0;
    for(int64_t i = 0 ; i < n ; i++) {
        int64_t x; cin>>x;
        pref[i+1] = pref[i] + x;
    }
    int64_t res[n+1][k+1];
    int64_t dp[n+1][k+1];
    for(int64_t i = 0 ; i <= n ; i++)
        dp[i][0] = 0;
    for(int64_t i = 1 ; i <= k ; i++)
        dp[0][i] = 0;
    for(int64_t i = 1 ; i <= k ; i++) {
        for(int64_t j = 1 ; j <= n ; j++) {
            dp[j][i] = 0;
            for(int64_t c = 1 ; c < j ; c++) {
                //assert(c-1 >= 0 && i-1 >= 0 && j-1 >= 0);
                if(dp[c][i-1] + (pref[n] - pref[j-1]) * (pref[j-1] - pref[c-1]) > dp[j][i]) {
                    res[j][i] = c;
                }
                dp[j][i] = max(dp[j][i],dp[c][i-1] + (pref[n] - pref[j-1]) * (pref[j-1] - pref[c-1]));
            }
        }
    }
    int64_t mx=0;
    int64_t node;
    vector<int64_t>ans;
    for(int64_t i = 0 ; i <= n ; i++) {
        if(dp[i][k] >= mx) {
            mx=dp[i][k];
            node = i;
        }
    }
    cout << mx << "\n";
     for(int64_t i = 0 ; i < k ; i++) {
        assert(node > 0);
        ans.push_back(node);
        node = res[node][k - i];
    }
    for(int64_t i = k-1 ; i >= 0 ; i--)
        cout << ans[i]-1 << " ";
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB contestant found the optimal answer: 108 == 108
2 Correct 0 ms 204 KB contestant found the optimal answer: 999 == 999
3 Correct 0 ms 204 KB contestant found the optimal answer: 0 == 0
4 Correct 0 ms 204 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 0 ms 204 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 0 ms 204 KB contestant found the optimal answer: 1 == 1
7 Correct 0 ms 204 KB contestant found the optimal answer: 1 == 1
8 Correct 0 ms 204 KB contestant found the optimal answer: 1 == 1
9 Correct 0 ms 204 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 1 ms 204 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 0 ms 204 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 0 ms 204 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 0 ms 204 KB contestant found the optimal answer: 140072 == 140072
14 Correct 0 ms 204 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 1 ms 204 KB contestant found the optimal answer: 805 == 805
16 Correct 1 ms 204 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 0 ms 204 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 0 ms 204 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 1 ms 332 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 0 ms 204 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 0 ms 204 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 1 ms 204 KB contestant found the optimal answer: 933702 == 933702
7 Correct 1 ms 204 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 1 ms 204 KB contestant found the optimal answer: 687136 == 687136
9 Correct 0 ms 204 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 0 ms 204 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 0 ms 204 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 7 ms 844 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 204 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 6 ms 716 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Runtime error 8 ms 1520 KB Execution killed with signal 6
7 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 332 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 3 ms 332 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 196 ms 3404 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 3 ms 332 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 249 ms 3420 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 190 ms 2956 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 194 ms 3524 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 194 ms 3420 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 46 ms 844 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 102 ms 1484 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 295 ms 972 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 221 ms 972 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Execution timed out 2085 ms 31820 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2098 ms 7228 KB Time limit exceeded
2 Halted 0 ms 0 KB -