Submission #744058

#	Time	Username	Problem	Language	Result	Execution time	Memory
744058		salmon	Weirdtree (RMI21_weirdtree)	C++14	5 / 100	2087 ms	6720 KiB

weirdtree

#include "weirdtree.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> lst;
priority_queue<pair<int,int>> pq;

void initialise(int N, int Q, int h[]) {
	lst.push_back(0);
	for(int i = 1; i <= N; i++){
		lst.push_back(h[i]);
	}
}

void cut(int l, int r, int k) {
    while(!pq.empty()){
        pq.pop();
    }

	for(int i = l; i <= r; i++){
        pq.push(make_pair(lst[i],-i));
	}

	while(k != 0){
        if(pq.top().first == 0){
            return;
        }
        k = 0;
    }

    lst[-pq.top().second]--;
}
void magic(int i, int x) {
	lst[i] = x;
}
long long int inspect(int l, int r) {
	long long int V = 0;

	for(int i = l ; i <= r; i++){
        V = V + lst[i];
	}

	return V;
}

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