Submission #1147273

#	Time	Username	Problem	Language	Result	Execution time	Memory
1147273		Math4Life2020	Weirdtree (RMI21_weirdtree)	C++20	0 / 100	2096 ms	5820 KiB

weirdtree

#include "weirdtree.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long; using pii = pair<ll,ll>;

vector<ll> h;
void initialise(int N, int Q, int h0[]) {
    h.clear();
    h.push_back(0);
    for (ll i=0;i<N;i++) {
        h.push_back(h0[i]);
    }
}

void cut(int l, int r, int k) {
    while (k>0) {
        ll xloc = -1;
        ll mval = 0;
        for (ll i=l;i<=r;i++) {
            if (h[i]>mval) {
                mval = h[i];
                xloc = i;
            }
        }
        if (xloc==-1) {
            break;
        }
        h[xloc]--;
        k--;
    }
}

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

ll inspect(int l, int r) {
    ll vf = 0;
    for (ll i=l;i<=r;i++) {
        vf += h[i];
    }
    return vf;
}

• Subtask 1: 0 / 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