oj.uz

답안 #961374

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
961374 2024-04-12T02:01:03 Z Bungmint Cake 3 (JOI19_cake3) C++17
100 / 100
 696 ms 13776 KB 
// Copyright © 2024 Youngmin Park. All rights reserved.
//#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;

#pragma region TEMPLATE

using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
using vpi = vector<pii>;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vpl = vector<pll>;
using ld = long double;
template <typename T, size_t SZ>
using ar = array<T, SZ>;
template <typename T>
using pqg = priority_queue<T, vector<T>, greater<T>>;

#define all(v) (v).begin(), (v).end()
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound

constexpr int INF = 1e9;
constexpr ll LINF = 1e18;
const ld PI = acos((ld)-1.0);
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T>
constexpr bool ckmin(T &a, const T &b) { return b < a ? a = b, 1 : 0; }
template <typename T>
constexpr bool ckmax(T &a, const T &b) { return b > a ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); } // divide a by b rounded down

#ifdef LOCAL
#include "miscellaneous/debug.h"
#else
#define dbg(...) 42
#endif

#pragma endregion TEMPLATE

/**
 * Description: Performs range prefix sum queries and point updates. lower_bound returns the first prefix sum >= v
 * Source: Own
 * Verification: http://www.usaco.org/index.php?page=viewproblem2&cpid=693
 * Time Complexity: O(log n) for query and update
 * 0-indexing
 */

template <typename T>
struct BIT {
	int N; vector<T> bit;
	BIT(int n) : N(n), bit(n + 1) {}
	void upd(int id, T v) {
		for (id++; id <= N; id += id & -id)
			bit[id] += v;
	}
	T query(int id) {
		T res = 0;
		for (id++; id > 0; id -= id & -id)
			res += bit[id];
		return res;
	}
	T query(int l, int r) {
		return l > r ? 0 : query(r) - query(l - 1);
	}
	T lower_bound(T v) {
		int id = 0;
		T sum = 0;
		int lg = 31 - __builtin_clz(N);
		for (int j = lg; ~j; j--) {
			if (id + (1 << j) <= N && sum + bit[id + (1 << j)] < v) {
				id += (1 << j);
				sum += bit[id];
			}
		}
		return id;
	}
};


void solve() {
	int n, m;
	cin >> n >> m;
	vl cost(n), val(n), ind(n), order;
	for (int i = 0; i < n; i++) cin >> val[i] >> cost[i], order.pb(val[i]);
	iota(all(ind), 0);
	sort(all(ind), [&](int i, int j) { return cost[i] < cost[j]; });
	sort(all(order));
	order.resize(unique(all(order)) - begin(order));
	int k = sz(order);
	BIT<ll> bit(k), ex(k);
	for (int i = 0; i < n; i++) {
		val[i] = lb(all(order), val[i]) - begin(order);
		val[i] = k - 1 - val[i];
	}
	int lef = 0, rig = -1;
	auto upd = [&](int l, int r) -> void {
		while (rig < r) {
			rig++;
			int id = val[ind[rig]];
			bit.upd(id, 1);
			ex.upd(id, 1LL * order[k - 1 - id]);
		}
		while (lef > l) {
			lef--;
			int id = val[ind[lef]];
			bit.upd(id, 1);
			ex.upd(id, 1LL * order[k - 1 - id]);
		}
		while (rig > r) {
			int id = val[ind[rig]];
			bit.upd(id, -1);
			ex.upd(id, -1LL * order[k - 1 - id]);
			rig--;
		}
		while (lef < l) {
			int id = val[ind[lef]];
			bit.upd(id, -1);
			ex.upd(id, -1LL * order[k - 1 - id]);
			lef++;
		}
	};
	auto get_top_m = [&]() -> ll {
		int i = bit.lower_bound(m) - 1;
		int todo = m - bit.query(i);
		return ex.query(i) + 1LL * todo * order[k - 2 - i];
	};

	ll ans = -LINF;
	auto solver = [&](int l, int r, int optl, int optr, auto&& self) -> void {
		if (l > r) return;
		int mid = (l + r) / 2;
		int optm = -1;
		ll opt = -LINF;
		for (int i = optl; i <= optr; i++) {
			if (i < mid + m - 1) continue;
			upd(mid, i);
			if (ckmax(opt, get_top_m() - 2 * (cost[ind[i]] - cost[ind[mid]]))) {
				optm = i;
			}
		}
		ckmax(ans, opt);
		if (opt == -LINF) {
			self(l, mid - 1, optl, optr, self);
		} else {
			self(l, mid - 1, optl, optm, self);
			self(mid + 1, r, optm, optr, self);
		}
	};
	solver(0, n - 1, 0, n - 1, solver);
	cout << ans << '\n';
}

int main() {
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);
	int testcase = 1;
	// cin >> testcase;
	while (testcase--) {
		solve();
	}
#ifdef LOCAL
	cerr << "Time elapsed: " << 1.0 * (double)clock() / CLOCKS_PER_SEC << " s.\n";
#endif
}

Compilation message

cake3.cpp:7: warning: ignoring '#pragma region TEMPLATE' [-Wunknown-pragmas]
    7 | #pragma region TEMPLATE
      | 
cake3.cpp:49: warning: ignoring '#pragma endregion TEMPLATE' [-Wunknown-pragmas]
   49 | #pragma endregion TEMPLATE
      |

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 460 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 460 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 460 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 460 KB Output is correct
38 Correct 3 ms 348 KB Output is correct
39 Correct 3 ms 600 KB Output is correct
40 Correct 2 ms 600 KB Output is correct
41 Correct 2 ms 348 KB Output is correct
42 Correct 2 ms 604 KB Output is correct
43 Correct 2 ms 348 KB Output is correct
44 Correct 3 ms 348 KB Output is correct
45 Correct 3 ms 604 KB Output is correct
46 Correct 3 ms 604 KB Output is correct
47 Correct 3 ms 348 KB Output is correct
48 Correct 3 ms 468 KB Output is correct
49 Correct 2 ms 604 KB Output is correct
50 Correct 2 ms 604 KB Output is correct
51 Correct 2 ms 600 KB Output is correct
52 Correct 2 ms 348 KB Output is correct
53 Correct 2 ms 604 KB Output is correct
54 Correct 2 ms 344 KB Output is correct
55 Correct 2 ms 344 KB Output is correct
56 Correct 2 ms 604 KB Output is correct
57 Correct 2 ms 348 KB Output is correct
58 Correct 2 ms 348 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 2 ms 348 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 1 ms 348 KB Output is correct
63 Correct 2 ms 348 KB Output is correct
64 Correct 1 ms 344 KB Output is correct
65 Correct 3 ms 348 KB Output is correct
66 Correct 3 ms 348 KB Output is correct
67 Correct 3 ms 348 KB Output is correct
68 Correct 3 ms 604 KB Output is correct
69 Correct 2 ms 452 KB Output is correct
70 Correct 2 ms 348 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 1 ms 348 KB Output is correct
73 Correct 2 ms 472 KB Output is correct
74 Correct 1 ms 472 KB Output is correct

Subtask #3
76.0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 460 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 460 KB Output is correct
38 Correct 3 ms 348 KB Output is correct
39 Correct 3 ms 600 KB Output is correct
40 Correct 2 ms 600 KB Output is correct
41 Correct 2 ms 348 KB Output is correct
42 Correct 2 ms 604 KB Output is correct
43 Correct 2 ms 348 KB Output is correct
44 Correct 3 ms 348 KB Output is correct
45 Correct 3 ms 604 KB Output is correct
46 Correct 3 ms 604 KB Output is correct
47 Correct 3 ms 348 KB Output is correct
48 Correct 3 ms 468 KB Output is correct
49 Correct 2 ms 604 KB Output is correct
50 Correct 2 ms 604 KB Output is correct
51 Correct 2 ms 600 KB Output is correct
52 Correct 2 ms 348 KB Output is correct
53 Correct 2 ms 604 KB Output is correct
54 Correct 2 ms 344 KB Output is correct
55 Correct 2 ms 344 KB Output is correct
56 Correct 2 ms 604 KB Output is correct
57 Correct 2 ms 348 KB Output is correct
58 Correct 2 ms 348 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 2 ms 348 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 1 ms 348 KB Output is correct
63 Correct 2 ms 348 KB Output is correct
64 Correct 1 ms 344 KB Output is correct
65 Correct 3 ms 348 KB Output is correct
66 Correct 3 ms 348 KB Output is correct
67 Correct 3 ms 348 KB Output is correct
68 Correct 3 ms 604 KB Output is correct
69 Correct 2 ms 452 KB Output is correct
70 Correct 2 ms 348 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 1 ms 348 KB Output is correct
73 Correct 2 ms 472 KB Output is correct
74 Correct 1 ms 472 KB Output is correct
75 Correct 652 ms 12940 KB Output is correct
76 Correct 696 ms 12492 KB Output is correct
77 Correct 544 ms 12976 KB Output is correct
78 Correct 584 ms 13000 KB Output is correct
79 Correct 106 ms 13004 KB Output is correct
80 Correct 149 ms 12996 KB Output is correct
81 Correct 415 ms 9616 KB Output is correct
82 Correct 557 ms 9876 KB Output is correct
83 Correct 494 ms 9928 KB Output is correct
84 Correct 535 ms 10016 KB Output is correct
85 Correct 456 ms 9708 KB Output is correct
86 Correct 222 ms 9156 KB Output is correct
87 Correct 262 ms 9012 KB Output is correct
88 Correct 420 ms 9104 KB Output is correct
89 Correct 345 ms 9416 KB Output is correct
90 Correct 236 ms 9672 KB Output is correct
91 Correct 182 ms 9092 KB Output is correct
92 Correct 182 ms 8908 KB Output is correct
93 Correct 205 ms 9280 KB Output is correct
94 Correct 151 ms 9912 KB Output is correct
95 Correct 229 ms 9672 KB Output is correct
96 Correct 84 ms 9176 KB Output is correct
97 Correct 91 ms 9668 KB Output is correct
98 Correct 83 ms 9424 KB Output is correct
99 Correct 77 ms 9504 KB Output is correct
100 Correct 69 ms 9172 KB Output is correct
101 Correct 88 ms 9164 KB Output is correct
102 Correct 394 ms 9176 KB Output is correct
103 Correct 376 ms 8928 KB Output is correct
104 Correct 469 ms 9428 KB Output is correct
105 Correct 308 ms 9420 KB Output is correct
106 Correct 333 ms 9684 KB Output is correct
107 Correct 266 ms 9164 KB Output is correct
108 Correct 513 ms 12924 KB Output is correct
109 Correct 462 ms 13664 KB Output is correct
110 Correct 93 ms 8836 KB Output is correct
111 Correct 123 ms 8828 KB Output is correct
112 Correct 561 ms 11176 KB Output is correct
113 Correct 107 ms 13776 KB Output is correct