oj.uz

Submission #927509

# Submission time Handle Problem Language Result Execution time Memory
927509 2024-02-15T02:27:54 Z AlphaMale06 Split the sequence (APIO14_sequence) C++17
100 / 100
 375 ms 83996 KB 
#include <bits/stdc++.h>

using namespace std;

using ld = long double;
using ll = long long;

#define pb push_back
#define F first
#define S second

struct line{
    int slope;
    ll c;
    ll eval(int x){
        return slope*1ll*x+c;
    }
    ld interx(line & a){
        return (ld)(a.c-c)/(ld)(slope-a.slope);
    }
};
const int N = 1e5+10;
ll dp[N];
int red[205][N];
line chtl[N];
int chtr[N];
int a[N];
ll pref[N];


signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, k;
    cin >> n >> k;
    for(int i=0; i< n; i++){
        cin >> a[i];
        pref[i+1]=pref[i]+a[i];
    }
    for(int j=1; j<=k; j++){
        int r=n+5;
        int l=n+5;
        chtl[l]={-pref[j-1], dp[j]};
        chtr[l]=j;
        l--;
        for(int i=j+1; i<=n; i++){
            int x = pref[n]-pref[i-1];
            while(r-l>=2){
                if(chtl[r].eval(x)>chtl[r-1].eval(x))break;
                r--;
            }
            pair<line, int> np = {{-pref[i-1], dp[i]}, i};
            dp[i]=chtl[r].eval(x)+pref[i-1]*(pref[n]-pref[i-1]);
            red[j][i]=chtr[r];
            while(r-l>=2){
                if(chtl[l+1].slope==np.F.slope){
                    if(chtl[l+1].c<=np.F.c){
                        l++;
                        continue;
                    }
                    else break;
                }
                ld inter1 = chtl[l+1].interx(chtl[l+2]);
                ld inter2 = np.F.interx(chtl[l+2]);
                if(inter2<inter1)break;
                l++;
            }
            chtl[l]=np.F;
            chtr[l]=np.S;
            l--;
        }
    }
    ll ans=0;
    int ind=0;
    for(int i=1; i<=n; i++){
        if(dp[i]>=ans){
            ans=dp[i];
            ind=i;
        }
    }
    cout << ans << '\n';
    vector<int> con;
    con.pb(ind);
    for(int i=k; i>1; i--){
        con.pb(red[i][ind]);
        ind=red[i][ind];
    }
    sort(con.begin(), con.end());
    for(int i=0; i<k; i++){
        cout << con[i]-1 << " ";
    }
    cout << '\n';

}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:44:18: warning: narrowing conversion of '- pref[(j - 1)]' from 'll' {aka 'long long int'} to 'int' [-Wnarrowing]
   44 |         chtl[l]={-pref[j-1], dp[j]};
      |                  ^~~~~~~~~~
sequence.cpp:53:36: warning: narrowing conversion of '- pref[(i - 1)]' from 'll' {aka 'long long int'} to 'int' [-Wnarrowing]
   53 |             pair<line, int> np = {{-pref[i-1], dp[i]}, i};
      |                                    ^~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 6492 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 16 ms 82520 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 6492 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 7 ms 59820 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 8 ms 74328 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 9 ms 82524 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 3 ms 20828 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 2 ms 14684 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 4 ms 26972 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 6492 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 12 ms 82524 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 6492 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 12 ms 82524 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 10 ms 70236 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 11 ms 82520 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 13 ms 82520 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 4 ms 20828 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 5 ms 35336 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6744 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 2 ms 6748 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 30 ms 82660 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 2 ms 6620 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 26 ms 51896 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 27 ms 59988 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 30 ms 64224 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 22 ms 51900 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 25 ms 59988 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 30 ms 74324 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7516 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 15 ms 7572 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 234 ms 83816 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 10 ms 7772 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 351 ms 83996 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 228 ms 60752 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 375 ms 65300 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 177 ms 53048 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 175 ms 61140 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 244 ms 75592 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845