oj.uz

Submission #41992

# Submission time Handle Problem Language Result Execution time Memory
41992 2018-02-22T07:06:29 Z fest Split the sequence (APIO14_sequence) C++14
100 / 100
 1739 ms 122444 KB 
// fest
#include <bits/stdc++.h>	

#define pb push_back
#define F first
#define S second
#define y1 dasdasfasfas
#define x1 wqdadfasfasfas
#define All(c) c.begin(), c.end()
#define SZ(A) (int((A).size()))
#define umap unordered_map
#define FILENAME ""
#define __ fflush(stdout)

typedef long long ll;
typedef long double ld;    

using namespace std;

void FREOPEN() {
	#ifdef COMP
		freopen(".in", "r", stdin);
		freopen("1.out", "w", stdout);
	#endif
}                           

inline double Time() {return (clock() * 1.0) / CLOCKS_PER_SEC; }             

const int N = 100001, M = 101, inf = 1e9 * 2, MOD = (int)1e9 + 7;

char CH[N];

const double eps = 1e-14;

const ll INF = 1e18;

const int dx[] = {1, -1, 0, 0, -1, 1, -1, 1};
const int dy[] = {0, 0, 1, -1, -1, 1, 1, -1};

int pref[N], a[N], pr[N][M];

ll dp[N][M];

pair<int, pair<ll, int> > lines[N];

double meet(int a1, ll b1, int a2, ll b2) {
	return (double)(b2 - b1) / (double)(a1 - a2);
}

void calc(int real, int n, int k) {
	for (int i = 0; i <= n; i++) dp[i][0] = -INF, pr[i][0] = -1;
	dp[0][0] = 0;
	for (int bl = 1; bl <= k; bl++) {
		for (int i = 0; i <= n; i++) dp[i][bl % M] = -INF, pr[i][bl % M] = - 1;
		int rig = 0;
		lines[rig++] = {-pref[bl - 1], {dp[bl - 1][(bl - 1) % M], bl - 1}};
		int lef = 0;
		for (int i = bl; i <= n; i++) {
			int x = pref[real] - pref[i];
			while (lef + 1 < rig && x * 1ll * lines[lef].F + lines[lef].S.F < x * 1ll * lines[lef + 1].F + lines[lef + 1].S.F) lef++;
			dp[i][bl % M] = x * 1ll * pref[i] + x * 1ll * lines[lef].F + lines[lef].S.F;
			pr[i][bl % M] = lines[lef].S.S;
			while (rig >= 2 && meet(lines[rig - 1].F, lines[rig - 1].S.F, -pref[i], dp[i][(bl - 1) % M]) > meet(lines[rig - 2].F, lines[rig - 2].S.F, -pref[i], dp[i][(bl - 1) % M]) - eps) rig--;
			while (rig && lines[rig - 1].F == -pref[i] && lines[rig - 1].S.F == dp[i][(bl - 1) % M]) rig--;
			lines[rig++] = {-pref[i], {dp[i][(bl - 1) % M], i}};
			if (lef >= rig) lef = rig - 1;
		}
	}
}

int main() {
  
	FREOPEN();
	int n, k;
	cin >> n >> k;
	for (int i = 1; i <= n; i++) scanf("%d ", a + i);
	for (int i = 1; i <= n; i++) pref[i] = pref[i - 1] + a[i];
	calc(n, n, k);
  int pos = 0;
	ll ans = -INF;
	for (int i = 1; i <= n; i++) {
		if (ans < dp[i][k % M]) {
			ans = dp[i][k % M];
			pos = i;
		}
	}
	vector<int> out;
	cout << ans << endl;
	int bl = k;
	while (true) {
		int last = bl % M;
		bool ok = 0;
		for (int i = last; bl > 0; i = (i - 1 + M) % M, bl--) {
			if (ok && i == last) break;
			out.pb(pos);
			pos = pr[pos][i];
			ok = 1;
		}
		if (!bl) break;
		calc(n, pos, bl);	
	}
	sort(All(out));
	for (auto i : out) printf("%d ", i);
	return 0;	
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:76:50: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 1; i <= n; i++) scanf("%d ", a + i);
                                                  ^

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 12652 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 11 ms 12652 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 125 ms 12812 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 12 ms 12812 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 80 ms 12812 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 84 ms 12812 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 96 ms 12812 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 67 ms 12812 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 74 ms 12908 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 103 ms 12908 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 130 ms 121824 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 130 ms 121964 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 1615 ms 122348 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 114 ms 122348 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1739 ms 122348 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 1205 ms 122348 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 1178 ms 122444 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 872 ms 122444 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 1124 ms 122444 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 1481 ms 122444 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845