oj.uz

Submission #983079

# Submission time Handle Problem Language Result Execution time Memory
983079 2024-05-15T07:50:55 Z Hugo1729 Split the sequence (APIO14_sequence) C++11
71 / 100
 72 ms 131072 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define f first
#define s second
 
ll dp[200001][402]={0};
ll pref[200001]={0};
ll p[200001][402]={0};

struct line{
    ll m, c;

    line(ll _m, ll _c){m=_m;c=_c;};

    ll operator() (ll x){return x*m+c;};
};
 
int main(){
    // cin.tie(0)->sync_with_stdio(0);
 
    int n, k; cin >> n >> k;
    vector<ll> a(n);
    for(int i=0;i<n;i++)cin >> a[i];
    for(int i=0;i<n;i++)pref[i+1]=pref[i]+a[i];
 
    for(int j=1;j<=k+1;j++){
        deque<pair<line,int>> q;
        for(int i=1;i<=n;i++){   //maak i = 0
            line l(pref[i-1],dp[i-1][j-1]-pref[i-1]*pref[n]);
            while(q.size()>1&&(l.c-q[1].f.c)*(q[1].f.m-q[0].f.m)<=(q[0].f.c-q[1].f.c)*(q[1].f.m-l.m))q.pop_front();
            q.push_front({l,i-1});

            while(q.size()>1&&q[q.size()-1].f(pref[i])<=q[q.size()-2].f(pref[i]))q.pop_back();

            dp[i][j]=q.back().f(pref[i])-pref[i]*pref[i]+pref[i]*pref[n];
            p[i][j]=q.back().s;
            // for(int x=0;x<i;x++){
                // if(dp[x][j-1]+(pref[i]-pref[x])*(pref[n]-pref[i])>=dp[i][j]){
                //     dp[i][j]=dp[x][j-1]+(pref[i]-pref[x])*(pref[n]-pref[i]);
                //     p[i][j]=x;
                // }
            // }
            // cout << '(' << i << ' ' << j << ')' << dp[i][j] << ' ' << p[i][j] << ' ';
        }
        // cout << '\n';
    }
 
    cout << dp[n][++k] << '\n';
 
    int sus=p[n][k--];
 
    while(k>0){
        cout << sus << ' ';
        sus=p[sus][k--];
    }
 
    return 0;
// 7 3
// 4 1 3 4 0 2 3
 
}

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 63632 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 16 ms 63576 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 62 ms 63580 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 12 ms 63580 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 58 ms 63664 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 50 ms 63580 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 59 ms 63580 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 47 ms 63576 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 51 ms 63576 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 72 ms 63580 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Runtime error 48 ms 131072 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -