oj.uz

Submission #344905

# Submission time Handle Problem Language Result Execution time Memory
344905 2021-01-06T17:33:36 Z spike1236 Split the sequence (APIO14_sequence) C++14
100 / 100
 1394 ms 81132 KB 
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 1e5 + 1;
long long dp[2][MAXN];
long long pref[MAXN];
int opt[201][MAXN];

void calc(int k, int l, int r, int optl, int optr) {
    if(l > r) return;
    int m = l + r >> 1;
    long long res = 0;
    opt[k][m] = optl;
    for(int i = optl; i <= std::min(m - 1, optr); ++i) {
        long long cur = dp[(k & 1) ^ 1][i] + pref[i] * (pref[m] - pref[i]);
        if(cur > res) {
            res = cur;
            opt[k][m] = i;
        }
    }
    dp[k & 1][m] = res;
    calc(k, l, m - 1, optl, opt[k][m]);
    calc(k, m + 1, r, opt[k][m], optr);
}

int main() {
    int n, K;
    scanf("%d %d\n", &n, &K);
    for(int i = 1; i <= n; ++i) {
        int x;
        scanf("%d", &x);
        pref[i] = pref[i - 1] + x;
    }
    for(int i = 1; i <= K; ++i)
        calc(i, i + 1, n, i, n);
    printf("%lld\n", dp[K & 1][n]);
    int pos = n;
    for(int i = K; i > 0; --i)
        pos = opt[i][pos], printf("%d ", pos);
    return 0;
}
/**
7 3
4 1 3 4 0 2 3
*/

Compilation message

sequence.cpp: In function 'void calc(int, int, int, int, int)':
sequence.cpp:11:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   11 |     int m = l + r >> 1;
      |             ~~^~~
sequence.cpp: In function 'int main()':
sequence.cpp:28:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   28 |     scanf("%d %d\n", &n, &K);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
sequence.cpp:31:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   31 |         scanf("%d", &x);
      |         ~~~~~^~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 384 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 7 ms 2028 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 364 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 10 ms 2028 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 9 ms 1772 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 8 ms 2028 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 6 ms 2028 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 2 ms 748 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 4 ms 1004 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 748 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 3 ms 748 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 62 ms 9196 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 3 ms 748 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 80 ms 5868 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 78 ms 6636 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 65 ms 7148 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 44 ms 5868 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 64 ms 6636 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 82 ms 8428 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 3820 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 30 ms 3820 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 690 ms 81132 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 25 ms 3852 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1394 ms 81004 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 908 ms 57636 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 695 ms 61804 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 571 ms 50796 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 697 ms 57836 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 916 ms 73524 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845