oj.uz

Submission #591129

# Submission time Handle Problem Language Result Execution time Memory
591129 2022-07-06T22:01:18 Z GusterGoose27 The short shank; Redemption (BOI21_prison) C++11
70 / 100
 2000 ms 63076 KB 
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")

#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 = 25;
//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;
		}
		// if (dp[i].second > d) {
		// 	mn = cost;
		// 	return 0;
		// }
		if (d == 1 && dp[i].second > d) s.update(i, pdi(inf, 0));
		else 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 = ((ld)n)/d+1;
	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:114:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  114 |   for (int i = pos; i < uncolored.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 7 ms 340 KB Output is correct
3 Correct 6 ms 340 KB Output is correct
4 Correct 7 ms 340 KB Output is correct
5 Correct 9 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 7 ms 400 KB Output is correct
9 Correct 7 ms 340 KB Output is correct
10 Correct 9 ms 340 KB Output is correct
11 Correct 7 ms 396 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Execution timed out 2098 ms 63076 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 212 KB Output is correct
2 Correct 7 ms 340 KB Output is correct
3 Correct 6 ms 340 KB Output is correct
4 Correct 7 ms 340 KB Output is correct
5 Correct 9 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 7 ms 400 KB Output is correct
9 Correct 7 ms 340 KB Output is correct
10 Correct 9 ms 340 KB Output is correct
11 Correct 7 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 340 KB Output is correct
15 Correct 8 ms 340 KB Output is correct
16 Correct 9 ms 392 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 9 ms 400 KB Output is correct
20 Correct 9 ms 296 KB Output is correct
21 Correct 7 ms 352 KB Output is correct
22 Correct 8 ms 400 KB Output is correct
23 Correct 70 ms 820 KB Output is correct
24 Correct 71 ms 824 KB Output is correct
25 Correct 68 ms 824 KB Output is correct
26 Correct 77 ms 724 KB Output is correct
27 Correct 81 ms 772 KB Output is correct
28 Correct 71 ms 824 KB Output is correct
29 Correct 72 ms 820 KB Output is correct
30 Correct 61 ms 852 KB Output is correct
31 Correct 64 ms 852 KB Output is correct
32 Correct 65 ms 832 KB Output is correct
33 Correct 61 ms 736 KB Output is correct
34 Correct 12 ms 844 KB Output is correct
35 Correct 68 ms 836 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1946 ms 14268 KB Output is correct
3 Correct 1916 ms 14280 KB Output is correct
4 Correct 1841 ms 14788 KB Output is correct
5 Correct 1700 ms 14756 KB Output is correct
6 Correct 1698 ms 14756 KB Output is correct
7 Correct 1599 ms 14516 KB Output is correct
8 Correct 1545 ms 15004 KB Output is correct
9 Correct 1590 ms 15168 KB Output is correct
10 Correct 1788 ms 14336 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 7 ms 340 KB Output is correct
3 Correct 6 ms 340 KB Output is correct
4 Correct 7 ms 340 KB Output is correct
5 Correct 9 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 7 ms 400 KB Output is correct
9 Correct 7 ms 340 KB Output is correct
10 Correct 9 ms 340 KB Output is correct
11 Correct 7 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 340 KB Output is correct
15 Correct 8 ms 340 KB Output is correct
16 Correct 9 ms 392 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 9 ms 400 KB Output is correct
20 Correct 9 ms 296 KB Output is correct
21 Correct 7 ms 352 KB Output is correct
22 Correct 8 ms 400 KB Output is correct
23 Correct 70 ms 820 KB Output is correct
24 Correct 71 ms 824 KB Output is correct
25 Correct 68 ms 824 KB Output is correct
26 Correct 77 ms 724 KB Output is correct
27 Correct 81 ms 772 KB Output is correct
28 Correct 71 ms 824 KB Output is correct
29 Correct 72 ms 820 KB Output is correct
30 Correct 61 ms 852 KB Output is correct
31 Correct 64 ms 852 KB Output is correct
32 Correct 65 ms 832 KB Output is correct
33 Correct 61 ms 736 KB Output is correct
34 Correct 12 ms 844 KB Output is correct
35 Correct 68 ms 836 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1946 ms 14268 KB Output is correct
38 Correct 1916 ms 14280 KB Output is correct
39 Correct 1841 ms 14788 KB Output is correct
40 Correct 1700 ms 14756 KB Output is correct
41 Correct 1698 ms 14756 KB Output is correct
42 Correct 1599 ms 14516 KB Output is correct
43 Correct 1545 ms 15004 KB Output is correct
44 Correct 1590 ms 15168 KB Output is correct
45 Correct 1788 ms 14336 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 7 ms 340 KB Output is correct
48 Correct 7 ms 388 KB Output is correct
49 Correct 8 ms 396 KB Output is correct
50 Correct 7 ms 396 KB Output is correct
51 Correct 2 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 7 ms 392 KB Output is correct
54 Correct 7 ms 340 KB Output is correct
55 Correct 7 ms 404 KB Output is correct
56 Correct 7 ms 400 KB Output is correct
57 Correct 73 ms 724 KB Output is correct
58 Correct 76 ms 824 KB Output is correct
59 Correct 67 ms 820 KB Output is correct
60 Correct 70 ms 828 KB Output is correct
61 Correct 68 ms 724 KB Output is correct
62 Correct 71 ms 828 KB Output is correct
63 Correct 69 ms 820 KB Output is correct
64 Correct 63 ms 852 KB Output is correct
65 Correct 73 ms 852 KB Output is correct
66 Correct 64 ms 724 KB Output is correct
67 Correct 62 ms 852 KB Output is correct
68 Correct 11 ms 724 KB Output is correct
69 Correct 69 ms 832 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 1884 ms 14272 KB Output is correct
72 Correct 1964 ms 14276 KB Output is correct
73 Correct 1826 ms 14828 KB Output is correct
74 Correct 1728 ms 15008 KB Output is correct
75 Correct 1659 ms 14812 KB Output is correct
76 Correct 1586 ms 14524 KB Output is correct
77 Correct 1595 ms 14776 KB Output is correct
78 Correct 1565 ms 15152 KB Output is correct
79 Correct 1786 ms 14336 KB Output is correct
80 Correct 1949 ms 14268 KB Output is correct
81 Correct 1882 ms 14276 KB Output is correct
82 Correct 1910 ms 14276 KB Output is correct
83 Correct 1845 ms 14404 KB Output is correct
84 Correct 1890 ms 14324 KB Output is correct
85 Correct 1668 ms 14920 KB Output is correct
86 Correct 1669 ms 14616 KB Output is correct
87 Correct 1617 ms 14584 KB Output is correct
88 Correct 1481 ms 15212 KB Output is correct
89 Correct 1657 ms 15244 KB Output is correct
90 Correct 1652 ms 14932 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 7 ms 340 KB Output is correct
3 Correct 6 ms 340 KB Output is correct
4 Correct 7 ms 340 KB Output is correct
5 Correct 9 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 7 ms 400 KB Output is correct
9 Correct 7 ms 340 KB Output is correct
10 Correct 9 ms 340 KB Output is correct
11 Correct 7 ms 396 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Execution timed out 2098 ms 63076 KB Time limit exceeded
14 Halted 0 ms 0 KB -