Submission #126940

# Submission time Handle Problem Language Result Execution time Memory
126940 2019-07-08T16:21:04 Z AQT Split the sequence (APIO14_sequence) C++14
100 / 100
1787 ms 83548 KB
#include <bits/stdc++.h>

using namespace std;

int N, K;
long long pre[100005];
long long dp[100005][2];
int par[100005][205];

inline void solve(int l, int r, int lb, int ub, int lvl){
    if(l > r){
        return;
    }
    int mid = l+r>>1;
    for(int i = lb; i<=min(mid-1, ub); i++){
        if(dp[mid][lvl&1] <= dp[i][lvl&1^1] + pre[i]*(pre[mid] - pre[i])){
            dp[mid][lvl&1] = dp[i][lvl&1^1] + pre[i]*(pre[mid] - pre[i]);
            par[mid][lvl] = i;
        }
    }
    solve(l, mid-1, lb, par[mid][lvl], lvl);
    solve(mid+1, r, par[mid][lvl], ub, lvl);
}

int main(){
    cin.sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> N >> K;
    for(int i = 1; i<=N; i++){
        cin >> pre[i];
        pre[i] += pre[i-1];
    }
    for(int k = 1; k<=K; k++){
        solve(k+1, N, k, N, k);
    }
    cout << dp[N][K&1] << "\n";
    int crnt = N;
    for(int k = K; k>=1; k--){
        cout << par[crnt][k] << " ";
        crnt = par[crnt][k];
    }
    cout << "\n";
}

Compilation message

sequence.cpp: In function 'void solve(int, int, int, int, int)':
sequence.cpp:14:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     int mid = l+r>>1;
               ~^~
sequence.cpp:16:39: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
         if(dp[mid][lvl&1] <= dp[i][lvl&1^1] + pre[i]*(pre[mid] - pre[i])){
                                    ~~~^~
sequence.cpp:17:39: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
             dp[mid][lvl&1] = dp[i][lvl&1^1] + pre[i]*(pre[mid] - pre[i]);
                                    ~~~^~
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB contestant found the optimal answer: 108 == 108
2 Correct 2 ms 424 KB contestant found the optimal answer: 999 == 999
3 Correct 2 ms 376 KB contestant found the optimal answer: 0 == 0
4 Correct 2 ms 376 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 2 ms 376 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 2 ms 376 KB contestant found the optimal answer: 1 == 1
7 Correct 2 ms 376 KB contestant found the optimal answer: 1 == 1
8 Correct 2 ms 376 KB contestant found the optimal answer: 1 == 1
9 Correct 2 ms 504 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 2 ms 348 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 2 ms 376 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 2 ms 376 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 2 ms 376 KB contestant found the optimal answer: 140072 == 140072
14 Correct 2 ms 376 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 2 ms 380 KB contestant found the optimal answer: 805 == 805
16 Correct 2 ms 376 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 2 ms 376 KB contestant found the optimal answer: 999919994 == 999919994
# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 2 ms 376 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 2 ms 428 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 2 ms 376 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 2 ms 376 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 2 ms 376 KB contestant found the optimal answer: 933702 == 933702
7 Correct 2 ms 376 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 2 ms 376 KB contestant found the optimal answer: 687136 == 687136
9 Correct 2 ms 376 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 2 ms 376 KB contestant found the optimal answer: 29000419931 == 29000419931
# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 2 ms 504 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 3 ms 504 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 4 ms 504 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 3 ms 504 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 3 ms 504 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 3 ms 504 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 2 ms 504 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 2 ms 504 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 3 ms 504 KB contestant found the optimal answer: 490686959791 == 490686959791
# Verdict Execution time Memory Grader output
1 Correct 3 ms 1144 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 3 ms 1144 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 8 ms 1272 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 3 ms 1272 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 10 ms 1144 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 9 ms 1144 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 10 ms 1188 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 7 ms 1144 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 4 ms 1144 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 6 ms 1144 KB contestant found the optimal answer: 12345131038664 == 12345131038664
# Verdict Execution time Memory Grader output
1 Correct 10 ms 8696 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 10 ms 8568 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 83 ms 8696 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 11 ms 8696 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 68 ms 8712 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 68 ms 8628 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 81 ms 8696 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 61 ms 8696 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 67 ms 8696 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 84 ms 8728 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798
# Verdict Execution time Memory Grader output
1 Correct 91 ms 83276 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 92 ms 83196 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 1403 ms 83508 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 93 ms 83388 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1787 ms 83164 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 1014 ms 83192 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 1273 ms 83548 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 885 ms 83372 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 977 ms 83448 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 1279 ms 83336 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845