제출 #1219261

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1219261		zhiganov_v	Weirdtree (RMI21_weirdtree)	C++20	13 / 100	2096 ms	2888 KiB

weirdtree

#include "weirdtree.h"
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const ll N = 1 << 17;
ll a[N];

void initialise(int n, int q, int h[]) {
    for (ll i = 1; i <= n; i++) a[i] = h[i];
}

vector<int> b;

void cut(int l, int r, int k) {
    ll lx = 0, rx = 1e9 + 20;
    while (lx + 1 < rx) {
        ll mx = (lx + rx) / 2;
        ll need = 0;
        for (ll i = l;i<=r;i++) {
            need += max(a[i] - mx, 0ll);
        }
        if (need <= k) rx = mx;
        else lx = mx;
    }
    for (ll i = l;i<=r;i++) {
        if (a[i] > rx) {
            k -= a[i] - rx;
            a[i] = rx;
        }
    }
    for (ll i = l;i<=r;i++) {
        if (k > 0 && a[i] == rx) {
            k--;
            a[i]--;
        }
    }
}

void magic(int i, int x) {
    a[i] = x;
}

long long int inspect(int l, int r) {
    ll ans = 0;
    for (ll 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