Submission #1299434

#	Time	Username	Problem	Language	Result	Execution time	Memory
1299434		NotLinux	Weirdtree (RMI21_weirdtree)	C++20	13 / 100	2095 ms	2740 KiB

weirdtree

#include "weirdtree.h"
#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.size()
#define all(x) x.begin() , x.end()
vector<int>arr;
void initialise(int N, int Q, int h[]) {
	arr.resize(N+1);
	for(int i = 1;i<=N;i++)arr[i] = h[i];
}
void cut(int l, int r, int k) {
	while(k--){
		int maxi = l;
		for(int i = l+1;i<=r;i++){
			if(arr[maxi] < arr[i])maxi = i;
		}
		arr[maxi]--;
	}
}
void magic(int i, int x) {
	arr[i] = x;
}
long long int inspect(int l, int r) {
	long long ans = 0;
	for(int i = l;i<=r;i++)ans += arr[i];
	return ans;
}

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