Submission #637907

#TimeUsernameProblemLanguageResultExecution timeMemory
637907ojoConmigoRabbit Carrot (LMIO19_triusis)C++17
14 / 100
1085 ms468 KiB
#include <bits/stdc++.h> using namespace std; int n,m; vector<int> v; int f(int i,int pos){ if(i == n){ return 0; } if(v[i] > pos+m){ return f(i+1,pos+m) + 1; }else if(v[i] < pos+m){ return min(f(i+1,v[i]),f(i+1,pos+m)+1); }else return f(i+1,v[i]); } int main(){ ios::sync_with_stdio(false); cin.tie(0); cin >> n >> m; v.resize(n); for(int i=0; i<n; i++){ cin >> v[i]; } /* int pos = 0; int cont = 0; for(int i=0; i<n; i++){ if(v[i] > pos+m){ cont++; pos+=m; }else pos = v[i]; } cout << cont << endl; */ cout << f(0,0) << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...