# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
875858 | 2023-11-20T16:12:56 Z | Mr_Ph | Weirdtree (RMI21_weirdtree) | C++17 | 2000 ms | 6608 KB |
#include "weirdtree.h" //#include "grader.cpp" #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) { int sum=0; for(int i=l-1;i<r;i++)sum+=arr[i]; return sum; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2052 ms | 736 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2052 ms | 736 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2013 ms | 6608 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |