# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1135112 | Aviansh | Safety (NOI18_safety) | C++20 | 122 ms | 19760 KiB |
#include <bits/stdc++.h>
using namespace std;
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n,h;
cin >> n >> h;
int arr[n];
int mxval = 0;
for(int &i : arr){
cin >> i;
mxval=max(mxval,i);
}
multiset<long long>left,right;
long long m = 1;
long long c = -arr[0];
left.insert(arr[0]);
right.insert(arr[0]);
long long lazl = 0;
long long lazr=0;
for(int i = 1;i<n;i++){
lazl-=h;
lazr+=h;
long long lef = *(--left.end())+lazl;
long long rig = *(right.begin())+lazr;
//point addition:
c-=arr[i];
//expansion:
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |