# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1120685 | InvMOD | Rabbit Carrot (LMIO19_triusis) | C++14 | 1 ms | 512 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;
using ll = long long;
void solve()
{
int n; ll w; cin >> n >> w;
vector<ll> a(n+1);
for(int i = 1; i <= n; i++){
cin >> a[i];
}
vector<bool> modify(n+1, false);
int answer = 0;
for(int i = 1; i <= n; i++){
if(a[i] > a[i-1] + w){
if(i-1 > 0){
if(modify[i-1]){
a[i] = a[i-1] + w;
modify[i] = true;
}
else{
modify[i-1] = true;
}
}
else{
a[i] = w;
modify[i] = true;
}
answer = answer + 1;
}
}
cout << answer <<"\n";
return;
}
int32_t main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
#define name "InvMOD"
if(fopen(name".INP", "r")){
freopen(name".INP", "r", stdin);
freopen(name".OUT", "w", stdout);
}
solve();
return 0;
}
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... |