oj.uz

Submission #717069

# Submission time Handle Problem Language Result Execution time Memory
717069 2023-04-01T02:44:23 Z guagua0407 Split the sequence (APIO14_sequence) C++17
100 / 100
 656 ms 85156 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end() 
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

struct line{
    ll a,b;
    ll operator()(const ll x){
        return a*x+b;
    }
};

const int mxn=1e5+5;
const int mxk=205;
ll A[mxn];
ll pre[mxn];
ll dp[mxn];
line li[mxn];
int prv[mxn][mxk];

bool check(int a,int b,int c){
    line l1=li[a];
    line l2=li[b];
    line l3=li[c];
    return (l2.b-l3.b)*(l2.a-l1.a)<=(l1.b-l2.b)*(l3.a-l2.a);
}

int main() {_
    int n,k;
    cin>>n>>k;
    for(int i=1;i<=n;i++){
        cin>>A[i];
        pre[i]=pre[i-1]+A[i];
    }
    for(int m=1;m<=k;m++){
        deque<int> dq;
        li[m]={pre[m],dp[m]-pre[m]*pre[m]};
        dq.push_back(m);
        for(int i=m+1;i<=n;i++){
            while(dq.size()>1 and li[dq[0]](pre[i])<li[dq[1]](pre[i])){
                dq.pop_front();
            }
            prv[i][m]=dq[0];
            li[i]={pre[i],dp[i]-pre[i]*pre[i]};
            dp[i]=li[dq[0]](pre[i]);
            while(dq.size()>1 and check(dq[dq.size()-2],dq.back(),i)){
                dq.pop_back();
            }
            dq.push_back(i);
        }
    }
    cout<<dp[n]<<'\n';
    int cur=n;
    vector<int> output;
    for(int i=k;i>=1;i--){
        cur=prv[cur][i];
        output.push_back(cur);
    }
    reverse(all(output));
    for(auto v:output){
        cout<<v<<' ';
    }
    return 0;
}
//maybe its multiset not set

Compilation message

sequence.cpp: In function 'void setIO(std::string)':
sequence.cpp:12:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sequence.cpp:13:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 328 KB contestant found the optimal answer: 0 == 0
4 Correct 1 ms 328 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 1 ms 340 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 1 ms 340 KB contestant found the optimal answer: 1 == 1
7 Correct 1 ms 340 KB contestant found the optimal answer: 1 == 1
8 Correct 0 ms 340 KB contestant found the optimal answer: 1 == 1
9 Correct 1 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 1 ms 340 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 1 ms 328 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 1 ms 324 KB contestant found the optimal answer: 140072 == 140072
14 Correct 1 ms 324 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 1 ms 328 KB contestant found the optimal answer: 805 == 805
16 Correct 0 ms 340 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 1 ms 340 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 324 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 340 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 0 ms 340 KB contestant found the optimal answer: 933702 == 933702
7 Correct 1 ms 280 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 340 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8788 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 5 ms 8788 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 43 ms 8788 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 6 ms 8824 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 44 ms 8744 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 49 ms 8788 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 42 ms 8788 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 34 ms 8788 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 37 ms 8800 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 44 ms 8788 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 84668 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 41 ms 84816 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 494 ms 85112 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 46 ms 85156 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 656 ms 84856 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 445 ms 84812 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 489 ms 85124 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 345 ms 85000 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 382 ms 84992 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 499 ms 84996 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845