oj.uz

Submission #497394

# Submission time Handle Problem Language Result Execution time Memory
497394 2021-12-23T04:17:57 Z pavement Cake 3 (JOI19_cake3) C++17
100 / 100
 599 ms 18388 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef double db;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tree<ii, null_type, less<ii>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

int L, R, N, M, ans = LLONG_MIN, V[200005], DV[200005], RV[200005], C[200005];
ii T[200005], ft[200005];
vector<int> disc;
priority_queue<int, vector<int>, greater<int> > pq;

inline int ls(int x) { return x & -x; }

void upd(int p, int a, int b) {
	for (; p <= disc.size(); p += ls(p))
		ft[p].first += a, ft[p].second += b;
}

ii qry(int p) {
	ii r = mp(0, 0);
	for (; p; p -= ls(p)) {
		r.first += ft[p].first;
		r.second += ft[p].second;
	}
	return r;
}

void add(int x) {
	upd(DV[x], V[x], 1);
}

void del(int x) {
	upd(DV[x], -V[x], -1);
}

int k_largest(int k) {
	int curr = 0, cnt = 0;
	for (int i = 18; i >= 0; i--)
		if (curr + (1 << i) <= disc.size() && cnt + ft[curr + (1 << i)].second < k) {
			cnt += ft[curr + (1 << i)].second;
			curr += (1 << i);
		}
	curr++;
	assert(curr <= disc.size());
	ii tmp = qry(curr);
	return tmp.first - (tmp.second - k) * RV[curr];
}

void shift(int l, int r) {
	while (l < L) add(--L);
	while (r > R) add(++R);
	while (l > L) del(L++);
	while (r < R) del(R--);
}

void dnc(int l, int r, int x, int y) {
	if (l > r) return;
	int m = (l + r) >> 1, sum = 0, opt = LLONG_MIN, pos = -1;
	for (; !pq.empty(); pq.pop());
	for (int i = min(m - M + 1, y); i >= x; i--) {
		shift(i, m);
		sum = k_largest(M);
		if (sum - 2 * (C[m] - C[i]) > opt) {
			opt = sum - 2 * (C[m] - C[i]);
			pos = i;
		}
	}
	assert(pos != -1);
	ans = max(ans, opt);
	dnc(l, m - 1, x, pos);
	dnc(m + 1, r, pos, y);
}

main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N >> M;
	for (int i = 1; i <= N; i++) {
		cin >> T[i].second >> T[i].first;
		disc.pb(T[i].second);
	}
	sort(T + 1, T + 1 + N);
	sort(disc.begin(), disc.end());
	for (int i = 1; i <= N; i++) {
		tie(C[i], V[i]) = T[i];
		DV[i] = disc.size() - (lower_bound(disc.begin(), disc.end(), V[i]) - disc.begin() + 1) + 1;
		RV[DV[i]] = V[i];
	}
	L = R = 1;
	add(1);
	dnc(M, N, 1, N);
	cout << ans << '\n';
}

Compilation message

cake3.cpp: In function 'void upd(long long int, long long int, long long int)':
cake3.cpp:36:11: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |  for (; p <= disc.size(); p += ls(p))
      |         ~~^~~~~~~~~~~~~~
cake3.cpp: In function 'long long int k_largest(long long int)':
cake3.cpp:60:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |   if (curr + (1 << i) <= disc.size() && cnt + ft[curr + (1 << i)].second < k) {
      |       ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
In file included from /usr/include/c++/10/ext/pb_ds/detail/pat_trie_/pat_trie_.hpp:45,
                 from /usr/include/c++/10/ext/pb_ds/detail/container_base_dispatch.hpp:90,
                 from /usr/include/c++/10/ext/pb_ds/assoc_container.hpp:48,
                 from cake3.cpp:2:
cake3.cpp:65:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |  assert(curr <= disc.size());
      |         ~~~~~^~~~~~~~~~~~~~
cake3.cpp: At global scope:
cake3.cpp:95:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   95 | main() {
      | ^~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 324 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 332 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 0 ms 324 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 328 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 328 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 320 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 0 ms 336 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 0 ms 336 KB Output is correct
30 Correct 0 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 0 ms 336 KB Output is correct
34 Correct 0 ms 336 KB Output is correct
35 Correct 0 ms 336 KB Output is correct
36 Correct 0 ms 336 KB Output is correct
37 Correct 0 ms 336 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 324 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 332 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 0 ms 324 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 328 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 328 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 320 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 0 ms 336 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 0 ms 336 KB Output is correct
30 Correct 0 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 0 ms 336 KB Output is correct
34 Correct 0 ms 336 KB Output is correct
35 Correct 0 ms 336 KB Output is correct
36 Correct 0 ms 336 KB Output is correct
37 Correct 0 ms 336 KB Output is correct
38 Correct 3 ms 472 KB Output is correct
39 Correct 3 ms 468 KB Output is correct
40 Correct 2 ms 464 KB Output is correct
41 Correct 2 ms 464 KB Output is correct
42 Correct 2 ms 464 KB Output is correct
43 Correct 2 ms 464 KB Output is correct
44 Correct 2 ms 464 KB Output is correct
45 Correct 3 ms 452 KB Output is correct
46 Correct 3 ms 500 KB Output is correct
47 Correct 3 ms 592 KB Output is correct
48 Correct 3 ms 464 KB Output is correct
49 Correct 2 ms 516 KB Output is correct
50 Correct 2 ms 464 KB Output is correct
51 Correct 2 ms 500 KB Output is correct
52 Correct 2 ms 464 KB Output is correct
53 Correct 2 ms 456 KB Output is correct
54 Correct 2 ms 464 KB Output is correct
55 Correct 2 ms 464 KB Output is correct
56 Correct 1 ms 464 KB Output is correct
57 Correct 2 ms 468 KB Output is correct
58 Correct 2 ms 464 KB Output is correct
59 Correct 1 ms 464 KB Output is correct
60 Correct 2 ms 480 KB Output is correct
61 Correct 2 ms 464 KB Output is correct
62 Correct 1 ms 468 KB Output is correct
63 Correct 2 ms 464 KB Output is correct
64 Correct 1 ms 464 KB Output is correct
65 Correct 3 ms 464 KB Output is correct
66 Correct 2 ms 468 KB Output is correct
67 Correct 3 ms 556 KB Output is correct
68 Correct 3 ms 464 KB Output is correct
69 Correct 2 ms 464 KB Output is correct
70 Correct 3 ms 464 KB Output is correct
71 Correct 2 ms 464 KB Output is correct
72 Correct 2 ms 464 KB Output is correct
73 Correct 2 ms 464 KB Output is correct
74 Correct 1 ms 480 KB Output is correct

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 324 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 332 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 0 ms 324 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 328 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 328 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 320 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 0 ms 336 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 0 ms 336 KB Output is correct
30 Correct 0 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 0 ms 336 KB Output is correct
34 Correct 0 ms 336 KB Output is correct
35 Correct 0 ms 336 KB Output is correct
36 Correct 0 ms 336 KB Output is correct
37 Correct 0 ms 336 KB Output is correct
38 Correct 3 ms 472 KB Output is correct
39 Correct 3 ms 468 KB Output is correct
40 Correct 2 ms 464 KB Output is correct
41 Correct 2 ms 464 KB Output is correct
42 Correct 2 ms 464 KB Output is correct
43 Correct 2 ms 464 KB Output is correct
44 Correct 2 ms 464 KB Output is correct
45 Correct 3 ms 452 KB Output is correct
46 Correct 3 ms 500 KB Output is correct
47 Correct 3 ms 592 KB Output is correct
48 Correct 3 ms 464 KB Output is correct
49 Correct 2 ms 516 KB Output is correct
50 Correct 2 ms 464 KB Output is correct
51 Correct 2 ms 500 KB Output is correct
52 Correct 2 ms 464 KB Output is correct
53 Correct 2 ms 456 KB Output is correct
54 Correct 2 ms 464 KB Output is correct
55 Correct 2 ms 464 KB Output is correct
56 Correct 1 ms 464 KB Output is correct
57 Correct 2 ms 468 KB Output is correct
58 Correct 2 ms 464 KB Output is correct
59 Correct 1 ms 464 KB Output is correct
60 Correct 2 ms 480 KB Output is correct
61 Correct 2 ms 464 KB Output is correct
62 Correct 1 ms 468 KB Output is correct
63 Correct 2 ms 464 KB Output is correct
64 Correct 1 ms 464 KB Output is correct
65 Correct 3 ms 464 KB Output is correct
66 Correct 2 ms 468 KB Output is correct
67 Correct 3 ms 556 KB Output is correct
68 Correct 3 ms 464 KB Output is correct
69 Correct 2 ms 464 KB Output is correct
70 Correct 3 ms 464 KB Output is correct
71 Correct 2 ms 464 KB Output is correct
72 Correct 2 ms 464 KB Output is correct
73 Correct 2 ms 464 KB Output is correct
74 Correct 1 ms 480 KB Output is correct
75 Correct 503 ms 17148 KB Output is correct
76 Correct 576 ms 16684 KB Output is correct
77 Correct 478 ms 17212 KB Output is correct
78 Correct 465 ms 17444 KB Output is correct
79 Correct 97 ms 17444 KB Output is correct
80 Correct 131 ms 16992 KB Output is correct
81 Correct 447 ms 16572 KB Output is correct
82 Correct 599 ms 16836 KB Output is correct
83 Correct 540 ms 17412 KB Output is correct
84 Correct 560 ms 17288 KB Output is correct
85 Correct 460 ms 16672 KB Output is correct
86 Correct 236 ms 16252 KB Output is correct
87 Correct 251 ms 15864 KB Output is correct
88 Correct 393 ms 15800 KB Output is correct
89 Correct 376 ms 16644 KB Output is correct
90 Correct 236 ms 17364 KB Output is correct
91 Correct 181 ms 16056 KB Output is correct
92 Correct 169 ms 16008 KB Output is correct
93 Correct 212 ms 16696 KB Output is correct
94 Correct 156 ms 17304 KB Output is correct
95 Correct 230 ms 17340 KB Output is correct
96 Correct 135 ms 11844 KB Output is correct
97 Correct 149 ms 12680 KB Output is correct
98 Correct 205 ms 12532 KB Output is correct
99 Correct 117 ms 12604 KB Output is correct
100 Correct 121 ms 11856 KB Output is correct
101 Correct 132 ms 11840 KB Output is correct
102 Correct 467 ms 16280 KB Output is correct
103 Correct 448 ms 16068 KB Output is correct
104 Correct 522 ms 16836 KB Output is correct
105 Correct 366 ms 16852 KB Output is correct
106 Correct 398 ms 17404 KB Output is correct
107 Correct 350 ms 16596 KB Output is correct
108 Correct 432 ms 17252 KB Output is correct
109 Correct 343 ms 18232 KB Output is correct
110 Correct 165 ms 11564 KB Output is correct
111 Correct 225 ms 11712 KB Output is correct
112 Correct 247 ms 15228 KB Output is correct
113 Correct 102 ms 18388 KB Output is correct