# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
448525 | 2021-07-30T11:37:20 Z | Neos | Rabbit Carrot (LMIO19_triusis) | C++14 | 2 ms | 332 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<ll,ll> ii; typedef vector<bool> vb; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<ii> vii; typedef vector<ld> vld; typedef vector<vi> vvi; typedef vector<vll> vvll; typedef vector<vii> vvii; #define task "test" #define fastIO ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL) #define forw(i,l,r) for( ll i = (l) ; i < (r) ; i++ ) #define forb(i,r,l) for( ll i = (r) ; i >= (l) ; i-- ) #define sz(x) (int)x.size() #define fi first #define se second #define pb push_back #define pf push_front #define pob pop_back #define pof pop_front #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define cntbit(x) __builtin_popcount(x) #define lb lower_bound #define ub upper_bound #define endl '\n' const int dx[4] = {-1, 0, 1, 0}; const int dy[4] = {0, -1, 0, 1}; const int N = 2e5+7; const ll inf = 1e18; int n, m, h[N]; void solve() { cin >> n >> m; forw(i, 1, n + 1) cin >> h[i]; int ans = 0; forw(i, 0, n) { if (h[i + 1] - h[i] > m) { h[i + 1] = h[i] + m; ++ans; } } cout << ans << endl; } int main() { fastIO; #ifndef ONLINE_JUDGE freopen(task".inp", "r", stdin); freopen(task".out", "w", stdout); #endif int tc = 1; // cin >> tc; while (tc--) { solve(); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 332 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 332 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 332 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 332 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |