제출 #743918

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
743918		beepbeepsheep	Weirdtree (RMI21_weirdtree)	C++17	13 / 100	2069 ms	8612 KiB

weirdtree

#include "weirdtree.h"
#include <bits/stdc++.h>
#define ll long long
#define ii pair<ll,ll>
using namespace std;
vector<ll> v;
void initialise(int N, int Q, int H[]) {
	// Your code here.
	v.emplace_back(0);
	for (int i=1;i<=N;i++){
        v.emplace_back(H[i]);
	}
}
void cut(int l, int r, int k) {
    while (k--){
        ii best={0,-1};
        for (int i=l;i<=r;i++){
            if (v[i]>best.first){
                best.first=v[i];
                best.second=i;
            }
        }
        if (best.second!=-1) v[best.second]--;
    }
	// Your code here.
}
void magic(int i, int x) {
    v[i]=x;
	// Your code here.
}
long long int inspect(int l, int r) {
	// Your code here.
	ll ans=0;
	for (int i=l;i<=r;i++){
        ans+=v[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