# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
173851 | arnold518 | Safety (NOI18_safety) | C++14 | 76 ms | 6252 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 2e5;
int N, K, A[MAXN+10];
ll lx, rx, y;
priority_queue<ll, vector<ll>, less<ll>> l;
priority_queue<ll, vector<ll>, greater<ll>> r;
int main()
{
int i, j;
scanf("%d%d", &N, &K);
for(i=1; i<=N; i++) scanf("%d", &A[i]);
lx=rx=y=0;
l.push(A[1]); r.push(A[1]);
for(i=2; i<=N; i++)
{
lx-=K; rx+=K;
if(l.top()+lx<=A[i] && A[i]<=r.top()+rx)
{
l.push(A[i]-lx); r.push(A[i]-rx);
}
Compilation message (stderr)
# | 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... |