oj.uz

Submission #7966

# Submission time Handle Problem Language Result Execution time Memory
7966 2014-08-26T13:37:36 Z gs14004 Split the sequence (APIO14_sequence) C++
50 / 100
 2000 ms 87540 KB 
#include <cstdio>
#include <utility>
#include <vector>
 
using namespace std;
typedef long long lint;
typedef pair<lint, int> pi;
 
struct cht{
    int s,e;
    lint la[100005],lb[100005];
    int label[100005];
    double cross(int a, int b){return (double)(lb[b]-lb[a])/(la[a]-la[b]);}
    void insert(lint p, lint q, int piv){
        la[e] = p;
        lb[e] = q;
        label[e] = piv;
        while(e>1 && cross(e-1,e-2) < cross(e,e-1)){
            la[e-1] = la[e];
            lb[e-1] = lb[e];
            label[e-1] = label[e];
            e--;
        }
        e++;
    }
    pi query(lint x){
        while(s+1<e && cross(s,s+1) > x) s++;
        return pi(la[s]*x+lb[s],label[s]);
    }
    void clear(){s = e = 0;}
}convexHull[2];
 
int n,k;
lint dp[100005][2],a[100005];
int track[100005][205];
 
int main(){
    int t;
    scanf("%d %d",&n,&k);
    for (int i=0; i<n; i++) {
        scanf("%d",&t);
        a[i+1] = a[i] + t;
    }
    for (int i=1; i<=n; i++) {
        dp[i][0] = (a[n] - a[i])*(a[i]);
    }
    for (int t=1; t<=k; t++) {
        for (int i=t; i<=n; i++) {
            long long res = -1e9;
            for (int j=t; j<i; j++) {
                lint piv = dp[j][!(t%2)] + (a[i] - a[j]) * (a[n] - a[i]);
                if(res < piv){
                    res = piv;
                    track[i][t] = j;
                }
            }
            dp[i][t%2] = res;
        }
    }
    // dependant on J = dp[j][t-1] + a[j-1] (a[n] - a[j-1])
    // dependant on I = -a[i-1]a[n]
    // dependant on IJ = a[i-1] * a[j-1]
    // lint piv = dp[j][t-1] + (a[j-1] - a[i-1])*(a[n] - a[j-1]);
    printf("%lld\n",dp[n][k%2]);
    vector<int> res;
    int pos1 = n;
    for(int pos2 = k; pos2 ; pos2--){
        res.push_back(track[pos1][pos2]);
        pos1 = track[pos1][pos2];
    }
    while (!res.empty()) {
        printf("%d ",res.back());
        res.pop_back();
    }
}

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 87540 KB Output is correct - contestant found the optimal answer: 21503404 == 21503404
2 Correct 4 ms 87540 KB Output is correct - contestant found the optimal answer: 140412195 == 140412195
3 Correct 188 ms 87540 KB Output is correct - contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 4 ms 87540 KB Output is correct - contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 176 ms 87540 KB Output is correct - contestant found the optimal answer: 679388326 == 679388326
6 Correct 156 ms 87540 KB Output is correct - contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 188 ms 87540 KB Output is correct - contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 188 ms 87540 KB Output is correct - contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 40 ms 87540 KB Output is correct - contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 80 ms 87540 KB Output is correct - contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 380 ms 87540 KB Output is correct - contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 288 ms 87540 KB Output is correct - contestant found the optimal answer: 1326260195 == 1326260195
3 Execution timed out 2000 ms 87536 KB Program timed out
4 Halted 0 ms 0 KB -

Subtask #6
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Halted 0 ms 0 KB -