oj.uz

Submission #515919

# Submission time Handle Problem Language Result Execution time Memory
515919 2022-01-20T06:28:03 Z jk410 Split the sequence (APIO14_sequence) C++17
28 / 100
 2000 ms 2636 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF=9e18;
int N,K;
int Prev[201][1001];
ll A[1001],DP[201][1001];
stack<int> S;
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin>>N>>K;
    for (int i=1; i<=N; i++){
        cin>>A[i];
        A[i]+=A[i-1];
    }
    for (int t=1; t<=K; t++){
        for (int i=1; i<=N; i++){
            for (int j=1; j<=i; j++){
                if (DP[t][i]<DP[t-1][j]+(A[i]-A[j])*A[j]){
                    DP[t][i]=DP[t-1][j]+(A[i]-A[j])*A[j];
                    Prev[t][i]=j;
                }
            }
        }
    }
    cout<<DP[K][N]<<"\n";
    for (int t=K,i=N; t; t--){
        if (!Prev[t][i])
            break;
        if (Prev[t][i]!=i)
            S.push(Prev[t][i]);
        i=Prev[t][i];
    }
    while (!S.empty()){
        cout<<S.top()<<" ";
        S.pop();
    }
    return 0;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB contestant found the optimal answer: 108 == 108
2 Correct 0 ms 332 KB contestant found the optimal answer: 999 == 999
3 Incorrect 1 ms 204 KB Unexpected end of file - int32 expected
4 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

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

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 0 ms 332 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 7 ms 2124 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 0 ms 332 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 5 ms 1612 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Incorrect 7 ms 1996 KB Unexpected end of file - int32 expected
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 368 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 111 ms 2636 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 2 ms 332 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 185 ms 2556 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 145 ms 2244 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 115 ms 2540 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 113 ms 2572 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 34 ms 740 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 74 ms 1232 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 202 ms 472 KB declared answer doesn't correspond to the split scheme: declared = 2537128570462672602, real = 836936663
2 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

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