oj.uz

Submission #199407

# Submission time Handle Problem Language Result Execution time Memory
199407 2020-02-01T09:17:31 Z mrtsima22 Split the sequence (APIO14_sequence) C++17
100 / 100
 1501 ms 81940 KB 
#pragma GCC optimize "-O3"
#pragma GCC optimize("Ofast")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define NumberOfOnes __builtin_popcount
#define LSOne(S) (S & (-S))
#define ll long long
#define two pair<ll,ll>
#define twoll pair<ll,ll>
#define four pair<two,two>
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define y1 y1922
#define INF 1000000000000000000
#define P 1000000007
#define lmax 1000000000
#define nn 1000003
#define ff first.first
#define fs first.second
#define sf second.first
#define ss second.second
#define f first
#define s second
#define vi vector<ll>
#define vll vector<ll>
#define vtwo vector<two>
#define ALL(container) (container).begin(), (container).end()
#define sz(container) (ll)(container.size())
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define mid(a,b) (a+b>>1)
#define minN 0
#define maxN 10000000
#define na(x) ((x)<P?(x):(x)-P)
#define ab(a) (-(a)<(a)?(a):-(a))
#define FAST std::ios::sync_with_stdio(false)
#define xRand mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define rnd rng
#define IT iterator
typedef
tree<
  ll,// aq pair<ll,ll> shegidzlia
  null_type,
  less/*_equal*/<ll>,// aqac
  rb_tree_tag,
  tree_order_statistics_node_update>
ordered_set;
// '_equal' mashin ginda roca multiset gchirdeba
template<class key, class value,class cmp = std::less<key>>
using ordered_map = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;
ordered_map<ll, ll> my_map;
inline ll rin(){
	ll x=0,w=1;char ch=getchar();
	while ((ch<'0'||ch>'9')&&ch!='-') ch=getchar();
	if (ch=='-') w=0,ch=getchar();
	while (ch>='0'&&ch<='9') x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
	return w?x:-x;
}
inline ll bin(){
	ll x=0;char ch=getchar();
	while (ch<'0'||ch>'9') ch=getchar();
	while (ch>='0'&&ch<='9') x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
	return x;
}
int v;
ll n,k,a[100003],pref[100003],dp[2][100003];
int p[220][100003];
ll f(int l,int r,int k){
	ll a=pref[k]-pref[l-1];
	ll b=pref[r]-pref[k];
	return a*b;
}
void solve(int l,int r,int optl,int optr){
	if(l>r)
		return;
//	cout<<l<<" "<<r<<" "<<optl<<" "<<optr<<" "<<v<<endl;
	int t=v&1;
	int mid=l+r>>1;
	twoll opt={-INF,-1};
	for(int i=optl;i<=min(mid-1,optr);i++){
		opt=max(opt,mk((ll)dp[t^1][i]+f(i+1,n,mid),(ll)i));
	}
	dp[t][mid]=opt.f;
	p[v][mid]=opt.s;
 
	solve(l,mid-1,optl,opt.s);
	solve(mid+1,r,opt.s,optr);
}
void bt(int k, int n){
	if(!k) return;
	cout<<n<<" ";
	bt(k-1,p[k][n]);
}
int main(){FAST;xRand;
cin>>n>>k;
for(int i=1;i<=n;i++){
	cin>>a[i]; 
	pref[i]=pref[i-1]+a[i];
}
for(int i=1;i<=k;i++){
	v=i;
	solve(1,n,0,n);
}
int g=k;
for(int i=1;i<n;i++)
	if(dp[k&1][i]>=dp[k&1][g])
		g=i;
cout<<dp[k&1][g]<<endl;
bt(k,g);

	// you should actually read the stuff at the bottom
}//                     
/*

7 3
4 1 3 4 0 2 3

*/
/* stuff you should look for
	* ll overflow, array bounds
	* special cases (n=1?), slow multiset operations
	* do smth instead of nothing and stay organized
	* unordered_map, hash_map, scanf, calculate answer instead of ans*K
*/
/*
for(ll i=1;i<=n;i++){
	for(ll j=1;j<=k;j++){
		for(ll o=0;o<i;o++){
			x=(sm[i]-sm[o])*(sm[n]-sm[i])+
			dp[o][j-1];

//			sm[i]*sm[n]-sm[i]*sm[i]-(sm[n]-sm[i])*sm[o]+dp[o][j-1];
//			A          -B          -C*sm[o]+dp[o][j-1]

			if(x>=dp[i][j]){
				dp[i][j]=x;
				p[i][j]=o;
			}
		}
	}
}
*/
//			https://cp-algorithms.com/geometry/convex_hull_trick.html
//			https://cp-algorithms.com/dynamic_programming/divide-and-conquer-dp.html

/*


                   *         *
                  * *       * *
                 *   *     *   *
                *     *   *     *
                 *   *   * *   *
                  *   *   *   *
                   *   * *   *
                     *  *   *
					   *  *


*/

Compilation message

sequence.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("unroll-loops")
 
sequence.cpp: In function 'void solve(int, int, int, int)':
sequence.cpp:82:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=l+r>>1;
          ~^~

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 5 ms 376 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 6 ms 1400 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 5 ms 376 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 7 ms 1144 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 7 ms 1400 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 6 ms 1432 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 5 ms 632 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 5 ms 508 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 5 ms 632 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 504 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 5 ms 376 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 11 ms 2044 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 5 ms 380 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 16 ms 2168 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 14 ms 1912 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 13 ms 2168 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 11 ms 2168 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 7 ms 760 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 8 ms 1016 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 888 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 8 ms 888 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 76 ms 9464 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 8 ms 888 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 83 ms 5880 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 100 ms 6776 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 73 ms 7288 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 58 ms 6052 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 73 ms 6776 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 87 ms 8608 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 4600 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 28 ms 4600 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 747 ms 81784 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 25 ms 4600 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1501 ms 81940 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 915 ms 58400 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 761 ms 62200 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 531 ms 51320 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 760 ms 58360 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 951 ms 73976 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845