Submission #670191

# Submission time Handle Problem Language Result Execution time Memory
670191 2022-12-08T08:53:22 Z Mahdi Split the sequence (APIO14_sequence) C++17
71 / 100
341 ms 131072 KB
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(v) v.begin(), v.end()
#define F first
#define S second
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
const int N=1e5+5;
int n, k, a[N], b[205][N], pd[N];
ll dp[205][N];
void sol(int i, int l, int r, int lx, int rx){
    int m=(l+r)/2;
    pli x={dp[i-1][lx]+1LL*pd[lx]*(pd[m]-pd[lx]), lx};
    for(int j=lx+1;j<min(m, rx+1);++j)
        x=max(x, {dp[i-1][j]+1LL*pd[j]*(pd[m]-pd[j]), j});
    dp[i][m]=x.F;
    b[i][m]=x.S;
    if(l<m)
        sol(i, l, m, lx, x.S);
    if(m+1<r)
        sol(i, m+1, r, x.S, rx);
}

int main(){
    cin>>n>>k;
    for(int i=1;i<=n;++i){
        cin>>a[i];
        pd[i]=a[i]+pd[i-1];
    }
    for(int i=1;i<=k;++i)
        sol(i, 1, n+1, 0, n-1);
    cout<<dp[k][n]<<'\n';
    vector<int>v;
    int h=n;
    for(int i=k;i>0;--i){
        h=b[i][h];
        v.push_back(h);
    }
    for(int i=k-1;i>=0;--i)
        cout<<v[i]<<' ';
    cout<<'\n';
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB contestant found the optimal answer: 108 == 108
2 Correct 1 ms 340 KB contestant found the optimal answer: 999 == 999
3 Correct 0 ms 304 KB contestant found the optimal answer: 0 == 0
4 Correct 0 ms 340 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 0 ms 340 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 1 ms 212 KB contestant found the optimal answer: 1 == 1
7 Correct 0 ms 340 KB contestant found the optimal answer: 1 == 1
8 Correct 0 ms 212 KB contestant found the optimal answer: 1 == 1
9 Correct 0 ms 340 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 1 ms 340 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 0 ms 304 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 0 ms 340 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 1 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
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 1 ms 340 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 1 ms 852 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 1 ms 340 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 1 ms 436 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 1 ms 340 KB contestant found the optimal answer: 933702 == 933702
7 Correct 1 ms 560 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 1 ms 340 KB contestant found the optimal answer: 687136 == 687136
9 Correct 0 ms 340 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 1 ms 468 KB contestant found the optimal answer: 29000419931 == 29000419931
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 312 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 2 ms 2772 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 340 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 2 ms 2004 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 2 ms 2516 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 2 ms 2772 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 1 ms 852 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 980 KB contestant found the optimal answer: 490686959791 == 490686959791
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 304 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 7 ms 4660 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 340 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 9 ms 4660 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 8 ms 4052 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 8 ms 4656 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 7 ms 4644 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 2 ms 1200 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 4 ms 1972 KB contestant found the optimal answer: 12345131038664 == 12345131038664
# Verdict Execution time Memory Grader output
1 Correct 3 ms 724 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 3 ms 724 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 59 ms 25896 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 4 ms 768 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 70 ms 15612 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 65 ms 18132 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 56 ms 19508 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 40 ms 15900 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 57 ms 18252 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 75 ms 23244 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798
# Verdict Execution time Memory Grader output
1 Correct 31 ms 4652 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 30 ms 4776 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Runtime error 341 ms 131072 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -