oj.uz

Submission #552853

# Submission time Handle Problem Language Result Execution time Memory
552853 2022-04-24T07:34:29 Z mars4 Split the sequence (APIO14_sequence) C++17
100 / 100
 1097 ms 82160 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 ff              first
#define ss              second
#define ll              int64_t
#define ld              long double
#define nl              cout<<"\n"
#define i128            __int128_t
#define all(v)          v.begin(),v.end()
#define mset(a,v)       memset((a),(v),sizeof(a))
#define forn(i,a,b)     for(int64_t i=int64_t(a);i<int64_t(b);++i)
#define forb(i,a,b)     for(int64_t i=int64_t(a);i>=int64_t(b);--i)
#define fastio()        ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

#define mod         1'000'000'007
#define mod2        998'244'353 
#define inf         1'000'000'000'000'007
#define pi          3.14159265358979323846

template<class key,class cmp=std::less<key>>
using ordered_set=tree<key,null_type,cmp,rb_tree_tag,tree_order_statistics_node_update>;

template<class L,class R> ostream& operator<<(ostream& out,pair<L,R> &p)        {return out<<"("<<p.ff<<", "<<p.ss<<")";}
template<class T> ostream& operator<<(ostream& out,vector<T> &v)                {out<<"[";for(auto it=v.begin();it!=v.end();++it){if(it!=v.begin())out<<", ";out<<*it;}return out<<"]";}
template<class T> ostream& operator<<(ostream& out,deque<T> &v)                 {out<<"[";for(auto it=v.begin();it!=v.end();++it){if(it!=v.begin())out<<", ";out<<*it;}return out<<"]";}
template<class T> ostream& operator<<(ostream& out,set<T> &s)                   {out<<"{";for(auto it=s.begin();it!=s.end();++it){if(it!=s.begin())out<<", ";out<<*it;}return out<<"}";}
template<class T> ostream& operator<<(ostream& out,ordered_set<T> &s)           {out<<"{";for(auto it=s.begin();it!=s.end();++it){if(it!=s.begin())out<<", ";out<<*it;}return out<<"}";}
template<class L,class R> ostream& operator<<(ostream& out,map<L,R> &m)         {out<<"{";for(auto it=m.begin();it!=m.end();++it){if(it!=m.begin())out<<", ";out<<*it;}return out<<"}";}

void dbg_out() {cerr<<"]\n";}
template<typename Head,typename... Tail> 
void dbg_out(Head H,Tail... T) {cerr<<H;if(sizeof...(Tail))cerr<<", ";dbg_out(T...);}
#ifdef LOCAL
#define dbg(...) cerr<<"["<<#__VA_ARGS__<<"] = [",dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

//---------------------------------mars4---------------------------------

const ll N=100'000;
const ll K=200;
ll a[N];
ll pre[N+1];
int v[K][N];
vector<ll> dp1(N);
vector<ll> dp2(N);
ll sz;

ll sum(ll l,ll r)
{
	return pre[r+1]-pre[l];
}

void calc(ll l,ll r,ll optL,ll optR,ll level)
{
	if(l>r or l==sz-1)
	{
		return;
	}
	ll mid=(l+r)>>1;
	pair<ll,ll> best={LLONG_MIN,-1};
	for(ll i=optL;i<=min(mid,optR);i++)
	{
		ll ex=sum(i,mid)*sum(mid+1,sz-1);
		ll val=(i?dp1[i-1]:0)+ex;
		if(val>best.ff)
		{
			best={val,i};
		}
	}
	dp2[mid]=best.ff;
	ll opt=best.ss;
	v[level][mid]=opt;
	calc(l,mid-1,optL,opt,level);
	calc(mid+1,r,opt,optR,level);
}

int main()
{
	fastio();
	ll z,n,m,t,k,i,j,l,d,h,r;
	cin>>n>>k;
	sz=n;
	forn(i,0,n)
	{
		cin>>a[i];
		pre[i+1]=pre[i]+a[i];
	}
	forn(i,0,k)
	{
		calc(i,n-1,i,n-1,i);
		dp1.swap(dp2);
	}
	pair<ll,ll> mval={-1,-1};
	forn(i,0,n-1)
	{
		mval=max(mval,{dp1[i],i});
	}
	vector<ll> ans;
	ll ind=mval.ss;
	forb(i,k-1,0)
	{
		ans.push_back(ind);
		ind=v[i][ind]-1;
	}
	reverse(all(ans));
	cout<<mval.ff<<"\n";
	for(ll i:ans)
	{
		cout<<i+1<<" ";
	}
	nl;
	cerr<<"\nTime elapsed: "<<1000*clock()/CLOCKS_PER_SEC<<"ms\n";
	return 0;
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:87:5: warning: unused variable 'z' [-Wunused-variable]
   87 |  ll z,n,m,t,k,i,j,l,d,h,r;
      |     ^
sequence.cpp:87:9: warning: unused variable 'm' [-Wunused-variable]
   87 |  ll z,n,m,t,k,i,j,l,d,h,r;
      |         ^
sequence.cpp:87:11: warning: unused variable 't' [-Wunused-variable]
   87 |  ll z,n,m,t,k,i,j,l,d,h,r;
      |           ^
sequence.cpp:87:15: warning: unused variable 'i' [-Wunused-variable]
   87 |  ll z,n,m,t,k,i,j,l,d,h,r;
      |               ^
sequence.cpp:87:17: warning: unused variable 'j' [-Wunused-variable]
   87 |  ll z,n,m,t,k,i,j,l,d,h,r;
      |                 ^
sequence.cpp:87:19: warning: unused variable 'l' [-Wunused-variable]
   87 |  ll z,n,m,t,k,i,j,l,d,h,r;
      |                   ^
sequence.cpp:87:21: warning: unused variable 'd' [-Wunused-variable]
   87 |  ll z,n,m,t,k,i,j,l,d,h,r;
      |                     ^
sequence.cpp:87:23: warning: unused variable 'h' [-Wunused-variable]
   87 |  ll z,n,m,t,k,i,j,l,d,h,r;
      |                       ^
sequence.cpp:87:25: warning: unused variable 'r' [-Wunused-variable]
   87 |  ll z,n,m,t,k,i,j,l,d,h,r;
      |                         ^

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 1876 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 2 ms 2900 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 1876 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 2 ms 2644 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 2 ms 2772 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 2 ms 2900 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 1 ms 2132 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 1 ms 2004 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 1 ms 2132 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 1876 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 5 ms 3540 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 1876 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 10 ms 3540 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 7 ms 3284 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 6 ms 3540 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 5 ms 3540 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 3 ms 2260 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 4 ms 2516 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2132 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 2 ms 2132 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 51 ms 10736 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 2 ms 2132 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 61 ms 7260 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 60 ms 8044 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 49 ms 8468 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 34 ms 7380 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 52 ms 8140 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 68 ms 9864 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 4648 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 19 ms 4652 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 490 ms 82160 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 17 ms 5076 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1097 ms 82036 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 665 ms 58344 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 534 ms 62668 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 374 ms 51624 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 536 ms 58572 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 696 ms 74236 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845