oj.uz

Submission #971080

# Submission time Handle Problem Language Result Execution time Memory
971080 2024-04-27T22:34:44 Z Unforgettablepl Split the sequence (APIO14_sequence) C++17
28 / 100
 2000 ms 95304 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long

struct line{
    int m,n,idx_1,idx_2;
    line(int m,int n,int idx_1,int idx_2):m(m),n(n),idx_1(idx_1),idx_2(idx_2){}
    int operator()(int x) const{
        return x*m + n;
    }
};

long double intersection(line a,line b){
    return (long double)(a.n-b.n)/(long double)(b.m-a.m);
}

void addline(deque<line> &hull, line x){
    while(hull.size()>=2 and intersection(hull.back(),x)<=intersection(hull[hull.size()-2],hull.back()))hull.pop_back();
    hull.emplace_back(x);
}

tuple<int,int,int> get(deque<line> &hull, int x){
    while(hull.size()>=2 and hull.front()(x)<=hull[1](x))hull.pop_front();
    return {hull.front()(x),hull.front().idx_1,hull.front().idx_2};
}

int DP[100001][202];
pair<int,int> back[100001][202];
deque<line> hulls[202];
int P[100001];

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n,k;
    cin >> n >> k;k++;
    for(int i=1;i<=n;i++)cin>>P[i];
    for(int i=1;i<=n;i++)P[i]+=P[i-1];
//    for(int i=0;i<=k;i++)addline(hulls[i],{0,0,0,0});
    for(int i=1;i<=n;i++){
        for(int j=k;j>1;j--){
            for(int x=0;x<i;x++){
                if(DP[i][j]<P[i]*P[x]-P[x]*P[x]+DP[x][j-1]){
                    DP[i][j] = P[i]*P[x]-P[x]*P[x]+DP[x][j-1];
                    back[i][j] = {x,j-1};
                }
            }
//            auto [ans,last1,last2] = get(hulls[j-1],P[i]);
//            DP[i][j] = ans;
//            back[i][j] = {last1,last2};
//            addline(hulls[j],{P[i],DP[i][j]-P[i]*P[i],i,j});
        }
    }
    cout << DP[n][k] << '\n';
    vector<int> ans;
    auto [curr1,curr2] = back[n][k];
    while(curr1 and curr2){
        ans.emplace_back(curr1);
        auto [c1,c2] = back[curr1][curr2];curr1=c1;curr2=c2;
    }
    for(int&i:ans)cout<<i<<' ';
    cout << '\n';
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB contestant found the optimal answer: 108 == 108
2 Correct 1 ms 2652 KB contestant found the optimal answer: 999 == 999
3 Incorrect 1 ms 2396 KB Unexpected end of file - int32 expected
4 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

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

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2904 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 2908 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 5 ms 2908 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 2904 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 4 ms 2908 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Incorrect 4 ms 2860 KB Unexpected end of file - int32 expected
7 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 6232 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 3 ms 6236 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 120 ms 6092 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 4 ms 6236 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 111 ms 6228 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 98 ms 6228 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 116 ms 6228 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 150 ms 6224 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 24 ms 6232 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 47 ms 6188 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 423 ms 49232 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 413 ms 49336 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Execution timed out 2020 ms 21588 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2041 ms 95304 KB Time limit exceeded
2 Halted 0 ms 0 KB -