Submission #541795

#	Time	Username	Problem	Language	Result	Execution time	Memory
541795		keta_tsimakuridze	Cake 3 (JOI19_cake3)	C++14	0 / 100	1 ms	364 KiB

cake3

#include<bits/stdc++.h>
using namespace std;
 
#define int long long
#define pii pair<int,int>
#define f first
#define s second
#define endl "\n"
 
const int N = 2e5 + 5, mod = 1e9 + 7; //!
int t, n,  ans = 0, val[N], a[N], f[N];
pii p[N];
struct node{
	int cn, sum;
} tree[4 * N];
int m;
void add(int u, int l, int r, int id, int t) {
	if(l > id || r < id) return;
	if(l == r) {
		tree[u].cn += t;
		tree[u].sum += t * val[id];
		return;
	}
	int mid = (l + r) / 2;
	add(2 * u, l, mid, id, t); add(2 * u + 1, mid + 1, r, id, t);
	tree[u].cn = tree[2 * u].cn + tree[2 * u + 1].cn;
	tree[u].sum = tree[2 * u].sum + tree[2 * u + 1].sum;
}
void add(int id, int t) {
	add(1, 1, n, id, t);
}
int get(int u,int l,int r,int k) {
	if(l == r) {
		return min(tree[u].cn, k) * val[l];
	}
	int mid = (l + r) / 2;
	if(tree[2 * u + 1].cn <= k) return tree[2 * u + 1].sum + get(2 * u, l, mid, k - tree[2 * u + 1].cn);
	return get(2 * u + 1, mid + 1, r, k);
}
void solve(int l,int r,int ql, int qr) {
	if(r < l || ql > qr) return;
	int mid = (l + r) >> 1;
	pii opt; opt = {-2e15, 0};
	multiset<int> s;
	for(int i = mid; i >= max(l, qr + 1); i--) add(a[i], 1), f[i]++;
	if(mid < max(l, qr + 1))add(a[mid], 1);
	for(int i = min(qr, mid - 1);  i >= ql; i--) {
		add(a[i], 1);  f[i]++;
		if(mid - i + 1 >= m) 
		opt = max(opt, make_pair(get(1, 1, n, m) - 2 * (p[mid].f - p[i].f), i));
	}
//	cout << mid << " _ " << opt.f << " " << opt.s << endl;
	ans = max(ans, opt.f);
	if(mid < max(l, qr + 1))add(a[mid], -1);
	for(int i = mid; i >= max(l, qr + 1); i--) add(a[i], -1), f[i]--;
	for(int i = min(qr, mid - 1);  i >= ql; i--) add(a[i], -1), f[i]--;
	if(l == r) return;
	// qr + 1 ... l - 1 gvkonda => opt.s + 1 .. l - 1 , qr + 1 ... mid
	for(int i = opt.s + 1; i <= min(qr, l - 1); i++) add(a[i], 1), f[i]++;
	solve(l, mid - 1, ql, opt.s); 
	for(int i = opt.s + 1; i <= min(qr, l - 1); i++) add(a[i], -1), f[i]--;
	for(int i = max(l, qr + 1); i <= mid; i++) add(a[i], 1), f[i]++;
	solve(mid + 1,r, opt.s, qr);
	for(int i = max(l, qr + 1); i <= mid; i++) add(a[i], -1), f[i]--;
	
}
main() {
	ios_base::sync_with_stdio(false),
	cin.tie(0),cout.tie(0);
	cin >> n >> m;
	ans = -1e18;
	vector<pii> x;
	for(int i = 1; i <= n; i++) {
		cin >> p[i].s >> p[i].f;
	}
	sort(p + 1, p + n + 1);
	for(int i = 1; i <= n; i++) {
		x.push_back({p[i].s, i});
	}
	sort(x.begin(), x.end()); int cur = 0;
	for(int i = 0; i < x.size(); i++) {
		if(!i || x[i].f != x[i - 1].f) cur++;
		val[cur] = x[i].f;
		a[x[i].s] = cur;
	}
	solve(1, n, 1, n);
	cout << ans;
}

Compilation message (stderr)

cake3.cpp:67:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   67 | main() {
      | ^~~~
cake3.cpp: In function 'int main()':
cake3.cpp:81:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |  for(int i = 0; i < x.size(); i++) {
      |                 ~~^~~~~~~~~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 19
• Subtask 3: 0 / 76