oj.uz

Submission #546734

# Submission time Handle Problem Language Result Execution time Memory
546734 2022-04-08T09:44:03 Z krit3379 Split the sequence (APIO14_sequence) C++14
100 / 100
 1096 ms 96048 KB 
#include<bits/stdc++.h>
using namespace std;
#define N 100005

struct line{
    long long m,c;
    int i;
    long long val(long long x){return m*x+c;}
    long long inter(line l){return floor((long double)(c-l.c)/(l.m-m));}
};

long long a[N],ans;
int p[N][205],now;
vector<int> cut;
deque<line> dq[205];

int main(){
    int n,k,i,j;
    scanf("%d %d",&n,&k);
    for(i=1;i<=n;i++)scanf("%lld",&a[i]),a[i]+=a[i-1];
    dq[0].push_back({0,0,0});
    for(i=1;i<n;i++){
        for(j=k;j>0;j--){
            if(dq[j-1].empty())continue;
            while(dq[j-1].size()>=2&&dq[j-1].back().val(a[n]-a[i])<=dq[j-1][dq[j-1].size()-2].val(a[n]-a[i]))dq[j-1].pop_back();
            long long v=dq[j-1].back().val(a[n]-a[i])+a[i]*(a[n]-a[i]);
            if(v>=ans&&j==k)ans=v,now=i;
            p[i][j]=dq[j-1].back().i;
            line l={-a[i],v,i};
            while(dq[j].size()>=2&&dq[j][0].inter(dq[j][1])<=dq[j][0].inter(l))dq[j].pop_front();
            dq[j].push_front(l);
        }
    }
    while(k){
        cut.push_back(now);
        now=p[now][k--];
    }
    printf("%lld\n",ans);
    for(auto x:cut)printf("%d ",x);
    return 0;
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:19:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |     scanf("%d %d",&n,&k);
      |     ~~~~~^~~~~~~~~~~~~~~
sequence.cpp:20:27: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |     for(i=1;i<=n;i++)scanf("%lld",&a[i]),a[i]+=a[i-1];
      |                      ~~~~~^~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8788 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 8 ms 9044 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 84 ms 9984 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 8 ms 8956 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 64 ms 9824 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 82 ms 9348 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 78 ms 9768 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 64 ms 10052 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 65 ms 9684 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 78 ms 9832 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 84804 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 76 ms 85024 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 924 ms 96048 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 69 ms 85836 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1096 ms 94128 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 751 ms 89652 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 857 ms 94760 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 705 ms 93904 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 828 ms 93704 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 833 ms 94228 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845