Submission #591101

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
591101	2022-07-06T21:25:17 Z	GusterGoose27	The short shank; Redemption (BOI21_prison)	C++11	35 / 100	2000 ms	297440 KB

prison

#include <bits/stdc++.h>

using namespace std;

typedef long double ld;
typedef pair<ld, int> pdi;
typedef pair<int, int> pii;

const int MAXN = 2e6;
pdi dp[MAXN];
const int inf = 1e9;
int n, d, t;
int vals[MAXN];

class STree {
public:
	int n;
	pdi *mn;
	int *lz;
	int *lval;
	int *rval;
	STree(int nn) {
		n = pow(2, ceil(log2(nn)));
		mn = new pdi[2*n];
		lz = new int[2*n];
		lval = new int[2*n];
		rval = new int[2*n];
		for (int i = 1; i < 2*n; i++) mn[i] = pdi(inf, 0);
		fill(lz, lz+2*n, 0);
		for (int i = n; i < 2*n; i++) {
			lval[i] = i-n;
			rval[i] = i-n+1;
		}
		for (int i = n-1; i > 0; i--) {
			lval[i] = lval[2*i];
			rval[i] = rval[2*i+1];
		}
	}
	void increment(int l, int r, int cur = 1) {
		if (lval[cur] >= r || rval[cur] <= l) return;
		if (lval[cur] >= l && rval[cur] <= r) {
			lz[cur]++;
			mn[cur].first++;
			return;
		}
		increment(l, r, 2*cur);
		increment(l, r, 2*cur+1);
		mn[cur] = min(mn[2*cur], mn[2*cur+1]);
		mn[cur].first += lz[cur];
	}
	pdi mnval(int l, int r, int cur = 1, int laz = 0) {
		if (lval[cur] >= r || rval[cur] <= l) return pdi(inf, 0);
		if (lval[cur] >= l && rval[cur] <= r) return pdi(mn[cur].first+laz, mn[cur].second);
		laz += lz[cur];
		return min(mnval(l, r, 2*cur, laz), mnval(l, r, 2*cur+1, laz));
	}
	void update(int i, pdi v, int cur = 1, int laz = 0) {
		if (lval[cur] > i || rval[cur] <= i) return;
		if (cur >= n) {
			mn[cur] = pdi(v.first-laz, v.second);
			return;
		}
		laz += lz[cur];
		update(i, v, 2*cur, laz);
		update(i, v, 2*cur+1, laz);
		mn[cur] = min(mn[2*cur], mn[2*cur+1]);
		mn[cur].first += lz[cur];
	}
};

const int iters = 50;

int get_int(int i) {
	if (vals[i] > t) return i;
	return i+(t-vals[i])+1;
}

bool make_iter(ld &mn, ld &mx, bool force = 0) {
	vector<int> uncolored;
	STree s(n);
	ld cost = (mn+mx)/2;
	for (int i = n-1; i >= 0; i--) {
		if (i == n-1) dp[i] = pdi(0, 0);
		else {
			pdi mnval = s.mnval(i+1, n);
			mnval.first += cost;
			mnval.second++;
			dp[i] = mnval;
		}
		s.update(i, dp[i]);
		uncolored.push_back(i);
		int r = get_int(i);
		while (!uncolored.empty() && uncolored.back() < r) {
			int cur = uncolored.back();
			uncolored.pop_back();
			s.increment(cur, n);
		}
	}
	pdi overall = s.mnval(0, n);
	if (overall.second == d || force) { // we are done
		cout << round(overall.first-cost*d) << "\n";
		return 1;
	}
	if (overall.second < d) mx = cost;
	else mn = cost;
	return 0;
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL);
	cin >> n >> d >> t;
	for (int i = 0; i < n; i++) cin >> vals[i];
	ld mn = 0;
	ld mx = n;
	for (int t = 0; t < iters; t++) {
		bool fin = make_iter(mn, mx);
		if (fin) return 0;
	}
	//assert(false);
	make_iter(mn, mx, 1);
}

Subtask #1
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	13 ms	2548 KB	Output is correct
3	Correct	14 ms	2516 KB	Output is correct
4	Correct	18 ms	2492 KB	Output is correct
5	Correct	16 ms	2560 KB	Output is correct
6	Correct	3 ms	724 KB	Output is correct
7	Correct	3 ms	716 KB	Output is correct
8	Correct	14 ms	2504 KB	Output is correct
9	Correct	14 ms	2516 KB	Output is correct
10	Correct	15 ms	2556 KB	Output is correct
11	Correct	14 ms	2524 KB	Output is correct

Subtask #2
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Execution timed out	2075 ms	199692 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	13 ms	2548 KB	Output is correct
3	Correct	14 ms	2516 KB	Output is correct
4	Correct	18 ms	2492 KB	Output is correct
5	Correct	16 ms	2560 KB	Output is correct
6	Correct	3 ms	724 KB	Output is correct
7	Correct	3 ms	716 KB	Output is correct
8	Correct	14 ms	2504 KB	Output is correct
9	Correct	14 ms	2516 KB	Output is correct
10	Correct	15 ms	2556 KB	Output is correct
11	Correct	14 ms	2524 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	13 ms	2520 KB	Output is correct
14	Correct	13 ms	2504 KB	Output is correct
15	Correct	15 ms	2540 KB	Output is correct
16	Correct	15 ms	2516 KB	Output is correct
17	Correct	3 ms	724 KB	Output is correct
18	Correct	3 ms	724 KB	Output is correct
19	Correct	13 ms	2516 KB	Output is correct
20	Correct	13 ms	2516 KB	Output is correct
21	Correct	13 ms	2516 KB	Output is correct
22	Correct	13 ms	2588 KB	Output is correct
23	Correct	141 ms	18600 KB	Output is correct
24	Correct	139 ms	18588 KB	Output is correct
25	Correct	146 ms	18644 KB	Output is correct
26	Correct	141 ms	18736 KB	Output is correct
27	Correct	139 ms	18636 KB	Output is correct
28	Correct	141 ms	18616 KB	Output is correct
29	Correct	141 ms	18628 KB	Output is correct
30	Correct	126 ms	18668 KB	Output is correct
31	Correct	128 ms	18676 KB	Output is correct
32	Correct	130 ms	18584 KB	Output is correct
33	Correct	129 ms	18584 KB	Output is correct
34	Correct	30 ms	4384 KB	Output is correct
35	Correct	137 ms	18636 KB	Output is correct

Subtask #4
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Execution timed out	2090 ms	297440 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #5
0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	13 ms	2548 KB	Output is correct
3	Correct	14 ms	2516 KB	Output is correct
4	Correct	18 ms	2492 KB	Output is correct
5	Correct	16 ms	2560 KB	Output is correct
6	Correct	3 ms	724 KB	Output is correct
7	Correct	3 ms	716 KB	Output is correct
8	Correct	14 ms	2504 KB	Output is correct
9	Correct	14 ms	2516 KB	Output is correct
10	Correct	15 ms	2556 KB	Output is correct
11	Correct	14 ms	2524 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	13 ms	2520 KB	Output is correct
14	Correct	13 ms	2504 KB	Output is correct
15	Correct	15 ms	2540 KB	Output is correct
16	Correct	15 ms	2516 KB	Output is correct
17	Correct	3 ms	724 KB	Output is correct
18	Correct	3 ms	724 KB	Output is correct
19	Correct	13 ms	2516 KB	Output is correct
20	Correct	13 ms	2516 KB	Output is correct
21	Correct	13 ms	2516 KB	Output is correct
22	Correct	13 ms	2588 KB	Output is correct
23	Correct	141 ms	18600 KB	Output is correct
24	Correct	139 ms	18588 KB	Output is correct
25	Correct	146 ms	18644 KB	Output is correct
26	Correct	141 ms	18736 KB	Output is correct
27	Correct	139 ms	18636 KB	Output is correct
28	Correct	141 ms	18616 KB	Output is correct
29	Correct	141 ms	18628 KB	Output is correct
30	Correct	126 ms	18668 KB	Output is correct
31	Correct	128 ms	18676 KB	Output is correct
32	Correct	130 ms	18584 KB	Output is correct
33	Correct	129 ms	18584 KB	Output is correct
34	Correct	30 ms	4384 KB	Output is correct
35	Correct	137 ms	18636 KB	Output is correct
36	Correct	0 ms	340 KB	Output is correct
37	Execution timed out	2090 ms	297440 KB	Time limit exceeded
38	Halted	0 ms	0 KB	-

Subtask #6
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	13 ms	2548 KB	Output is correct
3	Correct	14 ms	2516 KB	Output is correct
4	Correct	18 ms	2492 KB	Output is correct
5	Correct	16 ms	2560 KB	Output is correct
6	Correct	3 ms	724 KB	Output is correct
7	Correct	3 ms	716 KB	Output is correct
8	Correct	14 ms	2504 KB	Output is correct
9	Correct	14 ms	2516 KB	Output is correct
10	Correct	15 ms	2556 KB	Output is correct
11	Correct	14 ms	2524 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Execution timed out	2075 ms	199692 KB	Time limit exceeded
14	Halted	0 ms	0 KB	-

Submission #591101

Compilation message

Subtask #1 15.0 / 15.0

Subtask #2 0 / 10.0

Subtask #3 20.0 / 20.0

Subtask #4 0 / 10.0

Subtask #5 0 / 25.0

Subtask #6 0 / 20.0

Subtask #1
15.0 / 15.0

Subtask #2
0 / 10.0

Subtask #3
20.0 / 20.0

Subtask #4
0 / 10.0

Subtask #5
0 / 25.0

Subtask #6
0 / 20.0