Submission #951455

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
951455	2024-03-22T01:57:58 Z	yeediot	Split the sequence (APIO14_sequence)	C++14	0 / 100	14 ms	9816 KB

sequence

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
struct line{
    int a,b,c;
    int operator()(const int x)const{
        return a*x+b;
    }
};
/*
cb<=ab
cx+d=ax+b;
x=(d-b)/(a-c)
(c.b-b.b)/(b.a-c.a)<=(a.b-b.b)/(b.a-a.a)
*/
bool check(line a,line b,line c){
    return (c.b-b.b)*(b.a-a.a)<=(a.b-b.b)*(b.a-c.a);
}
signed main(){
    setio();
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int n,k;
    cin>>n>>k;
    vector<int>a(n+1),pre(n+1);
    for(int i=1;i<=n;i++){
        cin>>a[i];  
        pre[i]=pre[i-1]+a[i];
    }
    int dp[k+2][n+1],from[k+2][n+1];
    memset(dp,0,sizeof(dp));
    memset(from,0,sizeof(from));
    for(int j=1;j<=k+1;j++){
        deque<line>dq;
        dq.push_back({0,0,0});
        for(int i=1;i<=n;i++){
            while(sz(dq)>1 and dq[0](pre[i])<dq[1](pre[i])){
                dq.pop_front();
            }
            dp[j][i]=dq.front()(pre[i])+pre[i]*pre[n]-pre[i]*pre[i];
            from[j][i]=dq.front().c;
            line l={2*pre[i],dp[j-1][i]-pre[i]*pre[i]-pre[i]*pre[n],i};
            while(sz(dq)>1 and check(dq[sz(dq)-2],dq.back(),l)){
                dq.pop_back();
            }
            dq.push_back(l);
            debug(j,i,dp[j][i]);
        }
    }
    cout<<dp[k+1][n]/2<<'\n';
    vector<int>ans;
    int cur=n;
    int now=k+1;
    while(cur!=0){
        cur=from[now][cur];
        now--;
        if(cur==0)break;
        ans.pb(cur);
    }
    reverse(all(ans));
    for(auto i:ans){
        cout<<i<<' ';
    }
    cout<<'\n';
}
 /*
 input:
 dp[i]=dp[j]+(pre[i]-pre[j])*(sum-pre[i]+pre[j])
 dp[i]=dp[j]+pre[i]*sum-pre[i]*pre[i]+pre[i]pre[j]+pre[i]*pre[j]-pre[j]*pre[j]
 =(dp[j]-pre[j]pre[j])+2*pre[i]*pre[j]+(pre[i]*sum-pre[i]*pre[i])
 */

Compilation message

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

Subtask #1
0 / 11.0

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

Subtask #2
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	344 KB	contestant didn't find the optimal answer: 1092528 < 1093956
2	Halted	0 ms	0 KB	-

Subtask #3
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	contestant found the optimal answer: 610590000 == 610590000
2	Correct	0 ms	348 KB	contestant found the optimal answer: 311760000 == 311760000
3	Correct	1 ms	860 KB	contestant found the optimal answer: 1989216017013 == 1989216017013
4	Incorrect	0 ms	348 KB	contestant didn't find the optimal answer: 211605090300 < 1499437552673
5	Halted	0 ms	0 KB	-