oj.uz

Submission #960874

# Submission time Handle Problem Language Result Execution time Memory
960874 2024-04-11T07:05:57 Z vjudge1 Split the sequence (APIO14_sequence) C++17
50 / 100
 2000 ms 12376 KB 
#include<bits/stdc++.h>
using namespace std;
long long dp[1010][1010],from[1010][1010],pre[1010];
int main(){
    int n,k;
    cin>>n>>k;
    for(int i=1;i<=n;i++)
        cin>>pre[i],pre[i]+=pre[i-1];
    memset(dp,-2,sizeof dp);
    for(int i=1;i<=n;i++)
        dp[0][i]=0;
    for(int i=1;i<=k;i++)
        for(int j=1;j<=n;j++)
            for(int c=0;c<j;c++)
                if(dp[i][j]<dp[i-1][c]+(pre[j]-pre[c])*pre[c])
                    dp[i][j]=dp[i-1][c]+(pre[j]-pre[c])*pre[c],from[i][j]=c;
    cout<<dp[k][n]<<'\n';
    stack<int>stk;
    while(k)
        stk.push(n=from[k--][n]);
    while(stk.size())
        cout<<stk.top()<<' ',stk.pop();
}

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10076 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 2 ms 10076 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 6 ms 12124 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 2 ms 10072 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 6 ms 12124 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 6 ms 12376 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 6 ms 12120 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 3 ms 12124 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 3 ms 12124 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 4 ms 12324 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 10076 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 4 ms 10076 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 97 ms 12280 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 4 ms 10076 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 123 ms 12300 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 101 ms 12120 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 102 ms 12284 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 98 ms 12280 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 24 ms 12164 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 43 ms 12124 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 192 ms 10072 KB declared answer doesn't correspond to the split scheme: declared = 43558973, real = 1021695167
2 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

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