Submission #591103

# Submission time Handle Problem Language Result Execution time Memory
591103 2022-07-06T21:27:36 Z GusterGoose27 The short shank; Redemption (BOI21_prison) C++11
45 / 100
2000 ms 63308 KB
#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() {}
	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 clean() {
		for (int i = 1; i < 2*n; i++) mn[i] = pdi(inf, 0);
		fill(lz, lz+2*n, 0);
	}
	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];
	}
};

STree s;

const int iters = 25;

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;
	s = STree(n);
	for (int t = 0; t < iters; t++) {
		bool fin = make_iter(mn, mx);
		if (fin) return 0;
		s.clean();
	}
	//assert(false);
	make_iter(mn, mx, 1);
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 224 KB Output is correct
2 Correct 6 ms 340 KB Output is correct
3 Correct 6 ms 400 KB Output is correct
4 Correct 7 ms 340 KB Output is correct
5 Correct 8 ms 340 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 6 ms 340 KB Output is correct
9 Correct 6 ms 340 KB Output is correct
10 Correct 7 ms 340 KB Output is correct
11 Correct 6 ms 396 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Execution timed out 2078 ms 63308 KB Time limit exceeded
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 224 KB Output is correct
2 Correct 6 ms 340 KB Output is correct
3 Correct 6 ms 400 KB Output is correct
4 Correct 7 ms 340 KB Output is correct
5 Correct 8 ms 340 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 6 ms 340 KB Output is correct
9 Correct 6 ms 340 KB Output is correct
10 Correct 7 ms 340 KB Output is correct
11 Correct 6 ms 396 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 6 ms 340 KB Output is correct
14 Correct 6 ms 392 KB Output is correct
15 Correct 8 ms 396 KB Output is correct
16 Correct 8 ms 396 KB Output is correct
17 Correct 3 ms 340 KB Output is correct
18 Correct 3 ms 340 KB Output is correct
19 Correct 8 ms 396 KB Output is correct
20 Correct 7 ms 340 KB Output is correct
21 Correct 6 ms 340 KB Output is correct
22 Correct 6 ms 340 KB Output is correct
23 Correct 68 ms 828 KB Output is correct
24 Correct 69 ms 724 KB Output is correct
25 Correct 67 ms 836 KB Output is correct
26 Correct 67 ms 788 KB Output is correct
27 Correct 67 ms 828 KB Output is correct
28 Correct 67 ms 724 KB Output is correct
29 Correct 69 ms 872 KB Output is correct
30 Correct 59 ms 852 KB Output is correct
31 Correct 59 ms 852 KB Output is correct
32 Correct 62 ms 852 KB Output is correct
33 Correct 62 ms 828 KB Output is correct
34 Correct 29 ms 836 KB Output is correct
35 Correct 67 ms 852 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1988 ms 14276 KB Output is correct
3 Correct 1984 ms 15012 KB Output is correct
4 Correct 1860 ms 15344 KB Output is correct
5 Correct 1847 ms 15472 KB Output is correct
6 Correct 1838 ms 15568 KB Output is correct
7 Correct 1613 ms 15180 KB Output is correct
8 Correct 1618 ms 15356 KB Output is correct
9 Correct 1830 ms 15816 KB Output is correct
10 Correct 1829 ms 14784 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 224 KB Output is correct
2 Correct 6 ms 340 KB Output is correct
3 Correct 6 ms 400 KB Output is correct
4 Correct 7 ms 340 KB Output is correct
5 Correct 8 ms 340 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 6 ms 340 KB Output is correct
9 Correct 6 ms 340 KB Output is correct
10 Correct 7 ms 340 KB Output is correct
11 Correct 6 ms 396 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 6 ms 340 KB Output is correct
14 Correct 6 ms 392 KB Output is correct
15 Correct 8 ms 396 KB Output is correct
16 Correct 8 ms 396 KB Output is correct
17 Correct 3 ms 340 KB Output is correct
18 Correct 3 ms 340 KB Output is correct
19 Correct 8 ms 396 KB Output is correct
20 Correct 7 ms 340 KB Output is correct
21 Correct 6 ms 340 KB Output is correct
22 Correct 6 ms 340 KB Output is correct
23 Correct 68 ms 828 KB Output is correct
24 Correct 69 ms 724 KB Output is correct
25 Correct 67 ms 836 KB Output is correct
26 Correct 67 ms 788 KB Output is correct
27 Correct 67 ms 828 KB Output is correct
28 Correct 67 ms 724 KB Output is correct
29 Correct 69 ms 872 KB Output is correct
30 Correct 59 ms 852 KB Output is correct
31 Correct 59 ms 852 KB Output is correct
32 Correct 62 ms 852 KB Output is correct
33 Correct 62 ms 828 KB Output is correct
34 Correct 29 ms 836 KB Output is correct
35 Correct 67 ms 852 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1988 ms 14276 KB Output is correct
38 Correct 1984 ms 15012 KB Output is correct
39 Correct 1860 ms 15344 KB Output is correct
40 Correct 1847 ms 15472 KB Output is correct
41 Correct 1838 ms 15568 KB Output is correct
42 Correct 1613 ms 15180 KB Output is correct
43 Correct 1618 ms 15356 KB Output is correct
44 Correct 1830 ms 15816 KB Output is correct
45 Correct 1829 ms 14784 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 6 ms 340 KB Output is correct
48 Correct 6 ms 340 KB Output is correct
49 Correct 7 ms 340 KB Output is correct
50 Correct 8 ms 404 KB Output is correct
51 Correct 3 ms 340 KB Output is correct
52 Correct 3 ms 340 KB Output is correct
53 Correct 7 ms 340 KB Output is correct
54 Correct 7 ms 328 KB Output is correct
55 Correct 7 ms 328 KB Output is correct
56 Correct 7 ms 408 KB Output is correct
57 Correct 71 ms 852 KB Output is correct
58 Correct 67 ms 852 KB Output is correct
59 Correct 66 ms 852 KB Output is correct
60 Correct 70 ms 852 KB Output is correct
61 Correct 68 ms 868 KB Output is correct
62 Correct 67 ms 760 KB Output is correct
63 Correct 67 ms 864 KB Output is correct
64 Correct 59 ms 852 KB Output is correct
65 Correct 60 ms 852 KB Output is correct
66 Correct 60 ms 852 KB Output is correct
67 Correct 61 ms 852 KB Output is correct
68 Correct 28 ms 852 KB Output is correct
69 Correct 70 ms 864 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 1974 ms 14996 KB Output is correct
72 Correct 1963 ms 15028 KB Output is correct
73 Correct 1870 ms 15204 KB Output is correct
74 Correct 1849 ms 15672 KB Output is correct
75 Correct 1858 ms 15576 KB Output is correct
76 Correct 1634 ms 15128 KB Output is correct
77 Correct 1617 ms 15240 KB Output is correct
78 Correct 1821 ms 15792 KB Output is correct
79 Correct 1844 ms 14952 KB Output is correct
80 Execution timed out 2003 ms 15012 KB Time limit exceeded
81 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 224 KB Output is correct
2 Correct 6 ms 340 KB Output is correct
3 Correct 6 ms 400 KB Output is correct
4 Correct 7 ms 340 KB Output is correct
5 Correct 8 ms 340 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 6 ms 340 KB Output is correct
9 Correct 6 ms 340 KB Output is correct
10 Correct 7 ms 340 KB Output is correct
11 Correct 6 ms 396 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Execution timed out 2078 ms 63308 KB Time limit exceeded
14 Halted 0 ms 0 KB -