oj.uz

Submission #37554

# Submission time Handle Problem Language Result Execution time Memory
37554 2017-12-26T06:10:27 Z Talant Split the sequence (APIO14_sequence) C++11
100 / 100
 1116 ms 82880 KB 
#include <bits/stdc++.h>

#define ll long long

using namespace std;

const int N = (int)1e5 + 7;

ll dp[2][N];
ll p[N];
int pr[201][N];
int n;

inline ll calc (int r,int l) {
        return p[l] * (p[r] - p[l]);
}
inline int min(int a, int b)
{
        return a < b ? a : b;
}
void compute (int k,int l,int r,int L,int R) {

        if (l > r) return;

        int m = (l + r) >> 1;

        dp[k & 1][m] = 0;

        int &opt = pr[k][m];

        for (int i = L; i <= min(m - 1,R); i ++) {

                ll now = dp[k & 1 ^ 1][i] + calc(m,i);

                if (now >= dp[k & 1][m]) {
                        dp[k & 1][m] = now;
                        opt = i;
                }
        }
        compute (k, l,m - 1, L, opt);
        compute (k, m + 1, r, opt, R);
}

int kk;
main () {
        scanf ("%d%d", &n,&kk);

        for (int i = 1; i <= n; i ++) {
                scanf ("%lld", &p[i]);
                p[i] += p[i - 1];
        }

        for (int i = 1; i <= kk; i ++)
                compute (i,1,n,1,n - 1);

        printf("%lld\n", dp[kk & 1][n]);


        while (kk > 0) {
               printf("%d ", pr[kk][n]);
                n = pr[kk][n];
                kk --;
        }
}
/**
7 3
4 1 3 4 0 2 3
**/

Compilation message

sequence.cpp: In function 'void compute(int, int, int, int, int)':
sequence.cpp:33:31: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
                 ll now = dp[k & 1 ^ 1][i] + calc(m,i);
                               ^
sequence.cpp: At global scope:
sequence.cpp:45:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^
sequence.cpp: In function 'int main()':
sequence.cpp:46:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf ("%d%d", &n,&kk);
                               ^
sequence.cpp:49:38: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
                 scanf ("%lld", &p[i]);
                                      ^

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 82880 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 0 ms 82880 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 69 ms 82880 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 0 ms 82880 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 53 ms 82880 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 49 ms 82880 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 73 ms 82880 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 49 ms 82880 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 56 ms 82880 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 83 ms 82880 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 82880 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 29 ms 82880 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 763 ms 82880 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 23 ms 82880 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1116 ms 82880 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 713 ms 82880 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 823 ms 82880 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 573 ms 82880 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 659 ms 82880 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 876 ms 82880 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845