oj.uz

Submission #31433

# Submission time Handle Problem Language Result Execution time Memory
31433 2017-08-25T03:54:00 Z gs14004 Split the sequence (APIO14_sequence) C++14
100 / 100
 436 ms 86396 KB 
#include <bits/stdc++.h>
 
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];
    void insert(lint p, lint q, int piv){
        la[e] = p;
        lb[e] = q;
        label[e] = piv;
        while(s+1<e && (lb[e-1] - lb[e-2]) * (la[e] - la[e-1]) <= (la[e-2] - la[e-1])* (lb[e-1] - lb[e])){
            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 && lb[s+1] - lb[s] >= x * (la[s] - la[s+1])) s++;
        return pi(la[s]*x+lb[s],label[s]);
    }
    void clear(){s = e = 0;}
}convexHull;
 
int n,k;
lint dp[2][100005],a[100005];
int track[205][100005];
 
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;
    }
  vector<lint> v;
    for (int t=0; t<=k; t++) {
        convexHull.clear();
        convexHull.insert(0,0,0);
        for (int i=1; i<=n; i++) {
            pi x = convexHull.query(a[i]);
            track[t][i] = x.second;
            dp[t%2][i] = x.first + a[i] * (a[n] - a[i]);
            convexHull.insert(a[i],dp[!(t%2)][i]-a[n]*a[i], i);
        }
      v.push_back(dp[t%2][n]);
    }
  for(int i=2; i<v.size(); i++){
    assert(v[i-1] - v[i-2] >= v[i] - v[i-1]);
  }
    printf("%lld\n",dp[k%2][n]);
    vector<int> res;
    int pos2 = n;
    for(int pos1 = k; pos1; pos1--){
        res.push_back(track[pos1][pos2]);
        pos2 = track[pos1][pos2];
    }
    while (!res.empty()) {
        printf("%d ",res.back());
        res.pop_back();
    }
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:53:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=2; i<v.size(); i++){
                 ^
sequence.cpp:36:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&n,&k);
                         ^
sequence.cpp:38:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&t);
                       ^

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

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

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 86396 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 23 ms 86396 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 229 ms 86396 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 19 ms 86396 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 436 ms 86396 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 329 ms 86396 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 339 ms 86396 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 209 ms 86396 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 243 ms 86396 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 263 ms 86396 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845