Submission #1147280

#TimeUsernameProblemLanguageResultExecution timeMemory
1147280Math4Life2020Weirdtree (RMI21_weirdtree)C++20
0 / 100
2096 ms2756 KiB
#include "weirdtree.h" #include <bits/stdc++.h> using namespace std; int h1[(long long)5e5]; void initialise(int _N, int Q, int h0[]) { for (long long i=0;i<_N;i++) { h1[i+1]=h0[i]; } } void cut(int l, int r, int k) { while (k>0) { long long xloc = -1; long long mval = 0; for (long long i=l;i<=r;i++) { if (h1[i]>mval) { mval = h1[i]; xloc = i; } } if (xloc==-1) { break; } h1[xloc]--; k--; } } void magic(int i, int x) { h1[i]=x; } long long int inspect(int l, int r) { long long vf = 0; for (long long i=l;i<=r;i++) { vf += h1[i]; } return vf; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...