oj.uz

Submission #591133

# Submission time Handle Problem Language Result Execution time Memory
591133 2022-07-06T22:11:18 Z GusterGoose27 The short shank; Redemption (BOI21_prison) C++11
80 / 100
 2000 ms 65144 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;

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-1);
	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;
}

void spec() {
	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(n-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-1);
	cout << round(overall.first) << "\n";
	return;
	// 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;
	if (n > 75000) iters = 20;
	for (int i = 0; i < n; i++) cin >> vals[i];
	ld mn = 0;
	ld mx = ((ld)n)/d+1;
	s = STree(n);
	if (d == 1) {
		spec();
		return 0;
	}
	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++) {
      |                     ~~^~~~~~~~~~~~~~~~~~
prison.cpp: In function 'void spec()':
prison.cpp:157:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  157 |   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 6 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 7 ms 340 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 6 ms 340 KB Output is correct
9 Correct 7 ms 340 KB Output is correct
10 Correct 7 ms 340 KB Output is correct
11 Correct 7 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 513 ms 63060 KB Output is correct
3 Correct 547 ms 63092 KB Output is correct
4 Correct 479 ms 63340 KB Output is correct
5 Correct 478 ms 63180 KB Output is correct
6 Correct 414 ms 63972 KB Output is correct
7 Correct 446 ms 65144 KB Output is correct
8 Correct 453 ms 63928 KB Output is correct

Subtask #3
20.0 / 20.0

# 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 6 ms 340 KB Output is correct
4 Correct 7 ms 340 KB Output is correct
5 Correct 7 ms 340 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 6 ms 340 KB Output is correct
9 Correct 7 ms 340 KB Output is correct
10 Correct 7 ms 340 KB Output is correct
11 Correct 7 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 7 ms 340 KB Output is correct
15 Correct 8 ms 340 KB Output is correct
16 Correct 7 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 6 ms 340 KB Output is correct
20 Correct 7 ms 340 KB Output is correct
21 Correct 7 ms 404 KB Output is correct
22 Correct 6 ms 340 KB Output is correct
23 Correct 68 ms 820 KB Output is correct
24 Correct 73 ms 824 KB Output is correct
25 Correct 85 ms 824 KB Output is correct
26 Correct 73 ms 724 KB Output is correct
27 Correct 67 ms 724 KB Output is correct
28 Correct 70 ms 824 KB Output is correct
29 Correct 68 ms 724 KB Output is correct
30 Correct 60 ms 860 KB Output is correct
31 Correct 62 ms 852 KB Output is correct
32 Correct 62 ms 724 KB Output is correct
33 Correct 77 ms 724 KB Output is correct
34 Correct 12 ms 724 KB Output is correct
35 Correct 68 ms 832 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 1964 ms 14284 KB Output is correct
3 Correct 1946 ms 14272 KB Output is correct
4 Correct 1871 ms 14736 KB Output is correct
5 Correct 1680 ms 14872 KB Output is correct
6 Correct 1706 ms 14868 KB Output is correct
7 Correct 1556 ms 14464 KB Output is correct
8 Correct 1533 ms 14664 KB Output is correct
9 Correct 1570 ms 15144 KB Output is correct
10 Correct 1717 ms 14332 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 6 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 7 ms 340 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 6 ms 340 KB Output is correct
9 Correct 7 ms 340 KB Output is correct
10 Correct 7 ms 340 KB Output is correct
11 Correct 7 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 7 ms 340 KB Output is correct
15 Correct 8 ms 340 KB Output is correct
16 Correct 7 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 6 ms 340 KB Output is correct
20 Correct 7 ms 340 KB Output is correct
21 Correct 7 ms 404 KB Output is correct
22 Correct 6 ms 340 KB Output is correct
23 Correct 68 ms 820 KB Output is correct
24 Correct 73 ms 824 KB Output is correct
25 Correct 85 ms 824 KB Output is correct
26 Correct 73 ms 724 KB Output is correct
27 Correct 67 ms 724 KB Output is correct
28 Correct 70 ms 824 KB Output is correct
29 Correct 68 ms 724 KB Output is correct
30 Correct 60 ms 860 KB Output is correct
31 Correct 62 ms 852 KB Output is correct
32 Correct 62 ms 724 KB Output is correct
33 Correct 77 ms 724 KB Output is correct
34 Correct 12 ms 724 KB Output is correct
35 Correct 68 ms 832 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1964 ms 14284 KB Output is correct
38 Correct 1946 ms 14272 KB Output is correct
39 Correct 1871 ms 14736 KB Output is correct
40 Correct 1680 ms 14872 KB Output is correct
41 Correct 1706 ms 14868 KB Output is correct
42 Correct 1556 ms 14464 KB Output is correct
43 Correct 1533 ms 14664 KB Output is correct
44 Correct 1570 ms 15144 KB Output is correct
45 Correct 1717 ms 14332 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 6 ms 388 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 400 KB Output is correct
51 Correct 3 ms 340 KB Output is correct
52 Correct 2 ms 340 KB Output is correct
53 Correct 7 ms 340 KB Output is correct
54 Correct 8 ms 340 KB Output is correct
55 Correct 7 ms 340 KB Output is correct
56 Correct 6 ms 340 KB Output is correct
57 Correct 73 ms 824 KB Output is correct
58 Correct 77 ms 828 KB Output is correct
59 Correct 68 ms 724 KB Output is correct
60 Correct 69 ms 820 KB Output is correct
61 Correct 66 ms 824 KB Output is correct
62 Correct 74 ms 824 KB Output is correct
63 Correct 68 ms 824 KB Output is correct
64 Correct 59 ms 836 KB Output is correct
65 Correct 61 ms 852 KB Output is correct
66 Correct 60 ms 852 KB Output is correct
67 Correct 61 ms 724 KB Output is correct
68 Correct 11 ms 724 KB Output is correct
69 Correct 69 ms 844 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 1850 ms 14292 KB Output is correct
72 Correct 1908 ms 14272 KB Output is correct
73 Correct 1786 ms 14744 KB Output is correct
74 Correct 1705 ms 14988 KB Output is correct
75 Correct 1694 ms 14860 KB Output is correct
76 Correct 1562 ms 14628 KB Output is correct
77 Correct 1539 ms 14808 KB Output is correct
78 Correct 1555 ms 15140 KB Output is correct
79 Correct 1767 ms 14336 KB Output is correct
80 Correct 1950 ms 14276 KB Output is correct
81 Correct 1956 ms 14272 KB Output is correct
82 Correct 1930 ms 14268 KB Output is correct
83 Correct 1874 ms 14396 KB Output is correct
84 Correct 1923 ms 14320 KB Output is correct
85 Correct 1700 ms 14840 KB Output is correct
86 Correct 1734 ms 14516 KB Output is correct
87 Correct 1552 ms 14708 KB Output is correct
88 Correct 1481 ms 15096 KB Output is correct
89 Correct 1553 ms 15060 KB Output is correct
90 Correct 1660 ms 14868 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 6 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 7 ms 340 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 6 ms 340 KB Output is correct
9 Correct 7 ms 340 KB Output is correct
10 Correct 7 ms 340 KB Output is correct
11 Correct 7 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 513 ms 63060 KB Output is correct
14 Correct 547 ms 63092 KB Output is correct
15 Correct 479 ms 63340 KB Output is correct
16 Correct 478 ms 63180 KB Output is correct
17 Correct 414 ms 63972 KB Output is correct
18 Correct 446 ms 65144 KB Output is correct
19 Correct 453 ms 63928 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 6 ms 340 KB Output is correct
22 Correct 7 ms 340 KB Output is correct
23 Correct 8 ms 340 KB Output is correct
24 Correct 7 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 6 ms 340 KB Output is correct
28 Correct 7 ms 340 KB Output is correct
29 Correct 7 ms 404 KB Output is correct
30 Correct 6 ms 340 KB Output is correct
31 Correct 68 ms 820 KB Output is correct
32 Correct 73 ms 824 KB Output is correct
33 Correct 85 ms 824 KB Output is correct
34 Correct 73 ms 724 KB Output is correct
35 Correct 67 ms 724 KB Output is correct
36 Correct 70 ms 824 KB Output is correct
37 Correct 68 ms 724 KB Output is correct
38 Correct 60 ms 860 KB Output is correct
39 Correct 62 ms 852 KB Output is correct
40 Correct 62 ms 724 KB Output is correct
41 Correct 77 ms 724 KB Output is correct
42 Correct 12 ms 724 KB Output is correct
43 Correct 68 ms 832 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 1964 ms 14284 KB Output is correct
46 Correct 1946 ms 14272 KB Output is correct
47 Correct 1871 ms 14736 KB Output is correct
48 Correct 1680 ms 14872 KB Output is correct
49 Correct 1706 ms 14868 KB Output is correct
50 Correct 1556 ms 14464 KB Output is correct
51 Correct 1533 ms 14664 KB Output is correct
52 Correct 1570 ms 15144 KB Output is correct
53 Correct 1717 ms 14332 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 6 ms 388 KB Output is correct
56 Correct 6 ms 340 KB Output is correct
57 Correct 7 ms 340 KB Output is correct
58 Correct 8 ms 400 KB Output is correct
59 Correct 3 ms 340 KB Output is correct
60 Correct 2 ms 340 KB Output is correct
61 Correct 7 ms 340 KB Output is correct
62 Correct 8 ms 340 KB Output is correct
63 Correct 7 ms 340 KB Output is correct
64 Correct 6 ms 340 KB Output is correct
65 Correct 73 ms 824 KB Output is correct
66 Correct 77 ms 828 KB Output is correct
67 Correct 68 ms 724 KB Output is correct
68 Correct 69 ms 820 KB Output is correct
69 Correct 66 ms 824 KB Output is correct
70 Correct 74 ms 824 KB Output is correct
71 Correct 68 ms 824 KB Output is correct
72 Correct 59 ms 836 KB Output is correct
73 Correct 61 ms 852 KB Output is correct
74 Correct 60 ms 852 KB Output is correct
75 Correct 61 ms 724 KB Output is correct
76 Correct 11 ms 724 KB Output is correct
77 Correct 69 ms 844 KB Output is correct
78 Correct 0 ms 212 KB Output is correct
79 Correct 1850 ms 14292 KB Output is correct
80 Correct 1908 ms 14272 KB Output is correct
81 Correct 1786 ms 14744 KB Output is correct
82 Correct 1705 ms 14988 KB Output is correct
83 Correct 1694 ms 14860 KB Output is correct
84 Correct 1562 ms 14628 KB Output is correct
85 Correct 1539 ms 14808 KB Output is correct
86 Correct 1555 ms 15140 KB Output is correct
87 Correct 1767 ms 14336 KB Output is correct
88 Correct 1950 ms 14276 KB Output is correct
89 Correct 1956 ms 14272 KB Output is correct
90 Correct 1930 ms 14268 KB Output is correct
91 Correct 1874 ms 14396 KB Output is correct
92 Correct 1923 ms 14320 KB Output is correct
93 Correct 1700 ms 14840 KB Output is correct
94 Correct 1734 ms 14516 KB Output is correct
95 Correct 1552 ms 14708 KB Output is correct
96 Correct 1481 ms 15096 KB Output is correct
97 Correct 1553 ms 15060 KB Output is correct
98 Correct 1660 ms 14868 KB Output is correct
99 Correct 0 ms 212 KB Output is correct
100 Correct 6 ms 340 KB Output is correct
101 Correct 6 ms 340 KB Output is correct
102 Correct 7 ms 400 KB Output is correct
103 Correct 9 ms 396 KB Output is correct
104 Correct 2 ms 340 KB Output is correct
105 Correct 1 ms 340 KB Output is correct
106 Correct 6 ms 340 KB Output is correct
107 Correct 8 ms 340 KB Output is correct
108 Correct 6 ms 396 KB Output is correct
109 Correct 6 ms 340 KB Output is correct
110 Correct 0 ms 340 KB Output is correct
111 Correct 511 ms 63032 KB Output is correct
112 Correct 492 ms 63048 KB Output is correct
113 Correct 532 ms 63288 KB Output is correct
114 Correct 455 ms 63244 KB Output is correct
115 Correct 435 ms 63924 KB Output is correct
116 Correct 431 ms 65132 KB Output is correct
117 Correct 447 ms 63836 KB Output is correct
118 Correct 75 ms 724 KB Output is correct
119 Correct 80 ms 724 KB Output is correct
120 Correct 68 ms 820 KB Output is correct
121 Correct 68 ms 824 KB Output is correct
122 Correct 68 ms 824 KB Output is correct
123 Correct 68 ms 828 KB Output is correct
124 Correct 68 ms 824 KB Output is correct
125 Correct 65 ms 852 KB Output is correct
126 Correct 64 ms 852 KB Output is correct
127 Correct 68 ms 724 KB Output is correct
128 Correct 63 ms 844 KB Output is correct
129 Correct 12 ms 724 KB Output is correct
130 Correct 67 ms 828 KB Output is correct
131 Correct 0 ms 212 KB Output is correct
132 Correct 1931 ms 14296 KB Output is correct
133 Execution timed out 2005 ms 14276 KB Time limit exceeded
134 Halted 0 ms 0 KB -