oj.uz

Submission #37645

# Submission time Handle Problem Language Result Execution time Memory
37645 2017-12-26T14:09:14 Z antimirage Split the sequence (APIO14_sequence) C++14
100 / 100
 1073 ms 118036 KB 
#include <iostream>
#include <vector>
#include <deque>
#include <math.h>
#include <set>
#include <iomanip>
#include <time.h>
#include <list>
#include <stdio.h>
#include <queue>
#include <map>
#include <algorithm>
#include <assert.h>
#include <memory.h>

#define mk make_pair
#define sc second
#define fr first
#define pb emplace_back
#define all(s) s.begin(), s.end()
#define sz(s) ( (int)s.size() )

using namespace std;

const int N = 1e5 + 5;

int n, p[205][N];

long long dp[45][N], pref[N], inf = 4e18;

void compute (int k, int l, int r, int opl, int opr)
{
    if (l > r) return;

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

    int &opt = p[k][md];

    opt = opl;

    for (int i = opl; i <= min(opr, md - 1); i++)
    {
        if (dp[ (k & 1) ^ 1][i] + (pref[md] - pref[i]) * (pref[n] - pref[md]) >= dp[k & 1][md])
        {
            dp[k & 1][md] = dp[ (k & 1) ^ 1][i] + (pref[md] - pref[i]) * (pref[n] - pref[md]);
            opt = i;
        }
    }
    compute( k, l, md - 1, opl, opt );
    compute( k, md + 1, r, opt, opr );
}

int k;

main ()
{
    cin >> n >> k;

    for (int i = 0; i <= 1; i++)
        for (int j = 0; j <= n; j++)
            dp[i][j] = -inf;

    k++;

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

    dp[0][0] = 0;

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

    cout << dp[k & 1][n] << endl;

    while (k > 1)
    {
        printf("%d ", p[k][n]);
        n = p[k][n];
        k--;
    }
}

Compilation message

sequence.cpp:55:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main ()
       ^
sequence.cpp: In function 'int main()':
sequence.cpp:67:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         pref[i] += pref[i - 1];
                               ^

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 118036 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 3 ms 118036 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 113 ms 118036 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 6 ms 118036 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 66 ms 118036 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 59 ms 118036 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 86 ms 118036 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 53 ms 118036 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 56 ms 118036 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 76 ms 118036 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 118036 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 36 ms 118036 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 733 ms 118036 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 26 ms 118036 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1073 ms 118036 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 669 ms 118036 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 853 ms 118036 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 566 ms 118036 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 599 ms 118036 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 806 ms 118036 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845