oj.uz

Submission #245181

# Submission time Handle Problem Language Result Execution time Memory
245181 2020-07-05T16:30:13 Z thomas_li Split the sequence (APIO14_sequence) C++17
100 / 100
 1025 ms 81556 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using pi = pair<int, int>;
using pll = pair<ll, ll>;
constexpr int INF = 0x3f3f3f3f; constexpr ll LLINF = 0x3f3f3f3f3f3f3f3f;
#ifdef __MINGW32__
inline int getchar_unlocked() { return _getchar_nolock(); }
inline int putchar_unlocked(int c) { return _putchar_nolock(c); }
#endif
#define gc getchar_unlocked()
#define pc(x) putchar_unlocked(x)
template<typename T> void scan(T &x){x = 0;bool _=0; T c=gc;_=c==45;c=_?gc:c;while(c<48||c>57)c=gc;for(;c<48||c>57;c=gc);for(;c>47&&c<58;c=gc)x=(x<<3)+(x<<1)+(c&15);x=_?-x:x;}
template<typename T> void printn(T n){bool _=0;_=n<0;n=_?-n:n;char snum[65];int i=0;do{snum[i++]=n%10+48;n/= 10;}while(n);--i;if (_)pc(45);while(i>=0)pc(snum[i--]);}
template<typename First, typename ... Ints> void scan(First &arg, Ints&... rest){scan(arg);scan(rest...);}
template<typename T> void print(T n){printn(n);pc(10);}
template<typename First, typename ... Ints> void print(First arg, Ints... rest){printn(arg);pc(32);print(rest...);}
#define db(x)       { cerr << #x << " = " << x << endl; }
template <typename T> void _dbarr(T* a, size_t sz){ for(int i = 0; i < sz; i++) cerr << a[i] << " \n"[i == sz-1]; }
template <typename T> void _dbarr(vector<T> a, size_t sz){ for(int i = 0; i < sz; i++) cerr << a[i] << " \n"[i == sz-1]; }
#define dbarr(x, n) {cerr << #x << ": "; _dbarr((x),(n));}
#define pb push_back
#define eb emplace_back
const int MM = 1e5+5;
int n,k,par[205][MM];

ll a[MM], pre[MM], cur[MM];

ld slope(int i, int j)
{
	if(a[i] == a[j]) return -INF;
	return (ld)((pre[i]-a[i]*a[i])-(pre[j] - a[j]*a[j]))/(a[j]-a[i]);
}

int main() 
{
	cin.tie(0)->sync_with_stdio(0);
	cin >> n >> k;

	for(int i = 1; i <= n; i++)
		cin >> a[i], a[i] += a[i-1];
	
	for(int j = 1; j <= k; j++)
	{
		deque<int> q;
		q.push_back(0);
		for(int i = 1; i <= n; i++)
		{
			while(q.size() >= 2 && slope(q[0], q[1]) <= a[i]) q.pop_front();
			cur[i] = pre[q[0]]+a[q[0]]*(a[i]-a[q[0]]);
			par[j][i] = q[0];
			while(q.size() >= 2 && slope(q[q.size()-2], q[q.size()-1]) >= slope(q[q.size()-1], i)) q.pop_back();
			q.push_back(i);
		}
		copy(cur, cur+n,pre);
	}
	
	cout << cur[n] << "\n";
	stack<int> st;
	int i = n, j = k;
	while(j >= 1)
	{
		i = par[j][i];
		j--;
		st.push(i);
	}
	
	while(!st.empty())
	{
		cout << st.top() << " ";
		st.pop();
	}
	cout << "\n";
}

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 768 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 7 ms 768 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 75 ms 9336 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 7 ms 768 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 64 ms 5880 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 67 ms 6776 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 83 ms 7208 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 55 ms 6008 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 63 ms 6776 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 85 ms 8568 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 4184 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 24 ms 4160 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 777 ms 81556 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 25 ms 4372 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1025 ms 81436 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 647 ms 58064 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 780 ms 61976 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 544 ms 50920 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 599 ms 58172 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 757 ms 73756 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845