oj.uz

Submission #486512

# Submission time Handle Problem Language Result Execution time Memory
486512 2021-11-11T21:28:34 Z status_coding Split the sequence (APIO14_sequence) C++14
49 / 100
 97 ms 131076 KB 
#include <bits/stdc++.h>

using namespace std;

long long n,k;
long long s[100005];

long long dp[100005][201];
int last[100005][201];

void solve(int nr, int st, int dr, int stOpt, int drOpt)
{
    if(st > dr)
        return;

    int mij=(st+dr)/2;
    long long maxi=0, best=-1;

    for(int j=stOpt;j<=min(drOpt, mij);j++)
    {
        long long nval= (s[mij]-s[j-1])*s[j-1] + dp[j-1][nr-1];

        if(nval > maxi)
        {
            maxi=nval;
            best=j;
        }
    }

    dp[mij][nr]=maxi;
    last[mij][nr]=best-1;

    solve(nr, st, mij-1, stOpt, best);
    solve(nr, mij+1, dr, best, drOpt);
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin>>n>>k;
    for(int i=1;i<=n;i++)
        cin>>s[i];
    for(int i=1;i<=n;i++)
        s[i]+=s[i-1];

    for(int nr=1;nr<=k;nr++)
        solve(nr, 1, n, 1, n);

    cout<<dp[n][k]<<'\n';

    int nr=k;
    int p=n;
    vector<int> ans;

    while(true)
    {
        p = last[p][nr];
        nr--;

        if(!p)
            break;

        ans.push_back(p);
    }

    reverse(ans.begin(), ans.end());
    for(int it : ans)
        cout<<it<<' ';
    return 0;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB contestant found the optimal answer: 108 == 108
2 Correct 0 ms 332 KB contestant found the optimal answer: 999 == 999
3 Runtime error 4 ms 460 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

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

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 716 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 716 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 2 ms 716 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 716 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 1 ms 716 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Incorrect 2 ms 716 KB Integer -2 violates the range [1, 199]
7 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 24012 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 13 ms 24012 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 84 ms 24036 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 22 ms 24052 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 83 ms 24012 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 97 ms 24016 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 71 ms 24012 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 58 ms 24032 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 73 ms 24012 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 87 ms 24012 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
0 / 29.0

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