oj.uz

Submission #138005

# Submission time Handle Problem Language Result Execution time Memory
138005 2019-07-28T21:15:59 Z Runtime_error_ Split the sequence (APIO14_sequence) C++14
39 / 100
 39 ms 3576 KB 
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll inf=1e3+9,K=209,MX=1e9+9;
ll n,k,ans=-MX,idx;
ll pre[inf],a[inf];
pair<ll,ll> dp[K][inf];
vector<ll> split;

bool Q ;
struct Line {
	mutable ll m, p, k,idx;
	bool operator<(const Line& o) const {
		return Q ? k < o.k : m < o.m;
	}
};

struct LineContainer : multiset<Line> {
	// (for doubles, use inf = 1/.0, div(a,b) = a/b)
	const ll inf = LLONG_MAX;
	ll div(ll a, ll b) { // floored division
		return a / b - ((a ^ b) < 0 && a % b);
    }

	bool isect(iterator x, iterator y) {
		if (y == end()) {
		     x->k = inf;
		     return false;
        }
		if (x->m == y->m)
            x->k = x->p > y->p ? inf : -inf;
		else
            x->k = div(y->p - x->p, x->m - y->m);
		return x->k >= y->k;
	}
	void add(ll m, ll p,ll idx) {
		auto z = insert({m, p, 0,idx}), y = z++, x = y;
		while (isect(y, z))
            z = erase(z);
		if (x != begin() && isect(--x, y)) isect(x, y = erase(y));
		while ((y = x) != begin() && (--x)->k >= y->k)
			isect(x, erase(y));
	}
	pair<ll,ll> query(ll x) {
	        if(empty())
	            return {-MX,0};

		assert(!empty());
		Q = 1; auto l = *lower_bound({0,0,x}); Q = 0;
		return make_pair(l.m * x + l.p,l.idx);
	}
};


int main(){

    cin>>n>>k;
    for(ll i=1;i<=n;i++)
        cin>>a[i],pre[i]=pre[i-1]+a[i];

    for(ll j=1;j<=k;j++){
        LineContainer lc;
        lc.add(0,0,0);
        for(ll i=1;i<=n;i++){
            dp[j][i] = lc.query(pre[i]);
            dp[j][i].first += pre[i]*pre[n] - pre[i]*pre[i] ;
            lc.add(pre[i],dp[j-1][i].first-pre[i]*pre[n],i);

        }
    }

    for(ll i=1;i<=n;i++)
        if(ans<dp[k][i].first)
            ans=dp[k][i].first,idx=i;

    split.push_back(idx);
    for(ll j=k;j>1;j--)
        idx=dp[j][idx].second,split.push_back(idx);

    reverse(split.begin(),split.end());

    cout<<ans<<endl;
    for(auto o:split)
        cout<<o<<" ";
    cout<<endl;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 2 ms 376 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 8 ms 1784 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 2 ms 376 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 6 ms 1272 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Incorrect 8 ms 1656 KB Integer 0 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 3 ms 376 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 3 ms 376 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 39 ms 3516 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 3 ms 504 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 38 ms 3576 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 34 ms 3064 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 39 ms 3576 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 38 ms 3576 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 10 ms 1016 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 17 ms 1656 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -