oj.uz

Submission #591131

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

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;
	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 1 ms 212 KB Output is correct
2 Correct 6 ms 340 KB Output is correct
3 Correct 6 ms 392 KB Output is correct
4 Correct 9 ms 468 KB Output is correct
5 Correct 7 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 8 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 8 ms 400 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 516 ms 63040 KB Output is correct
3 Correct 514 ms 64812 KB Output is correct
4 Correct 478 ms 65048 KB Output is correct
5 Correct 490 ms 64540 KB Output is correct
6 Correct 413 ms 65752 KB Output is correct
7 Correct 405 ms 66888 KB Output is correct
8 Correct 444 ms 65504 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 6 ms 340 KB Output is correct
3 Correct 6 ms 392 KB Output is correct
4 Correct 9 ms 468 KB Output is correct
5 Correct 7 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 8 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 8 ms 400 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 6 ms 340 KB Output is correct
14 Correct 8 ms 388 KB Output is correct
15 Correct 8 ms 392 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 8 ms 340 KB Output is correct
20 Correct 7 ms 400 KB Output is correct
21 Correct 9 ms 400 KB Output is correct
22 Correct 6 ms 340 KB Output is correct
23 Correct 84 ms 820 KB Output is correct
24 Correct 71 ms 724 KB Output is correct
25 Correct 68 ms 820 KB Output is correct
26 Correct 84 ms 820 KB Output is correct
27 Correct 70 ms 724 KB Output is correct
28 Correct 78 ms 820 KB Output is correct
29 Correct 87 ms 828 KB Output is correct
30 Correct 63 ms 852 KB Output is correct
31 Correct 68 ms 852 KB Output is correct
32 Correct 63 ms 792 KB Output is correct
33 Correct 63 ms 844 KB Output is correct
34 Correct 12 ms 848 KB Output is correct
35 Correct 75 ms 832 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1909 ms 14276 KB Output is correct
3 Correct 1965 ms 14272 KB Output is correct
4 Correct 1781 ms 14712 KB Output is correct
5 Correct 1728 ms 14792 KB Output is correct
6 Correct 1732 ms 14832 KB Output is correct
7 Correct 1551 ms 14572 KB Output is correct
8 Correct 1558 ms 14824 KB Output is correct
9 Correct 1570 ms 15272 KB Output is correct
10 Correct 1747 ms 14332 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 6 ms 340 KB Output is correct
3 Correct 6 ms 392 KB Output is correct
4 Correct 9 ms 468 KB Output is correct
5 Correct 7 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 8 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 8 ms 400 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 6 ms 340 KB Output is correct
14 Correct 8 ms 388 KB Output is correct
15 Correct 8 ms 392 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 8 ms 340 KB Output is correct
20 Correct 7 ms 400 KB Output is correct
21 Correct 9 ms 400 KB Output is correct
22 Correct 6 ms 340 KB Output is correct
23 Correct 84 ms 820 KB Output is correct
24 Correct 71 ms 724 KB Output is correct
25 Correct 68 ms 820 KB Output is correct
26 Correct 84 ms 820 KB Output is correct
27 Correct 70 ms 724 KB Output is correct
28 Correct 78 ms 820 KB Output is correct
29 Correct 87 ms 828 KB Output is correct
30 Correct 63 ms 852 KB Output is correct
31 Correct 68 ms 852 KB Output is correct
32 Correct 63 ms 792 KB Output is correct
33 Correct 63 ms 844 KB Output is correct
34 Correct 12 ms 848 KB Output is correct
35 Correct 75 ms 832 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1909 ms 14276 KB Output is correct
38 Correct 1965 ms 14272 KB Output is correct
39 Correct 1781 ms 14712 KB Output is correct
40 Correct 1728 ms 14792 KB Output is correct
41 Correct 1732 ms 14832 KB Output is correct
42 Correct 1551 ms 14572 KB Output is correct
43 Correct 1558 ms 14824 KB Output is correct
44 Correct 1570 ms 15272 KB Output is correct
45 Correct 1747 ms 14332 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 7 ms 340 KB Output is correct
48 Correct 6 ms 340 KB Output is correct
49 Correct 8 ms 396 KB Output is correct
50 Correct 7 ms 340 KB Output is correct
51 Correct 3 ms 340 KB Output is correct
52 Correct 2 ms 340 KB Output is correct
53 Correct 8 ms 340 KB Output is correct
54 Correct 7 ms 396 KB Output is correct
55 Correct 7 ms 340 KB Output is correct
56 Correct 8 ms 400 KB Output is correct
57 Correct 69 ms 832 KB Output is correct
58 Correct 69 ms 828 KB Output is correct
59 Correct 69 ms 820 KB Output is correct
60 Correct 69 ms 724 KB Output is correct
61 Correct 72 ms 724 KB Output is correct
62 Correct 71 ms 828 KB Output is correct
63 Correct 71 ms 820 KB Output is correct
64 Correct 61 ms 852 KB Output is correct
65 Correct 60 ms 852 KB Output is correct
66 Correct 61 ms 724 KB Output is correct
67 Correct 60 ms 832 KB Output is correct
68 Correct 12 ms 848 KB Output is correct
69 Correct 69 ms 832 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 1883 ms 14272 KB Output is correct
72 Correct 1949 ms 14272 KB Output is correct
73 Correct 1834 ms 14964 KB Output is correct
74 Correct 1710 ms 15060 KB Output is correct
75 Correct 1738 ms 15000 KB Output is correct
76 Correct 1554 ms 14592 KB Output is correct
77 Correct 1548 ms 14788 KB Output is correct
78 Correct 1549 ms 15076 KB Output is correct
79 Correct 1781 ms 14412 KB Output is correct
80 Correct 1967 ms 14284 KB Output is correct
81 Correct 1906 ms 14272 KB Output is correct
82 Correct 1924 ms 14268 KB Output is correct
83 Correct 1880 ms 14400 KB Output is correct
84 Correct 1882 ms 14324 KB Output is correct
85 Correct 1674 ms 14720 KB Output is correct
86 Correct 1676 ms 14576 KB Output is correct
87 Correct 1600 ms 14772 KB Output is correct
88 Correct 1500 ms 15072 KB Output is correct
89 Correct 1608 ms 15412 KB Output is correct
90 Correct 1632 ms 14812 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 6 ms 340 KB Output is correct
3 Correct 6 ms 392 KB Output is correct
4 Correct 9 ms 468 KB Output is correct
5 Correct 7 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 8 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 8 ms 400 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 516 ms 63040 KB Output is correct
14 Correct 514 ms 64812 KB Output is correct
15 Correct 478 ms 65048 KB Output is correct
16 Correct 490 ms 64540 KB Output is correct
17 Correct 413 ms 65752 KB Output is correct
18 Correct 405 ms 66888 KB Output is correct
19 Correct 444 ms 65504 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 6 ms 340 KB Output is correct
22 Correct 8 ms 388 KB Output is correct
23 Correct 8 ms 392 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 8 ms 340 KB Output is correct
28 Correct 7 ms 400 KB Output is correct
29 Correct 9 ms 400 KB Output is correct
30 Correct 6 ms 340 KB Output is correct
31 Correct 84 ms 820 KB Output is correct
32 Correct 71 ms 724 KB Output is correct
33 Correct 68 ms 820 KB Output is correct
34 Correct 84 ms 820 KB Output is correct
35 Correct 70 ms 724 KB Output is correct
36 Correct 78 ms 820 KB Output is correct
37 Correct 87 ms 828 KB Output is correct
38 Correct 63 ms 852 KB Output is correct
39 Correct 68 ms 852 KB Output is correct
40 Correct 63 ms 792 KB Output is correct
41 Correct 63 ms 844 KB Output is correct
42 Correct 12 ms 848 KB Output is correct
43 Correct 75 ms 832 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 1909 ms 14276 KB Output is correct
46 Correct 1965 ms 14272 KB Output is correct
47 Correct 1781 ms 14712 KB Output is correct
48 Correct 1728 ms 14792 KB Output is correct
49 Correct 1732 ms 14832 KB Output is correct
50 Correct 1551 ms 14572 KB Output is correct
51 Correct 1558 ms 14824 KB Output is correct
52 Correct 1570 ms 15272 KB Output is correct
53 Correct 1747 ms 14332 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 7 ms 340 KB Output is correct
56 Correct 6 ms 340 KB Output is correct
57 Correct 8 ms 396 KB Output is correct
58 Correct 7 ms 340 KB Output is correct
59 Correct 3 ms 340 KB Output is correct
60 Correct 2 ms 340 KB Output is correct
61 Correct 8 ms 340 KB Output is correct
62 Correct 7 ms 396 KB Output is correct
63 Correct 7 ms 340 KB Output is correct
64 Correct 8 ms 400 KB Output is correct
65 Correct 69 ms 832 KB Output is correct
66 Correct 69 ms 828 KB Output is correct
67 Correct 69 ms 820 KB Output is correct
68 Correct 69 ms 724 KB Output is correct
69 Correct 72 ms 724 KB Output is correct
70 Correct 71 ms 828 KB Output is correct
71 Correct 71 ms 820 KB Output is correct
72 Correct 61 ms 852 KB Output is correct
73 Correct 60 ms 852 KB Output is correct
74 Correct 61 ms 724 KB Output is correct
75 Correct 60 ms 832 KB Output is correct
76 Correct 12 ms 848 KB Output is correct
77 Correct 69 ms 832 KB Output is correct
78 Correct 0 ms 212 KB Output is correct
79 Correct 1883 ms 14272 KB Output is correct
80 Correct 1949 ms 14272 KB Output is correct
81 Correct 1834 ms 14964 KB Output is correct
82 Correct 1710 ms 15060 KB Output is correct
83 Correct 1738 ms 15000 KB Output is correct
84 Correct 1554 ms 14592 KB Output is correct
85 Correct 1548 ms 14788 KB Output is correct
86 Correct 1549 ms 15076 KB Output is correct
87 Correct 1781 ms 14412 KB Output is correct
88 Correct 1967 ms 14284 KB Output is correct
89 Correct 1906 ms 14272 KB Output is correct
90 Correct 1924 ms 14268 KB Output is correct
91 Correct 1880 ms 14400 KB Output is correct
92 Correct 1882 ms 14324 KB Output is correct
93 Correct 1674 ms 14720 KB Output is correct
94 Correct 1676 ms 14576 KB Output is correct
95 Correct 1600 ms 14772 KB Output is correct
96 Correct 1500 ms 15072 KB Output is correct
97 Correct 1608 ms 15412 KB Output is correct
98 Correct 1632 ms 14812 KB Output is correct
99 Correct 1 ms 212 KB Output is correct
100 Correct 6 ms 328 KB Output is correct
101 Correct 7 ms 396 KB Output is correct
102 Correct 10 ms 280 KB Output is correct
103 Correct 7 ms 340 KB Output is correct
104 Correct 3 ms 328 KB Output is correct
105 Correct 3 ms 368 KB Output is correct
106 Correct 7 ms 328 KB Output is correct
107 Correct 8 ms 408 KB Output is correct
108 Correct 9 ms 404 KB Output is correct
109 Correct 9 ms 340 KB Output is correct
110 Correct 1 ms 212 KB Output is correct
111 Correct 490 ms 64868 KB Output is correct
112 Correct 503 ms 64892 KB Output is correct
113 Correct 517 ms 65088 KB Output is correct
114 Correct 460 ms 64464 KB Output is correct
115 Correct 425 ms 65632 KB Output is correct
116 Correct 405 ms 66868 KB Output is correct
117 Correct 463 ms 65500 KB Output is correct
118 Correct 69 ms 876 KB Output is correct
119 Correct 70 ms 864 KB Output is correct
120 Correct 68 ms 852 KB Output is correct
121 Correct 71 ms 864 KB Output is correct
122 Correct 72 ms 860 KB Output is correct
123 Correct 73 ms 852 KB Output is correct
124 Correct 75 ms 852 KB Output is correct
125 Correct 61 ms 864 KB Output is correct
126 Correct 66 ms 864 KB Output is correct
127 Correct 63 ms 852 KB Output is correct
128 Correct 64 ms 852 KB Output is correct
129 Correct 13 ms 864 KB Output is correct
130 Correct 70 ms 872 KB Output is correct
131 Correct 0 ms 212 KB Output is correct
132 Correct 1895 ms 15000 KB Output is correct
133 Correct 1948 ms 15008 KB Output is correct
134 Correct 1794 ms 15248 KB Output is correct
135 Correct 1675 ms 15588 KB Output is correct
136 Correct 1664 ms 15712 KB Output is correct
137 Correct 1538 ms 15120 KB Output is correct
138 Correct 1564 ms 15300 KB Output is correct
139 Correct 1540 ms 15928 KB Output is correct
140 Correct 1835 ms 14852 KB Output is correct
141 Execution timed out 2017 ms 15012 KB Time limit exceeded
142 Halted 0 ms 0 KB -