oj.uz

Submission #34028

# Submission time Handle Problem Language Result Execution time Memory
34028 2017-11-06T10:59:41 Z nickyrio Split the sequence (APIO14_sequence) C++14
100 / 100
 509 ms 91648 KB 
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = a; i<=b ; ++i)
#define FORD(i, a, b) for (int i = a; i>=b; --i)
#define REP(i, a) for (int i = 0; i<a; ++i)
#define N 100100
#define pp pair<int, int>
#define IO cin.tie(NULL);cout.tie(NULL);
#define bit(S, i) ((S >> i) & 1)
template<typename T> inline void read(T &x) {
    char c;
    bool neg = false;
    while (!isdigit(c = getchar()) && c != '-');
    x = 0;
    if (c == '-') {
        neg = true;
        c = getchar();
    }
    do {
        x = x * 10 + c - '0';
    } while (isdigit(c = getchar()));
    if (neg) x = -x;
}
template<typename T> inline void write(T x) {
    if (x < 0) {
        putchar('-');
        write(-x);
        return;
    }
    if (x < 10) putchar(char(x + 48));
    else {
        write(x/10);
        putchar(char(48 + x%10));
    }
}
template<typename T> inline void writeln(T x) {
    write(x);
    putchar('\n');
}
using namespace std;
int n, k;
long long a[N], s[N];

struct ConvexHull {
    vector<long long> a, b;
    vector<double> x;
    vector<int> p;
    int start, last;
    ConvexHull() {}
    void reset(int n) {
        a.clear();
        b.clear();
        x.clear();
        p.clear();
        a.resize(n);
        b.resize(n);
        x.resize(n);
        p.resize(n);
        start = 1; last = 0;
    }

    void add(long long aNew, long long bNew, int pNew) {
        double xNew = -1e18;
        while (start <= last) {
            if (aNew == a[last]) {
                if (bNew >= b[last]) {
                    b[last] = bNew;
                    p[last] = pNew;
                }
                return;
            }
            xNew = 1.0 * (bNew - b[last]) / (a[last] - aNew);
            if (start == last || xNew >= x[last]) break;
            --last;
        }
        a[++last] = aNew;
        b[last] = bNew;
        x[last] = xNew;
        p[last] = pNew;
    }

    long long Get(long long xQuery, int &pos) {
        if (start > last) return 0;
        while (start < last && x[start + 1] <= xQuery) ++start;
        pos = p[start];
        return a[start] * xQuery + b[start];
    }

}CH[2];
#define K 205
long long f[2][N];
int pre[K][N];
void trace(int k, int n) {
    if (k == 1) return;
    trace(k - 1, pre[k][n]);
    write(pre[k][n]);
    putchar(' ');
}
int main() {
  //  freopen("E:\\input.txt","r",stdin);
  //  freopen("E:\\out.txt","w",stdout);

    IO;
    read(n); read(k);
    FOR(i, 1, n) read(a[i]);
    s[0] = 0;
    FOR(i, 1, n) s[i] = s[i - 1] + a[i];
    CH[1].reset(n); CH[0].reset(n);
    int d = 0;
    FOR(j, 1, k + 1) {
        d = 1 - d;
        CH[1 - d].reset(n + 1);
        FOR(i, 1, n) {
            CH[1 - d].add(s[i - 1], f[1 - d][i - 1] - s[i - 1] * s[n], i - 1);
            f[d][i] = CH[1 - d].Get(s[i], pre[j][i]) + s[i] * (s[n] - s[i]);
        }
    }
    writeln(f[d][n]);
    trace(k + 1, n);
}

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 86004 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 0 ms 86004 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 29 ms 86004 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 0 ms 86004 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 29 ms 86004 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 23 ms 86004 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 36 ms 86004 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 23 ms 86004 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 49 ms 86004 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 29 ms 86004 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 91648 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 13 ms 91648 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 303 ms 91648 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 9 ms 91648 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 509 ms 91648 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 319 ms 91648 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 373 ms 91648 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 263 ms 91648 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 263 ms 91648 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 326 ms 91648 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845