# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1164800 | Ghulam_Junaid | Rabbit Carrot (LMIO19_triusis) | C++20 | 1095 ms | 596 KiB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n, m;
cin >> n >> m;
deque<ll> dq;
dq.push_front(0);
ll ans = 0;
for (ll i = 1; i <= n; i ++){
ll x;
cin >> x;
if (dq.front() + m < x){
ans++;
for (int j = 0; j < dq.size(); j ++)
dq[j] += m;
for (int j = 1; j < dq.size(); j ++)
if (dq[j] >= x) dq[j - 1] = max(dq[j - 1], x);
}
else{
for (int j = 0; j < dq.size(); j ++)
dq[j] += m;
dq.push_front(x);
}
for (int j = 1; j < dq.size(); j ++)
# | 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... |