Submission #744128

#	Time	Username	Problem	Language	Result	Execution time	Memory
744128		hmm789	Weirdtree (RMI21_weirdtree)	C++14	13 / 100	2072 ms	3924 KiB

weirdtree

#include "weirdtree.h"
#include <bits/stdc++.h>
using namespace std;
#define INF 1000000001
#define int long long
int a[300000], n;
#undef int

void initialise(int N, int Q, int h[]) {
	n = N;
	for(int i = 0; i < n; i++) {
		a[i] = h[i+1];
	}
}
void cut(int l, int r, int k) {
	#define int long long
	l--; r--;
	int L = 0, R = INF, M, cnt = 0;
	for(int i = l; i <= r; i++) cnt += a[i];
	if(k >= cnt) {
		for(int i = l; i <= r; i++) a[i] = 0;
		return;
	}
	while(L < R) {
		M = (L+R)/2;
		cnt = 0;
		for(int i = l; i <= r; i++) cnt += max(a[i]-M, 0LL);
		if(cnt < k) R = M;
		else L = M+1;
	}
	cnt = 0;
	for(int i = l; i <= r; i++) cnt += max(a[i]-L, 0LL);
	cnt = k-cnt;
	for(int i = l; i <= r; i++) {
		if(a[i] >= L) {
			a[i] = L;
			if(cnt) {
				a[i]--;
				cnt--;
			}
		}
	}
	#undef int
}
void magic(int i, int x) {
	i--;
	a[i] = x;
}
long long int inspect(int l, int r) {
	l--; r--;
	long long ans = 0;
	for(int i = l; i <= r; i++) ans += a[i];
	return ans;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 8
• Subtask 3: 8 / 8
• Subtask 4: 0 / 19
• Subtask 5: 0 / 10
• Subtask 6: 0 / 21
• Subtask 7: 0 / 29