oj.uz

Submission #971085

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

#define int long long

struct fraction {
    int n,d;
    fraction(int n,int d):n(n),d(d){}
    bool operator<(const fraction &other) const {
        return __int128(n)*__int128(other.d)<__int128(other.n)*__int128(d);
    }
};

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

fraction getIntersect(line a,line b) {
    return {a.k - b.k,b.m - a.m};
}

void addline(deque<line> &hull, line x) {
    while(hull.size()>1 and getIntersect(hull[hull.size()-2],x)<getIntersect(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;j--){
            if(j!=1){for(int x=i-1;x;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]);
            if(DP[i][j] != ans)
            {
                cout << ":DFSAOUIHfaspodi8uhjfg";
            }
            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
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2652 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 2648 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 2652 KB contestant found the optimal answer: 933702 == 933702
7 Correct 1 ms 2736 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 2716 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2908 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 2908 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 6 ms 3048 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 2908 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 4 ms 2984 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Incorrect 5 ms 2904 KB Expected integer, but ":DFSAOUIHfaspodi8uhjfg:DFSAOUI...:DFSAOUIHfaspodi8uhjfg107630884" found
7 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 6236 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 5 ms 6236 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 114 ms 6460 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 3 ms 6236 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 121 ms 6700 KB contestant found the optimal answer: 679388326 == 679388326
6 Incorrect 97 ms 6872 KB Expected integer, but ":DFSAOUIHfaspodi8uhjfg:DFSAOUI...DFSAOUIHfaspodi8uhjfg4699030287" found
7 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 478 ms 49972 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 599 ms 50636 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Execution timed out 2052 ms 22732 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 2054 ms 93600 KB Time limit exceeded
2 Halted 0 ms 0 KB -