oj.uz

Submission #31277

# Submission time Handle Problem Language Result Execution time Memory
31277 2017-08-17T16:32:49 Z nickyrio Split the sequence (APIO14_sequence) C++14
89 / 100
 459 ms 89528 KB 
#include <bits/stdc++.h>

using namespace std;
#define K 210
#define N 100010

    long long a[N], b[N], pos[N];
    double x[N];
int n, k;
long long A[N], s[N];
int pre[K][N];
long long dp[N];


struct Hull {

    int start, last;

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

    long long get(int k, int xQuery) {
        if (start > last) return 0;
        while (start < last && pos[start + 1] <= xQuery && x[start + 1] <= s[xQuery]) start++;
        return start;
    }

};
void trace(int k, int u) {
    if (k != 1) trace(k - 1, pre[k][u]);
    printf("%d ", u);
}

int main() {
    //freopen("SEQUENCE.inp","r",stdin);
    //freopen("SEQUENCE.out","w",stdout);
    //ios::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    //cin>>n>>k;
    scanf("%d%d",&n, &k);
    for (int i = 1; i<=n; i++) cin>>A[i];
    for (int i = 1; i<=n; i++) s[i] = A[i] + s[i - 1];
    memset(dp, 0, sizeof dp);
    Hull CH(n);
    for (int kk = 0; kk<= k - 1; kk++) {
        for (int i = 1; i<=n; i++) {
            int tmp = CH.get(kk, i);
            pre[kk + 1][i] = pos[tmp];
            dp[i] = b[tmp] + s[i] * (a[tmp] + s[n] - s[i]);
        }
        CH.init();
        for (int i = 1; i<=n; i++) {
            CH.add(kk + 1, s[i], dp[i] - s[n] * s[i], i);
        }
    }

    long long ans = k;
    for (int i = k + 1; i<n; i++) if (dp[ans] <= dp[i]) ans = i;
    printf("%lld\n",dp[ans]);//<<endl;
    trace(k, ans);
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:61:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n, &k);
                         ^

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 89528 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 0 ms 89528 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 0 ms 89528 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 0 ms 89528 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 0 ms 89528 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Incorrect 0 ms 89528 KB position 199 occurs twice in split scheme
7 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

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

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 89528 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 23 ms 89528 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 246 ms 89528 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 49 ms 89528 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 459 ms 89528 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 276 ms 89528 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 343 ms 89528 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 236 ms 89528 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 269 ms 89528 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 283 ms 89528 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845