Submission #996798

#TimeUsernameProblemLanguageResultExecution timeMemory
996798akkshaysrRabbit Carrot (LMIO19_triusis)C++17
0 / 100
1 ms448 KiB
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #define fr first #define se second #define rep(i,a,b) for(int i = a; i < (b); ++i) #define rrep(i,a,b) for(int i = a; i > (b); --i) #define sz(x) (int)(x).size() #define all(x) (x).begin(),(x).end() #define IN(i,l,r) (l<i&&i<r) #define pb push_back #define ones __builtin_popcountll using namespace std; using namespace __gnu_pbds; template <class T> using OSTree = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>; typedef pair<int,int> pi; typedef vector<int> vi; typedef vector<long long> vll; typedef long long ll; int n,m; vi A; int main(){ cin.tie(0)->sync_with_stdio(false); cin >> n >> m; A = vi(n); rep(i,0,n) cin >> A[i]; vector<bool> reach(n); pi prev = {0,-1}; rep(i,0,n){ if(A[i] <= prev.fr + (i-prev.se)*m){ reach[i] = true; prev = {A[i],i}; } } cout << n - accumulate(all(reach),0) << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...