Submission #1219223

#	Time	Username	Problem	Language	Result	Execution time	Memory
1219223		nutella	Weirdtree (RMI21_weirdtree)	C++20	13 / 100	2095 ms	2748 KiB

weirdtree

#include "weirdtree.h"
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

vector<int> A;

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

void cut(int l, int r, int k) {
    --l;
    while (k--) {
        int mx = l;
        for (int i = l + 1; i < r; ++i) {
            if (A[i] > A[mx]) {
                mx = i;
            }
        }
        A[mx] = max(0, A[mx] - 1);
    }
}

void magic(int i, int x) {
    --i;
    A[i] = x;
    // Your code here.
}

ll inspect(int l, int r) {
    --l;
    return accumulate(A.begin() + l, A.begin() + r, 0LL);
}

• 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