Submission #875864

#	Time	Username	Problem	Language	Result	Execution time	Memory
875864		Mr_Ph	Weirdtree (RMI21_weirdtree)	C++17	13 / 100	2081 ms	3780 KiB

weirdtree

#include "weirdtree.h"
#ifdef test
#include "grader.cpp"
#endif
#include<bits/stdc++.h>
using namespace std;
vector<int> arr;
void initialise(int N, int Q, int h[]) {
    for(int i=1;i<=N;i++)
        arr.push_back(h[i]);
}
void cut(int l, int r, int k) {
    while(k--)
    {
    int mx=-1e18,idx=0;
        for(int i=l-1;i<r;i++)
        if(arr[i]>mx)mx=arr[i],idx=i;
       // cout<<l<<" "<<r<<" "<<idx<<" "<<mx<<endl;
        if(mx<=0)continue;
        arr[idx]--;
    }
}
void magic(int i, int x) {
	arr[i-1]=x;
}
long long int inspect(int l, int r) {
    long long sum=0;
    for(int i=l-1;i<r;i++)sum+=arr[i];
	return sum;
}

Compilation message (stderr)

weirdtree.cpp: In function 'void cut(int, int, int)':
weirdtree.cpp:15:12: warning: overflow in conversion from 'double' to 'int' changes value from '-1.0e+18' to '-2147483648' [-Woverflow]
   15 |     int mx=-1e18,idx=0;
      |            ^~~~~

• 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