oj.uz

Submission #31276

# Submission time Handle Problem Language Result Execution time Memory
31276 2017-08-17T16:30:57 Z nickyrio Split the sequence (APIO14_sequence) C++14
0 / 100
 29 ms 88356 KB 
#include <bits/stdc++.h>

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

    int 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, int 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
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 88356 KB contestant found the optimal answer: 108 == 108
2 Correct 0 ms 88356 KB contestant found the optimal answer: 999 == 999
3 Correct 0 ms 88356 KB contestant found the optimal answer: 0 == 0
4 Correct 0 ms 88356 KB contestant found the optimal answer: 1542524 == 1542524
5 Incorrect 0 ms 88356 KB position 9 occurs twice in split scheme
6 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 88356 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 0 ms 88356 KB contestant found the optimal answer: 302460000 == 302460000
3 Incorrect 0 ms 88356 KB position 7 occurs twice in split scheme
4 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 88356 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 0 ms 88356 KB contestant found the optimal answer: 311760000 == 311760000
3 Incorrect 0 ms 88356 KB position 195 occurs twice in split scheme
4 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 88356 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 0 ms 88356 KB contestant found the optimal answer: 140412195 == 140412195
3 Incorrect 6 ms 88356 KB declared answer doesn't correspond to the split scheme: declared = 37071173914690, real = 34683172098114
4 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 88356 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 3 ms 88356 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Incorrect 23 ms 88356 KB declared answer doesn't correspond to the split scheme: declared = 8827753989049452, real = 3061326602472556
4 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 29 ms 88356 KB declared answer doesn't correspond to the split scheme: declared = 28139380343, real = 19549445751
2 Halted 0 ms 0 KB -