Submission #591120

# Submission time Handle Problem Language Result Execution time Memory
591120 2022-07-06T21:45:34 Z GusterGoose27 The short shank; Redemption (BOI21_prison) C++11
35 / 100
2000 ms 63160 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 v, int cur = 1) {
		if (lval[cur] >= r || rval[cur] <= l) return;
		if (lval[cur] >= l && rval[cur] <= r) {
			lz[cur] += v;
			mn[cur].first += v;
			return;
		}
		increment(l, r, v, 2*cur);
		increment(l, r, v, 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 = 24;
//const ld prec = 3e-2;

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);
		int pos = uncolored.size()-1;
		while (pos >= 0 && uncolored[pos] < r) pos--;
		pos++;
		int prev = n;
		int mult = uncolored.size()-pos;
		for (int i = pos; i < uncolored.size(); i++) {
			s.increment(uncolored[i], prev, mult);
			prev = uncolored[i];
			mult--;
		}
		int num = uncolored.size()-pos;
		for (int i = 0; i < num; i++) uncolored.pop_back();
	}
	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++) {
	//while (mx-mn > prec) {
		bool fin = make_iter(mn, mx);
		if (fin) return 0;
		s.clean();
	}
	//assert(false);
	make_iter(mn, mx, 1);
}

Compilation message

prison.cpp: In function 'bool make_iter(ld&, ld&, bool)':
prison.cpp:106:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  106 |   for (int i = pos; i < uncolored.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 6 ms 340 KB Output is correct
3 Correct 7 ms 340 KB Output is correct
4 Correct 7 ms 396 KB Output is correct
5 Correct 7 ms 340 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 6 ms 340 KB Output is correct
9 Correct 7 ms 400 KB Output is correct
10 Correct 6 ms 340 KB Output is correct
11 Correct 6 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Execution timed out 2076 ms 63160 KB Time limit exceeded
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 6 ms 340 KB Output is correct
3 Correct 7 ms 340 KB Output is correct
4 Correct 7 ms 396 KB Output is correct
5 Correct 7 ms 340 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 6 ms 340 KB Output is correct
9 Correct 7 ms 400 KB Output is correct
10 Correct 6 ms 340 KB Output is correct
11 Correct 6 ms 340 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 340 KB Output is correct
15 Correct 7 ms 396 KB Output is correct
16 Correct 7 ms 340 KB Output is correct
17 Correct 3 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 7 ms 396 KB Output is correct
20 Correct 6 ms 400 KB Output is correct
21 Correct 6 ms 340 KB Output is correct
22 Correct 6 ms 340 KB Output is correct
23 Correct 66 ms 824 KB Output is correct
24 Correct 66 ms 824 KB Output is correct
25 Correct 64 ms 724 KB Output is correct
26 Correct 66 ms 824 KB Output is correct
27 Correct 68 ms 724 KB Output is correct
28 Correct 66 ms 800 KB Output is correct
29 Correct 64 ms 724 KB Output is correct
30 Correct 60 ms 852 KB Output is correct
31 Correct 58 ms 852 KB Output is correct
32 Correct 58 ms 724 KB Output is correct
33 Correct 60 ms 724 KB Output is correct
34 Correct 30 ms 852 KB Output is correct
35 Correct 67 ms 724 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1784 ms 14272 KB Output is correct
3 Correct 1812 ms 14268 KB Output is correct
4 Correct 1730 ms 14976 KB Output is correct
5 Correct 1608 ms 15012 KB Output is correct
6 Correct 1606 ms 15016 KB Output is correct
7 Correct 1484 ms 14700 KB Output is correct
8 Correct 1460 ms 14960 KB Output is correct
9 Correct 1481 ms 15612 KB Output is correct
10 Incorrect 1640 ms 14340 KB Output isn't correct
11 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 6 ms 340 KB Output is correct
3 Correct 7 ms 340 KB Output is correct
4 Correct 7 ms 396 KB Output is correct
5 Correct 7 ms 340 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 6 ms 340 KB Output is correct
9 Correct 7 ms 400 KB Output is correct
10 Correct 6 ms 340 KB Output is correct
11 Correct 6 ms 340 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 340 KB Output is correct
15 Correct 7 ms 396 KB Output is correct
16 Correct 7 ms 340 KB Output is correct
17 Correct 3 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 7 ms 396 KB Output is correct
20 Correct 6 ms 400 KB Output is correct
21 Correct 6 ms 340 KB Output is correct
22 Correct 6 ms 340 KB Output is correct
23 Correct 66 ms 824 KB Output is correct
24 Correct 66 ms 824 KB Output is correct
25 Correct 64 ms 724 KB Output is correct
26 Correct 66 ms 824 KB Output is correct
27 Correct 68 ms 724 KB Output is correct
28 Correct 66 ms 800 KB Output is correct
29 Correct 64 ms 724 KB Output is correct
30 Correct 60 ms 852 KB Output is correct
31 Correct 58 ms 852 KB Output is correct
32 Correct 58 ms 724 KB Output is correct
33 Correct 60 ms 724 KB Output is correct
34 Correct 30 ms 852 KB Output is correct
35 Correct 67 ms 724 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1784 ms 14272 KB Output is correct
38 Correct 1812 ms 14268 KB Output is correct
39 Correct 1730 ms 14976 KB Output is correct
40 Correct 1608 ms 15012 KB Output is correct
41 Correct 1606 ms 15016 KB Output is correct
42 Correct 1484 ms 14700 KB Output is correct
43 Correct 1460 ms 14960 KB Output is correct
44 Correct 1481 ms 15612 KB Output is correct
45 Incorrect 1640 ms 14340 KB Output isn't correct
46 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 6 ms 340 KB Output is correct
3 Correct 7 ms 340 KB Output is correct
4 Correct 7 ms 396 KB Output is correct
5 Correct 7 ms 340 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 6 ms 340 KB Output is correct
9 Correct 7 ms 400 KB Output is correct
10 Correct 6 ms 340 KB Output is correct
11 Correct 6 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Execution timed out 2076 ms 63160 KB Time limit exceeded
14 Halted 0 ms 0 KB -