oj.uz

Submission #746549

# Submission time Handle Problem Language Result Execution time Memory
746549 2023-05-22T17:51:38 Z cscandkswon Split the sequence (APIO14_sequence) C++17
100 / 100
 1328 ms 83240 KB 
#include <cstdio>
#include <algorithm>
using namespace std;

int N, K, v, w;
int A[100005];
long long S[100005];

long long D[100005][2];
int O[100005][205];

void dnc(int l, int r, int x, int y, int k) {
    if (l > r) return;
    int m = (l + r) >> 1;
    int i, p;
    long long q = 0;
    for (i = max(k - 1, x); i <= min(y, m - 1); i++) {
        if (q < (S[m] - S[i]) * (S[N] - S[m]) + D[i][w]) {
            q = (S[m] - S[i]) * (S[N] - S[m]) + D[i][w];
            p = i;
        }
    }
    D[m][v] = q;
    O[m][k] = p;
    if (l == r) return;
    dnc(l, m - 1, x, p, k);
    dnc(m + 1, r, p, y, k);
}

void backtrack(int x, int k) {
    if (k == 0) return;
    backtrack(O[x][k], k - 1);
    printf("%d ", x);
}

int main() {
    int i, j, c = 0;
    scanf("%d %d", &N, &K);
    for (i = 1; i <= N; i++) scanf("%d", A + i);
    for (i = 1; i <= N; i++) S[i] = S[i - 1] + A[i];
    for (i = 1; i <= N; i++) {
        D[i][0] = (S[i]) * (S[N] - S[i]);
        O[i][1]=i;
    }
    v = 1, w = 0;   // write on v, read on w
    for (i = 2; i <= K; i++) {
        for (j = 1; j <= N; j++) D[i][v] = 0;
        dnc(i, N - 1, 1, N - 1, i);
        swap(v, w);
    }
    int a = 0;
    for (i = K; i < N; i++) {
        if (D[i][w] >= D[a][w]) a = i;
    }
    printf("%lld\n", D[a][w]);
    backtrack(a, K);
    return 0;
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:37:15: warning: unused variable 'c' [-Wunused-variable]
   37 |     int i, j, c = 0;
      |               ^
sequence.cpp:38:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |     scanf("%d %d", &N, &K);
      |     ~~~~~^~~~~~~~~~~~~~~~~
sequence.cpp:39:35: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |     for (i = 1; i <= N; i++) scanf("%d", A + i);
      |                              ~~~~~^~~~~~~~~~~~~
sequence.cpp: In function 'void dnc(int, int, int, int, int)':
sequence.cpp:26:8: warning: 'p' may be used uninitialized in this function [-Wmaybe-uninitialized]
   26 |     dnc(l, m - 1, x, p, k);
      |     ~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB contestant found the optimal answer: 108 == 108
2 Correct 0 ms 212 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 212 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 0 ms 288 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 0 ms 212 KB contestant found the optimal answer: 1 == 1
7 Correct 0 ms 212 KB contestant found the optimal answer: 1 == 1
8 Correct 0 ms 212 KB contestant found the optimal answer: 1 == 1
9 Correct 0 ms 212 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 0 ms 292 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 0 ms 212 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 0 ms 212 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 1 ms 212 KB contestant found the optimal answer: 140072 == 140072
14 Correct 1 ms 212 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 1 ms 212 KB contestant found the optimal answer: 805 == 805
16 Correct 1 ms 212 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 1 ms 292 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8600 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 5 ms 8532 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 56 ms 8532 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 5 ms 8532 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 68 ms 8584 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 64 ms 8532 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 57 ms 8532 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 43 ms 8592 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 57 ms 8576 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 71 ms 8580 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 83168 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 48 ms 83160 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 901 ms 83236 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 49 ms 83240 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1328 ms 83232 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 852 ms 83232 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 809 ms 83232 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 556 ms 83240 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 743 ms 83232 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 963 ms 83232 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845