oj.uz

Submission #114189

# Submission time Handle Problem Language Result Execution time Memory
114189 2019-05-31T08:29:36 Z dorijanlendvaj Split the sequence (APIO14_sequence) C++14
100 / 100
 1395 ms 81016 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
#define pii pair<int,int>
#define pb push_back
#define eb emplace_back

using namespace std;
using namespace __gnu_pbds;

typedef long long int ll;
typedef unsigned long long int ull;
int MOD=1000000007;
int MOD2=998244353;
vector<int> bases;
const ll LLINF=1ll<<60;
const char en='\n';

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void yes() {cout<<"YES"<<en; exit(0);}
void no() {cout<<"NO"<<en; exit(0);}
inline int rund() {int x576363482791fuweh=rng();return abs(x576363482791fuweh)%RAND_MAX;}
template<class T>
void prVec(vector<T> w)
{
	cout<<w.size()<<endl;
	for (int i=0;i<int(w.size())-1;++i) cout<<w[i]<<' ';
	if (w.size()) cout<<w[w.size()-1]<<endl;
}

void M998()
{
	swap(MOD,MOD2);
}

ll raand()
{
	ll a=rund();
	a*=RAND_MAX;
	a+=rund();
    return a;
}

#define rand raand

ll raaand()
{
	return raand()*(MOD-7)+raand();
}

string to_upper(string a)
{
	for (int i=0;i<(int)a.size();++i) if (a[i]>='a' && a[i]<='z') a[i]-='a'-'A';
	return a;
}

string to_lower(string a)
{
	for (int i=0;i<(int)a.size();++i) if (a[i]>='A' && a[i]<='Z') a[i]+='a'-'A';
	return a;
}

ll sti(string a)
{
	ll k=0;
	for (int i=0;i<(int)a.size();++i)
	{
		k*=10;
		k+=a[i]-'0';
	}
	return k;
}

string its(ll k)
{
	if (k==0) return "0";
	string a;
	while (k)
	{
		a.push_back((k%10)+'0');
		k/=10;
	}
	reverse(a.begin(),a.end());
	return a;
}

ll min(ll a,int b)
{
	if (a<b) return a;
	return b;
}

ll min(int a,ll b)
{
	if (a<b) return a;
	return b;
}

ll max(ll a,int b)
{
	if (a>b) return a;
	return b;
}

ll max(int a,ll b)
{
	if (a>b) return a;
	return b;
}

ll gcd(ll a,ll b)
{
	if (b==0) return a;
	return gcd(b,a%b);
}

ll lcm(ll a,ll b)
{
	return a/gcd(a,b)*b;
}

template<class T,class K>
pair<T,K> mp(T a,K b)
{
	return make_pair(a,b);
}

inline int mult(ll a,ll b)
{
	return (a*b)%MOD;
}

inline int pot(int n,int k)
{
	if (k==0) return 1;
	ll a=pot(n,k/2);
	a=mult(a,a);
	if (k%2) return mult(a,n);
	else return a;
}

int divide(int a,int b)
{
	return mult(a,pot(b,MOD-2));
}

inline int sub(int a,int b)
{
	if (a-b>=0) return a-b;
	return a-b+MOD;
}

inline int add(int a,int b)
{
	if (a+b>=MOD) return a+b-MOD;
	return a+b;
}

bool prime(ll a)
{
	if (a==1) return 0;
	for (int i=2;i<=round(sqrt(a));++i)
	{
		if (a%i==0) return 0;
	}
	return 1;
}

ll has(string x)
{
	ll h1=0,h2=0;
	x=to_lower(x);
	for (char a: x)
	{
		h1*=bases[0];
		h1+=a-'a';
		h1%=bases[3];
		h2*=bases[1];
		h2+=a-'a';
		h2%=bases[4];
	}
	return h1*(MOD+13893829)+h2;
}

const int N=100010;
int n,k,op[210][N],ps[N];
ll dp[2][N];
//vector<pair<pii,pii>> v;
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};

/*void addLine(int a,int b)
{
	if (v.empty())
	{
		v.pb({{0,MOD},{a,b}});
		return;
	}
	int c=v.back().y.x,d=v.back().y.y;
	if ((b-d)%(c-a)==0)
	{
		int z=(b-d)/(c-a);
		v.back().x.x=z;
		v.pb({{0,z-1},{a,b}});
	}
	else
	{
		int z=(b-d)/(c-a);
		v.back().x.x=z+1;
		v.pb({{0,z},{a,b}});
	}
}

ll getVal(int x)
{
	auto r=lower_bound(v.rbegin(),v.rend(),mp(mp(x+1,0),mp(0,0)));
	--r;
	return r->y.x*1ll*x+r->y.y;
}*/

void d(int k,int l,int r,int lopt,int ropt)
{
	if (l>=r) return;
	ll ma=-LLINF;
	int opt=MOD;
	int mid=(l+r)/2;
	for (int i=lopt;i<=min(mid-1,ropt);++i)
	{
		ll val=dp[(k+1)%2][i]+1ll*(ps[n]-ps[mid])*(ps[mid]-ps[i]);
		if (val>ma)
		{
			opt=i;
			ma=val;
		}
	}
	dp[k%2][mid]=ma;
	op[k][mid]=opt;
	d(k,l,mid,lopt,opt);
	d(k,mid+1,r,opt,ropt);
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	for (int i=0;i<10;++i) bases.push_back((rand()%MOD+13893829)%MOD);
	cin>>n>>k;
	for (int i=0;i<n;++i)
	{
		int a;
		cin>>a;
		ps[i+1]=ps[i]+a;
	}
	for (int i=1;i<=k;++i)
	{
		d(i,0,n,0,n);
		//for (int j=0;j<n;++j) if (dp[i][j]>0) cout<<dp[i][j]<<' ';
		//else cout<<"-1 ";
		//cout<<en;
	}
	int r=0;
	for (int i=0;i<n;++i) if (dp[k%2][i]>dp[k%2][r]) r=i;
	cout<<dp[k%2][r]<<endl;
	vector<int> a;
	for (int i=k;i>=1;--i)
	{
		a.pb(r);
		r=op[i][r];
	}
	reverse(a.begin(),a.end());
	for (auto b: a) cout<<b<<' ';
}

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 640 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 4 ms 640 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 64 ms 9492 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 5 ms 768 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 79 ms 5752 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 81 ms 6668 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 64 ms 7004 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 46 ms 5880 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 68 ms 6648 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 91 ms 8440 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 3456 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 28 ms 3584 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 697 ms 80900 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 27 ms 3968 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1395 ms 81016 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 867 ms 57336 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 726 ms 61560 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 499 ms 50424 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 722 ms 57596 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 905 ms 73192 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845