oj.uz

Submission #786282

# Submission time Handle Problem Language Result Execution time Memory
786282 2023-07-18T06:06:49 Z coding_snorlax Split the sequence (APIO14_sequence) C++14
50 / 100
 2000 ms 36108 KB 
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
//dp[i][k] : from 1-i, cut k line max answer
//dp[i][k] = (List[i]+List[i-1]+...+List[j])^2 + dp[j-1][k-1]
//dp[i][0] = (List[i]+...+List[0])^2
//sigma(block[i][j]) = [sigma([i])^2-sigma([i]^2)]//2
vector<ll> List={};
vector<ll> prefix={0};
ll dp[10002][202]={{0}};
ll back_track[10002][202]={{0}};
// dp[i][j][k] : from i to j cut k times max answer
//vector<int> answer;
void Find_answer(int i,int k){
    //cout << i << " " << j << " " << k << "\n";
    if(k==0) return;
    cout << back_track[i][k] << " ";
    //answer.push_back(back_track[i][j][k][0]+1);
    Find_answer(back_track[i][k]-1,k-1);
}

int main(){
    ll N,K;
    cin>>N>>K;
    for(int i=0;i<N;i++){
        ll num;
        cin>>num;
        List.push_back(num);
        prefix.push_back(prefix.back()+num);
    }
    for(int i=0;i<N;i++){
        for(int k=0;k<=K;k++){
            dp[i][k] = 100000000000000; ;
        }
    }
    for(int i=0;i<N;i++) dp[i][0]=(prefix[i+1]-prefix[0]) * (prefix[i+1]-prefix[0]) ;

    for(int k=1;k<=K;k++){
        for(int i=0;i<N;i++){
            for(int j=k-1;j<i;j++){
                ll Now = dp[j][k-1]+(prefix[i+1]-prefix[j+1])*(prefix[i+1]-prefix[j+1]);
                //cout <<"i j k" << i << " " << j << " " << k << " " << Now << "\n";
                if(Now < dp[i][k]){
                    back_track[i][k] = j+1;
                    dp[i][k] = Now;
                }
            }
            //cout <<"dp["<<i<<"]["<<k <<"]: " << back_track[i][k] << "\n";
        }
        //cout << "\n";
    }
    cout<<((prefix[N]-prefix[0])*(prefix[N]-prefix[0])-dp[N-1][K])/2<<"\n";
    Find_answer(N-1,K);
}

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3412 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 3 ms 3412 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 95 ms 3480 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 4 ms 3412 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 107 ms 3412 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 82 ms 3412 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 98 ms 3476 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 100 ms 3476 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 23 ms 3412 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 42 ms 3412 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 355 ms 32140 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 435 ms 32140 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Execution timed out 2058 ms 22864 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Runtime error 35 ms 36108 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -