oj.uz

Submission #417909

# Submission time Handle Problem Language Result Execution time Memory
417909 2021-06-04T13:39:54 Z Kevin_Zhang_TW The short shank; Redemption (BOI21_prison) C++17
80 / 100
 2000 ms 66844 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif

const int MAX_N = 2e6 + 10, inf = 1e9;

int dp[MAX_N], cnt[MAX_N];

int n, D, T;

//           i can activate [i, nxt[i])
int s[MAX_N], nxt[MAX_N];

pair<int,int> solve_dp(int cost) {

	vector<int> ok(n + 10), cur_nxt(n + 10);

	int diff_sum = 0;

	// index,    a[i] - a[i-1],  cnt[i]
	map<int, pair<int,int>> mono;
	

	auto pops = [&](auto it) {
		while (it != begin(mono) && it != end(mono)) {
			auto pit = prev(it);
			auto [_, cl] = pit->second;
			auto [d, cr] = it->second;

			if (d == 0 && cr >= cl) {
				it = mono.erase(it);
				continue;
			}
			if (d > 0) {
				if (next(it) == end(mono)) {
					diff_sum -= d;
				}
				else {
					next(it)->second.first += d;
				}
				it = mono.erase(it);
			}
			else break;
		}
	};

	// for all value >= index will be add 1
	auto mono_add = [&](int ind) {
		auto it = mono.lower_bound(ind);
		if (it == end(mono)) return;
		++it->second.first;
		++diff_sum;
		pops(it);
	};
	auto mono_push_front = [&](int ind, int dp, int cnt) {
		if (mono.empty()) {
			mono[ind] = {dp, cnt};
			diff_sum = dp;
			return;
		}
		auto &[d, c] = mono.begin()->second;
		d -= dp;
		mono[ind] = {dp, cnt};
		pops(next(begin(mono)));
	};

	int cnt1 = 0;
	for (int i = n;i >= 1;--i) {
		cur_nxt[i] = nxt[i];
		for (int j = i;j < nxt[i];++j) {
			if (ok[j]) {
				assert(cur_nxt[j] > j);
				chmax(cur_nxt[i], cur_nxt[j]);
				j = cur_nxt[j] - 1;
			}
			else {
				ok[j] = true, ++cnt1;

				mono_add(j + 1);
			}
		}

		dp[i] = cnt1 + cost;

		cnt[i] = 1;

		if (mono.size()) {
			auto [_, c] = prev(end(mono))->second;
			if (chmin(dp[i], cost + diff_sum))
				cnt[i] = c + 1;
			if (dp[i] == cost + diff_sum)
				cnt[i] = c + 1;
		}

		mono_push_front(i, dp[i], cnt[i]);

//		int sum = 0;
//		for (int k = i+1;k <= n;++k) { 
//			sum += ok[k-1];
//
//			if (chmin(dp[i], cost + sum + dp[k]))
//				cnt[i] = cnt[k]+1;
//
//			if (dp[i] == cost + sum + dp[k])
//				chmin(cnt[i], cnt[k]+1);
//		}
//
	}

	return make_pair(cnt[1], dp[1]);
}

int32_t main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	cin >> n >> D >> T; ++D;
	// Just to be faster
	//assert(n < MAX_N);

	for (int i = 1;i <= n;++i) {
		cin >> s[i];
		nxt[i] = min(n+1, max(i, i + T - s[i] + 1));
	}

	int l = 0, r = n, mid;
	while (l < r) {
		mid = l + r >> 1;
		auto [c, w] = solve_dp(mid);
		if (c > D)
			l = mid+1;
		else
			r = mid;
	}

	auto [c, w] = solve_dp(l);

	cout << w - l * D << '\n';
}

Compilation message

prison.cpp: In function 'int32_t main()':
prison.cpp:139:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  139 |   mid = l + r >> 1;
      |         ~~^~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 332 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1203 ms 12140 KB Output is correct
3 Correct 1145 ms 16916 KB Output is correct
4 Correct 1399 ms 15932 KB Output is correct
5 Correct 1267 ms 13948 KB Output is correct
6 Correct 961 ms 16028 KB Output is correct
7 Correct 785 ms 16040 KB Output is correct
8 Correct 1089 ms 16000 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 324 KB Output is correct
23 Correct 6 ms 460 KB Output is correct
24 Correct 6 ms 460 KB Output is correct
25 Correct 6 ms 460 KB Output is correct
26 Correct 7 ms 460 KB Output is correct
27 Correct 6 ms 460 KB Output is correct
28 Correct 8 ms 464 KB Output is correct
29 Correct 9 ms 460 KB Output is correct
30 Correct 8 ms 460 KB Output is correct
31 Correct 6 ms 452 KB Output is correct
32 Correct 5 ms 332 KB Output is correct
33 Correct 5 ms 460 KB Output is correct
34 Correct 6 ms 332 KB Output is correct
35 Correct 7 ms 460 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 149 ms 2160 KB Output is correct
3 Correct 167 ms 2164 KB Output is correct
4 Correct 138 ms 2724 KB Output is correct
5 Correct 111 ms 2328 KB Output is correct
6 Correct 116 ms 2200 KB Output is correct
7 Correct 154 ms 2176 KB Output is correct
8 Correct 118 ms 2160 KB Output is correct
9 Correct 103 ms 2172 KB Output is correct
10 Correct 109 ms 2180 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 324 KB Output is correct
23 Correct 6 ms 460 KB Output is correct
24 Correct 6 ms 460 KB Output is correct
25 Correct 6 ms 460 KB Output is correct
26 Correct 7 ms 460 KB Output is correct
27 Correct 6 ms 460 KB Output is correct
28 Correct 8 ms 464 KB Output is correct
29 Correct 9 ms 460 KB Output is correct
30 Correct 8 ms 460 KB Output is correct
31 Correct 6 ms 452 KB Output is correct
32 Correct 5 ms 332 KB Output is correct
33 Correct 5 ms 460 KB Output is correct
34 Correct 6 ms 332 KB Output is correct
35 Correct 7 ms 460 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 149 ms 2160 KB Output is correct
38 Correct 167 ms 2164 KB Output is correct
39 Correct 138 ms 2724 KB Output is correct
40 Correct 111 ms 2328 KB Output is correct
41 Correct 116 ms 2200 KB Output is correct
42 Correct 154 ms 2176 KB Output is correct
43 Correct 118 ms 2160 KB Output is correct
44 Correct 103 ms 2172 KB Output is correct
45 Correct 109 ms 2180 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 2 ms 332 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 324 KB Output is correct
50 Correct 2 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 1 ms 332 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 1 ms 328 KB Output is correct
57 Correct 6 ms 460 KB Output is correct
58 Correct 8 ms 364 KB Output is correct
59 Correct 6 ms 460 KB Output is correct
60 Correct 6 ms 464 KB Output is correct
61 Correct 8 ms 460 KB Output is correct
62 Correct 7 ms 460 KB Output is correct
63 Correct 8 ms 448 KB Output is correct
64 Correct 7 ms 460 KB Output is correct
65 Correct 8 ms 460 KB Output is correct
66 Correct 6 ms 464 KB Output is correct
67 Correct 5 ms 460 KB Output is correct
68 Correct 6 ms 448 KB Output is correct
69 Correct 7 ms 460 KB Output is correct
70 Correct 1 ms 332 KB Output is correct
71 Correct 144 ms 2160 KB Output is correct
72 Correct 155 ms 2172 KB Output is correct
73 Correct 138 ms 2620 KB Output is correct
74 Correct 109 ms 2204 KB Output is correct
75 Correct 122 ms 2228 KB Output is correct
76 Correct 119 ms 2172 KB Output is correct
77 Correct 123 ms 2180 KB Output is correct
78 Correct 115 ms 2184 KB Output is correct
79 Correct 109 ms 2184 KB Output is correct
80 Correct 153 ms 2164 KB Output is correct
81 Correct 171 ms 2164 KB Output is correct
82 Correct 157 ms 2172 KB Output is correct
83 Correct 149 ms 2388 KB Output is correct
84 Correct 137 ms 2176 KB Output is correct
85 Correct 121 ms 2172 KB Output is correct
86 Correct 129 ms 2252 KB Output is correct
87 Correct 123 ms 2164 KB Output is correct
88 Correct 122 ms 2168 KB Output is correct
89 Correct 116 ms 2264 KB Output is correct
90 Correct 110 ms 2232 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1203 ms 12140 KB Output is correct
14 Correct 1145 ms 16916 KB Output is correct
15 Correct 1399 ms 15932 KB Output is correct
16 Correct 1267 ms 13948 KB Output is correct
17 Correct 961 ms 16028 KB Output is correct
18 Correct 785 ms 16040 KB Output is correct
19 Correct 1089 ms 16000 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 328 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 324 KB Output is correct
31 Correct 6 ms 460 KB Output is correct
32 Correct 6 ms 460 KB Output is correct
33 Correct 6 ms 460 KB Output is correct
34 Correct 7 ms 460 KB Output is correct
35 Correct 6 ms 460 KB Output is correct
36 Correct 8 ms 464 KB Output is correct
37 Correct 9 ms 460 KB Output is correct
38 Correct 8 ms 460 KB Output is correct
39 Correct 6 ms 452 KB Output is correct
40 Correct 5 ms 332 KB Output is correct
41 Correct 5 ms 460 KB Output is correct
42 Correct 6 ms 332 KB Output is correct
43 Correct 7 ms 460 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 149 ms 2160 KB Output is correct
46 Correct 167 ms 2164 KB Output is correct
47 Correct 138 ms 2724 KB Output is correct
48 Correct 111 ms 2328 KB Output is correct
49 Correct 116 ms 2200 KB Output is correct
50 Correct 154 ms 2176 KB Output is correct
51 Correct 118 ms 2160 KB Output is correct
52 Correct 103 ms 2172 KB Output is correct
53 Correct 109 ms 2180 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 2 ms 332 KB Output is correct
56 Correct 1 ms 332 KB Output is correct
57 Correct 1 ms 324 KB Output is correct
58 Correct 2 ms 332 KB Output is correct
59 Correct 1 ms 332 KB Output is correct
60 Correct 1 ms 332 KB Output is correct
61 Correct 1 ms 332 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 1 ms 332 KB Output is correct
64 Correct 1 ms 328 KB Output is correct
65 Correct 6 ms 460 KB Output is correct
66 Correct 8 ms 364 KB Output is correct
67 Correct 6 ms 460 KB Output is correct
68 Correct 6 ms 464 KB Output is correct
69 Correct 8 ms 460 KB Output is correct
70 Correct 7 ms 460 KB Output is correct
71 Correct 8 ms 448 KB Output is correct
72 Correct 7 ms 460 KB Output is correct
73 Correct 8 ms 460 KB Output is correct
74 Correct 6 ms 464 KB Output is correct
75 Correct 5 ms 460 KB Output is correct
76 Correct 6 ms 448 KB Output is correct
77 Correct 7 ms 460 KB Output is correct
78 Correct 1 ms 332 KB Output is correct
79 Correct 144 ms 2160 KB Output is correct
80 Correct 155 ms 2172 KB Output is correct
81 Correct 138 ms 2620 KB Output is correct
82 Correct 109 ms 2204 KB Output is correct
83 Correct 122 ms 2228 KB Output is correct
84 Correct 119 ms 2172 KB Output is correct
85 Correct 123 ms 2180 KB Output is correct
86 Correct 115 ms 2184 KB Output is correct
87 Correct 109 ms 2184 KB Output is correct
88 Correct 153 ms 2164 KB Output is correct
89 Correct 171 ms 2164 KB Output is correct
90 Correct 157 ms 2172 KB Output is correct
91 Correct 149 ms 2388 KB Output is correct
92 Correct 137 ms 2176 KB Output is correct
93 Correct 121 ms 2172 KB Output is correct
94 Correct 129 ms 2252 KB Output is correct
95 Correct 123 ms 2164 KB Output is correct
96 Correct 122 ms 2168 KB Output is correct
97 Correct 116 ms 2264 KB Output is correct
98 Correct 110 ms 2232 KB Output is correct
99 Correct 1 ms 332 KB Output is correct
100 Correct 1 ms 332 KB Output is correct
101 Correct 1 ms 332 KB Output is correct
102 Correct 1 ms 332 KB Output is correct
103 Correct 1 ms 332 KB Output is correct
104 Correct 1 ms 332 KB Output is correct
105 Correct 1 ms 332 KB Output is correct
106 Correct 1 ms 332 KB Output is correct
107 Correct 1 ms 320 KB Output is correct
108 Correct 1 ms 332 KB Output is correct
109 Correct 1 ms 332 KB Output is correct
110 Correct 1 ms 332 KB Output is correct
111 Correct 1227 ms 16972 KB Output is correct
112 Correct 1078 ms 16912 KB Output is correct
113 Correct 1408 ms 16036 KB Output is correct
114 Correct 1252 ms 13936 KB Output is correct
115 Correct 987 ms 15996 KB Output is correct
116 Correct 808 ms 15996 KB Output is correct
117 Correct 1036 ms 16112 KB Output is correct
118 Correct 7 ms 460 KB Output is correct
119 Correct 9 ms 488 KB Output is correct
120 Correct 7 ms 460 KB Output is correct
121 Correct 6 ms 460 KB Output is correct
122 Correct 8 ms 480 KB Output is correct
123 Correct 10 ms 388 KB Output is correct
124 Correct 8 ms 484 KB Output is correct
125 Correct 6 ms 460 KB Output is correct
126 Correct 8 ms 460 KB Output is correct
127 Correct 5 ms 460 KB Output is correct
128 Correct 5 ms 460 KB Output is correct
129 Correct 7 ms 332 KB Output is correct
130 Correct 9 ms 460 KB Output is correct
131 Correct 1 ms 332 KB Output is correct
132 Correct 147 ms 2908 KB Output is correct
133 Correct 151 ms 2828 KB Output is correct
134 Correct 141 ms 3052 KB Output is correct
135 Correct 130 ms 2876 KB Output is correct
136 Correct 119 ms 2856 KB Output is correct
137 Correct 117 ms 2652 KB Output is correct
138 Correct 115 ms 2644 KB Output is correct
139 Correct 110 ms 2636 KB Output is correct
140 Correct 126 ms 2636 KB Output is correct
141 Correct 159 ms 2844 KB Output is correct
142 Correct 145 ms 2828 KB Output is correct
143 Correct 152 ms 2840 KB Output is correct
144 Correct 174 ms 2756 KB Output is correct
145 Correct 156 ms 2300 KB Output is correct
146 Correct 105 ms 2880 KB Output is correct
147 Correct 129 ms 2644 KB Output is correct
148 Correct 126 ms 2636 KB Output is correct
149 Correct 104 ms 2636 KB Output is correct
150 Correct 106 ms 2632 KB Output is correct
151 Correct 125 ms 2612 KB Output is correct
152 Execution timed out 2050 ms 66844 KB Time limit exceeded
153 Halted 0 ms 0 KB -