Submission #477486

# Submission time Handle Problem Language Result Execution time Memory
477486 2021-10-02T09:28:51 Z PiejanVDC Split the sequence (APIO14_sequence) C++17
28 / 100
2000 ms 23884 KB
#include <bits/stdc++.h>
using namespace std;

signed main() {
    int n,k; cin>>n>>k;
    vector<int64_t>pref(n+1);
    pref[0]=0;
    for(int i = 0 ; i < n ; i++) {
        int64_t x; cin>>x;
        pref[i+1] = pref[i] + x;
    }
    int res[n+1][k+1];
    int64_t dp[n+1][k+1];
    for(int i = 0 ; i <= n ; i++)
        dp[i][0] = 0;
    for(int i = 1 ; i <= k ; i++)
        dp[0][i] = 0;
    for(int i = 1 ; i <= k ; i++) {
        for(int j = 1 ; j <= n ; j++) {
            dp[j][i] = 0;
            for(int c = 1 ; c < j ; c++) {
                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;
    int node;
    vector<int>ans;
    for(int i = 0 ; i <= n ; i++) {
        if(dp[i][k] > mx) {
            mx=dp[i][k];
            node = i;
        }
    }
    cout << mx << "\n";
     for(int i = 0 ; i < k ; i++) {
        //assert(node > 0);
        ans.push_back(node);
        node = res[node][k - i];
    }
    for(int i = 0 ; i < k ; i++)
        cout << ans[i]-1 << " ";
}
# 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 Incorrect 0 ms 204 KB Integer -1 violates the range [1, 1]
4 Halted 0 ms 0 KB -
# 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 0 ms 204 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 0 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 1 ms 204 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 1 ms 204 KB contestant found the optimal answer: 29000419931 == 29000419931
# 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 8 ms 756 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 588 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Incorrect 8 ms 712 KB Integer 0 violates the range [1, 199]
7 Halted 0 ms 0 KB -
# 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 204 ms 2636 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 3 ms 332 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 242 ms 2636 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 204 ms 2280 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 199 ms 2636 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 201 ms 2756 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 51 ms 716 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 107 ms 1228 KB contestant found the optimal answer: 12345131038664 == 12345131038664
# Verdict Execution time Memory Grader output
1 Correct 314 ms 820 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 245 ms 812 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Execution timed out 2080 ms 23884 KB Time limit exceeded
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 2087 ms 5692 KB Time limit exceeded
2 Halted 0 ms 0 KB -