oj.uz

Submission #62819

# Submission time Handle Problem Language Result Execution time Memory
62819 2018-07-30T08:00:26 Z win11905 Split the sequence (APIO14_sequence) C++11
100 / 100
 788 ms 83792 KB 
#include <bits/stdc++.h>
using namespace std;

#define long long long
#define ll pair<long, long>
#define x first
#define y second

const int N = 1e5+5;

struct data {
    long m, c;
    int idx;
    data() { }
    data(long m, long c, int idx) : m(m), c(c), idx(idx) { }
};

struct Convex_Hull {
    vector<data> vec;
    int ptr = 0;
    bool del(data l0, data l1, data ln) { 
        return (l1.c - l0.c) * (l0.m - ln.m) >= (ln.c - l0.c) * (l0.m - l1.m);
    }
    void add(data d) {
        while(vec.size() > 1 && del(vec[vec.size()-2], vec.back(), d)) vec.pop_back();
        while(!vec.empty() && vec.back().m == d.m && vec.back().c <= d.c) vec.pop_back();
        vec.emplace_back(d);
    }
    long get(int pos, long x) { return vec[pos].m * x + vec[pos].c; }
    ll query(long x) {
        if(ptr >= vec.size()) ptr = vec.size() - 1;
        while(ptr+1 < vec.size() && get(ptr, x) <= get(ptr+1, x)) ptr++;
        return ll(get(ptr, x), vec[ptr].idx);
    }
    void clear() {
        vec.clear();
        ptr = 0;
    }
};

int n, k;
long dp[2][N];
int s[201][N];
long pref[N];

int main() {
    scanf("%d %d", &n, &k);
    for(int i = 1; i <= n; ++i) scanf("%lld", pref+i), pref[i] += pref[i-1];
    Convex_Hull hull;
    for(int i = 1; i <= k; ++i) {
        hull.clear();
        for(int j = i+1; j <= n; ++j) {
            hull.add(data(pref[j-1], dp[~i&1][j-1] - pref[j-1] * pref[j-1], j-1));
            tie(dp[i&1][j], s[i][j]) = hull.query(pref[j]);
        }
    }
    printf("%lld\n", dp[k&1][n]);
    for(int i = k, z = n; i; --i) printf("%d ", z = s[i][z]);
}

Compilation message

sequence.cpp: In member function 'std::pair<long long int, long long int> Convex_Hull::query(long long int)':
sequence.cpp:31:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(ptr >= vec.size()) ptr = vec.size() - 1;
            ~~~~^~~~~~~~~~~~~
sequence.cpp:32:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(ptr+1 < vec.size() && get(ptr, x) <= get(ptr+1, x)) ptr++;
               ~~~~~~^~~~~~~~~~~~
sequence.cpp: In function 'int main()':
sequence.cpp:47:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &k);
     ~~~~~^~~~~~~~~~~~~~~~~
sequence.cpp:48:54: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 1; i <= n; ++i) scanf("%lld", pref+i), pref[i] += pref[i-1];
                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2284 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 7 ms 2284 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 46 ms 9832 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 6 ms 9832 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 46 ms 9832 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 44 ms 9832 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 43 ms 9832 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 34 ms 9832 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 36 ms 9832 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 56 ms 9832 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 9832 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 30 ms 9832 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 499 ms 83792 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 33 ms 83792 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 788 ms 83792 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 521 ms 83792 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 625 ms 83792 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 419 ms 83792 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 398 ms 83792 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 509 ms 83792 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845