oj.uz

Submission #250664

# Submission time Handle Problem Language Result Execution time Memory
250664 2020-07-18T16:02:20 Z Evirir Split the sequence (APIO14_sequence) C++17
71 / 100
 263 ms 131076 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define watch(x) cout<<(#x)<<"="<<(x)<<'\n'
#define mset(d,val) memset(d,val,sizeof(d))
#define setp(x) cout<<fixed<<setprecision(x)
#define forn(i,a,b) for(int i=(a);i<(b);i++)
#define fore(i,a,b) for(int i=(a);i<=(b);i++)
#define pb push_back
#define F first
#define S second
#define pqueue priority_queue
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef long double ld;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> pbds;
void amin(ll &a, ll b){ a=min(a,b); }
void amax(ll &a, ll b){ a=max(a,b); }
void YES(){cout<<"YES\n";} void NO(){cout<<"NO\n";}
void SD(int t=0){ cout<<"PASSED "<<t<<endl; }
const ll INF = ll(1e18);
const int MOD = 998244353;

struct Line {
	ll m, b;
	Line(ll _m, ll _b) : m(_m), b(_b) {}
	inline ll eval(ll x) { return m * x + b; }
};

struct ConvexHull {
	deque<Line> d;
	inline void clear() { d.clear(); }
	bool irrelevant(Line Z) {
		if(int(d.size()) < 2) return false;
		Line X = d[int(d.size())-2], Y = d[int(d.size())-1];
		return (X.b - Z.b) * (Y.m - X.m) <= (X.b - Y.b) * (Z.m - X.m);
	}
	void addline(ll m, ll b) {
		Line l = Line(m,b);
		while(irrelevant(l)) d.pop_back();
		d.push_back(l);
	}
	Line query(ll x) {
		if(d.empty()) return Line{0,0};
		while(int(d.size()) > 1 && (d[0].b - d[1].b <= x * (d[1].m - d[0].m))) d.pop_front();
		return d.front();
	}
};

const bool DEBUG = 0;
const int MAXN = 100005;
const int MAXK = 205;

int n,K;
ll s[MAXN], dp[MAXK][MAXN], nxt[MAXK][MAXN];

int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	
	cin>>n>>K;
	forn(i,0,n){
		cin>>s[i];
		if(i>0) s[i]+=s[i-1];
	}
	
	ConvexHull cht;
	
	fore(i,1,K)
	{
		cht.clear();
		forn(j,0,n)
		{
			Line res = cht.query(s[j]);
			nxt[i][j] = res.m;
			dp[i][j] = res.eval(s[j]);
			cht.addline(s[j], dp[i-1][j]-s[j]*s[j]);
		}
	}
	
	vi ans;
	int cur=n-1;
	for(int i=K;i>=1;i--){
		for(int j=cur-1;j>=0;j--){
			if(s[j]==nxt[i][cur]){
				ans.pb(j);
				cur=j;
				break;
			}
		}
	}
	
	cout<<dp[K][n-1]<<'\n';
	for(ll x: ans) cout<<x+1<<" ";
	cout<<'\n';
	
	return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 384 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 2 ms 3200 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 0 ms 384 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 2 ms 2304 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 2 ms 2944 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 3 ms 3328 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 1 ms 1024 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 1 ms 768 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 1 ms 1152 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1024 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 2 ms 1024 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 63 ms 33912 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 2 ms 1024 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 46 ms 20600 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 54 ms 23928 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 54 ms 25592 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 39 ms 20856 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 49 ms 23868 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 60 ms 30584 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 6412 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 29 ms 6456 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Runtime error 263 ms 131076 KB Execution killed with signal 9 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -