oj.uz

답안 #340412

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
340412 2020-12-27T14:45:18 Z ogibogi2004 수열 (APIO14_sequence) C++14
100 / 100
 1466 ms 86380 KB 
#include<bits/stdc++.h>
using namespace std;
#define ld long long
#define ll long long
const ld INF=2e9;
const ll MAXN=1e5+6;
const ll MAXK=202;
ll dp[MAXN][2],a[MAXN];
ll last1[208][208];
ll dp1[208][208];
int last[MAXN][MAXK];
struct line
{
	ld a,b;
	ll pos;
	ld intersect(line const& other)
	{
		if(other.a==a)return -INF;
		else return (ld)(other.b-b)/(a-other.a);
	}
	ld gety(ld x)
	{
		return (ld)a*x+b;
	}
};
struct ConvexHull
{
	deque<line>dq;
	bool yoda(line l)
	{
		ld int1=l.intersect(dq.back());
		ld int2=dq.back().intersect(dq[dq.size()-2]);
		ld int3=l.intersect(dq[dq.size()-2]);
		if(int1==-INF)
		{
			if(l.b>=dq.back().b)return 1;
			else return 0;
		}
		if(int3>int2)return 1;
		else return 0;
	}
	void add(line l)
	{
		while(dq.size()>1&&yoda(l))
		{
			dq.pop_back();
		}
		if(dq.empty())dq.push_back(l);
		else if(!(l.a==dq.back().a&&l.b>dq.back().b))
		{
			dq.push_back(l);
		}
	}
	/*pair<ld,ld> query(ld x)
	{
		ll l=0,r=dq.size()-1,mid;
		while(l<r)
		{
			mid=(l+r)/2;
			if(dq[mid].gety(x)<dq[mid+1].gety(x))
			{
				l=mid+1;
			}
			else r=mid;
		}
		//cout<<x<<" "<<dq[l].a<<" "<<dq[l].b<<endl;
		return {dq[l].gety(x),dq[l].pos};
	}*/
	pair<ld,ld> query(ld x)
	{
		while(dq.size()>1&&dq[1].gety(x)>dq[0].gety(x))
		{
			dq.pop_front();
		}
		return {dq.front().gety(x),dq.front().pos};
	}
}ch[2];
ll n,k;
ll pref[MAXN];
int main()
{
	ios_base::sync_with_stdio(false);cin.tie(NULL);
	cout.tie(NULL);
	cin>>n>>k;
	for(ll i=1;i<=n;++i)
	{
		cin>>a[i];
		pref[i]=pref[i-1]+a[i];
	}
	if(n<=200)
	{
		for(int i=0;i<=n;i++)
		{
			for(int j=0;j<=k;j++)
			{
				dp1[i][j]=-1;
			}
		}
		for(int i=1;i<=n;i++)
		{
			dp1[i][0]=0;
		}
		for(int j=1;j<=k;j++)
		{
			for(int i=1;i<=n;i++)
			{
				for(int i1=1;i1<i;i1++)
				{
					if(dp1[i1][j-1]+pref[i1]*(pref[i]-pref[i1])>dp1[i][j])
					{
						dp1[i][j]=dp1[i1][j-1]+pref[i1]*(pref[i]-pref[i1]);
						last1[i][j]=i1;
					}
				}
			}
		}
		cout<<dp1[n][k]<<endl;
		int u=n;
		while(u!=0)
		{
			u=last1[u][k];
			k--;
			if(u==0)break;
			cout<<u<<" ";
		}
		cout<<endl;
		return 0;
	}
	ch[0].add({0,0,0});
	for(int j=1;j<=k+1;++j)
	{
		ch[j%2].dq.clear();
		ch[j%2].add({0,-INF,-1});
		for(int i=1;i<=n;++i)
		{
			//tie(dp[i][j%2],last[i][j])=ch[1-j%2].query(-pref[i]);
			pair<ld,ld> p=ch[1-j%2].query(-pref[i]);
			dp[i][j%2]=p.first;
			last[i][j]=p.second;
		}
		for(int i=1;i<=n;++i)
		{
			ch[j%2].add({(ld)-pref[i],(ld)dp[i][j%2]-pref[i]*pref[i],i});				
			/*for(auto xd:ch[j%2].dq)cout<<xd.a<<","<<xd.b<<" ";
			cout<<endl;*/
		}
	}
	cout<<dp[n][1-k%2]<<"\n";
	if(dp[n][1-k%2]==0)
	{
		for(int j=1;j<=k;++j)
		{
			cout<<j<<" ";
		}
		cout<<"\n";
		return 0;
	}
	vector<ll>v;
	ll n1=n;
	for(ll i=k;i>=1;--i)
	{
		v.push_back(last[n1][i+1]);
		n1=last[n1][i+1];
	}
	for(auto xd:v)cout<<xd<<" ";
	cout<<"\n";
return 0;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB contestant found the optimal answer: 108 == 108
2 Correct 1 ms 364 KB contestant found the optimal answer: 999 == 999
3 Correct 0 ms 364 KB contestant found the optimal answer: 0 == 0
4 Correct 1 ms 364 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 1 ms 364 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 1 ms 364 KB contestant found the optimal answer: 1 == 1
7 Correct 1 ms 364 KB contestant found the optimal answer: 1 == 1
8 Correct 1 ms 364 KB contestant found the optimal answer: 1 == 1
9 Correct 1 ms 364 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 1 ms 364 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 1 ms 364 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 1 ms 364 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 1 ms 364 KB contestant found the optimal answer: 140072 == 140072
14 Correct 1 ms 364 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 1 ms 364 KB contestant found the optimal answer: 805 == 805
16 Correct 1 ms 364 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 1 ms 364 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 1 ms 492 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 1 ms 492 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 1 ms 492 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 1 ms 492 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 1 ms 492 KB contestant found the optimal answer: 933702 == 933702
7 Correct 1 ms 492 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 1 ms 492 KB contestant found the optimal answer: 687136 == 687136
9 Correct 1 ms 512 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 1 ms 492 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1004 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 1004 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 7 ms 1004 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 1004 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 5 ms 1004 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 7 ms 1004 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 7 ms 1004 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 2 ms 1004 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 2 ms 1004 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 3 ms 1004 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1260 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 1260 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 13 ms 1260 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 1260 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 14 ms 1260 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 12 ms 1260 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 14 ms 1260 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 12 ms 1260 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 3 ms 1260 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 6 ms 1260 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 8832 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 8 ms 8940 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 125 ms 9024 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 8 ms 8940 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 85 ms 8940 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 106 ms 8812 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 106 ms 8940 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 92 ms 8940 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 94 ms 8940 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 119 ms 8940 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 75 ms 85476 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 77 ms 85612 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 1383 ms 86252 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 76 ms 86380 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1466 ms 85740 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 1149 ms 85100 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 1109 ms 86124 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 885 ms 86124 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 1026 ms 85868 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 1316 ms 85868 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845