oj.uz

Submission #131439

# Submission time Handle Problem Language Result Execution time Memory
131439 2019-07-17T07:17:26 Z someone_aa Split the sequence (APIO14_sequence) C++17
0 / 100
 337 ms 131072 KB 
#include <bits/stdc++.h>
#define ll long long 
#define pb push_back
#define mp make_pair
#define x real()
#define y imag()
#define pll pair<ll, ll>
using namespace std;
typedef long long ftype;
typedef complex<ftype> point;
const int maxn = 100100;
ll arr[maxn], n, k;
ll prefix[maxn], suffix[maxn];

ll dot(point a, point b) {
	return (a*conj(b)).x;
}

ll fx(point a, ll d) {
	return dot(a, {d, 1});
}

ll dp[210][maxn];
ll dppntr[210][maxn];

class node {
public:
	point f;
	ll lb, rb;
	node *lchild, *rchild;
	int ind;

	node(ll _lb, ll _rb) {
		lb = _lb;
		rb = _rb;
		lchild = rchild = NULL;
		f = {0, INT_MIN};
		ind = 0;
	}
	void update(point nw, int _ind) {
		ll mid = (lb + rb) / 2;

		// SOMETHING NOT OKAY HERE
		bool lft = fx(nw, lb) > fx(f, lb);
		bool md = fx(nw, mid) > fx(f, mid);

		if(md) {
			swap(nw, f);
			swap(ind, _ind);
		}

		if(lb == rb) return;

		if(lft == md) {
			// they don't intersect in left, they might intersect in right part
			if(rchild == NULL) rchild = new node(mid+1, rb);
			rchild -> update(nw, _ind);
		}
		else {
			// they intersect in left part, continue searching in left
			if(lchild == NULL) lchild = new node(lb, mid);
			lchild -> update(nw, _ind);
		}
	}
	pll query(ll p) {
		ll mid = (lb + rb) / 2;

		if(lb == rb) return {fx(f, p), ind};
		else {
			if(p <= mid) {
				pll val = {INT_MIN, INT_MIN};
				if(lchild != NULL) val = lchild -> query(p);
				
				if(fx(f, p) > val.first) return {fx(f, p), ind};
				else return val;
			}
			else {
				pll val = {INT_MIN, INT_MIN};
				if(rchild != NULL) val = rchild -> query(p);
				
				if(fx(f, p) > val.first) return mp(fx(f, p), ind);
				else return val;
			}
		}
	}
};

int main() {
	cin>>n>>k;
	for(int i=1;i<=n;i++) {
		cin>>arr[i];
		prefix[i] = prefix[i-1] + arr[i];
	}

	for(int i=n;i>=1;i--) {
		suffix[i] = suffix[i+1] + arr[i];
	}

	for(int i=1;i<=n;i++) {
		dp[1][i] = prefix[i] * suffix[i+1];
	}

 	for(int p=2;p<=k;p++) {
 		node *root = new node(0, 1e9);
 		for(int i=1;i<=n;i++) {
 			root -> update({-prefix[i-1], dp[p-1][i-1]}, i-1);

 			if(i <= p) {
 				dp[p][i] = INT_MIN;
 				continue;
 			} 

 			pll qr = root -> query(suffix[i+1]);

 			dp[p][i] = qr.first + prefix[i] * suffix[i+1];
 			dppntr[p][i] = qr.second;
 		
 			//root -> update({-prefix[i-1], dp[p-1][i-1]}, i-1);
 		}

 		/*for(int i=1;i<=n;i++) {
 			for(int lst=i;lst>=1;lst--) {
 				if(dp[p-1][lst-1] + (prefix[i] - prefix[lst-1]) * suffix[i+1] > dp[p][i]) {
 					dp[p][i] = dp[p-1][lst-1] + (prefix[i] - prefix[lst-1]) * suffix[i+1];
 					dppntr[p][i] = lst-1;
 				}
 			}
 		}*/
 	}
 	
 	ll result = LLONG_MIN;
 	ll lst = 0;
 	for(int i=1;i<n;i++) {
 		if(dp[k][i] >= result) {
 			result = dp[k][i];
 			lst = i;
 		}
 	}

 	/*for(int p=1;p<=k;p++) {
 		cout<<p<<": ";
 		for(int i=1;i<=n;i++) {
 			cout<<dp[p][i]<<" ";
 		} cout<<"\n";
 	}*/

 	//lst++;
 	//cout<<lst<<"\n";

 	vector<int>v;
 	int p = k;
 	while(lst > 0) {
 		v.pb(lst);
 		lst = dppntr[p][lst];
 		p--;
 	}

 	//reverse(v.begin(), v.end());

 	cout<<result<<"\n";
 	for(int i:v) {
 		cout<<i<<" ";
 	} cout<<"\n";

 	//cout<<"KRAJ: "<<v.size()<<"\n";
}

Subtask #1
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 504 KB contestant found the optimal answer: 1542524 == 1542524
5 Incorrect 2 ms 504 KB Unexpected end of file - int32 expected
6 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 508 KB contestant found the optimal answer: 1093956 == 1093956
2 Incorrect 2 ms 376 KB contestant didn't find the optimal answer: 202461680 < 302460000
3 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB contestant found the optimal answer: 610590000 == 610590000
2 Incorrect 2 ms 376 KB contestant didn't find the optimal answer: 211798415 < 311760000
3 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 760 KB contestant found the optimal answer: 21503404 == 21503404
2 Incorrect 3 ms 376 KB contestant didn't find the optimal answer: 140403179 < 140412195
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 3540 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 9 ms 1016 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Runtime error 263 ms 131072 KB Execution killed with signal 9 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 153 ms 23520 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 127 ms 19540 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Runtime error 337 ms 131072 KB Execution killed with signal 9 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -