oj.uz

Submission #512194

# Submission time Handle Problem Language Result Execution time Memory
512194 2022-01-16T07:29:08 Z PikaQ Rabbit Carrot (LMIO19_triusis) C++17
0 / 100
 1 ms 204 KB 
#include<bits/stdc++.h>
#define int ll
#define forn(i,n) for(int i=0;i<(n);i++)
#define Forn(i,n) for(int i=1;i<=(n);i++)
#define For(i, a, b) for (int i = a; i <= b; i++)
#define foR(i, a, b) for (int i = a; i >= b; i--)
#define ll long long
#define pb push_back
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define vi vector<int>
#define vl vector<long long>
#define vpi vector<pair<int,int> >
#define pii pair<int,int>
#define pll pair<long long,long long>
#define mp make_pair
#define all(p) p.begin(),p.end()
#define alr(p,q) p+1,p+q+1
#define ull unsigned long long
#define st0(p) memset((p),0,sizeof(p))
#define T(x) ((x)%2 ? s[(x)/2] : '.')
#define lowb(x) x&-x
#define ls(x) (x)*2
#define rs(x) (x)*2+1
#define sz(x) (x).size()
#define rz resize
#define printv(x) {for(auto &i : x) {cout << i << ' ';}cout <<'\n';}
using namespace std;
 
inline void USACO(string filename){
  freopen((filename+".in").c_str(),"r",stdin);
  freopen((filename+".out").c_str(),"w",stdout);
}
 
void debug() {cout << endl;}
template <class T, class ...U> void debug(T a, U ... b) { cout << a << " "; debug(b...);}
// template <class T> int max(T a, T ... b) { cout << a << " "; debug(b...);}
const int INF = 1e18+7;
const int N =2e5+9;
const double eps = 1e-7;

void solve(){
  int n,m;
  cin >> n >> m;
  vi a(n+1),b(n+1);
  a[0] = 0;
  Forn(i,n) cin >> a[i];
  int ok = 0;
  Forn(i,n) {
    b[i] = a[i] - a[i-1];
    if(a[i] <= m || a[i] < a[i-1]) ok = 1;
    if(ok) b[i] -= m;
  }
  // Forn(i,n) cout << a[i] << '\n';
  int ans = 0;
  Forn(i,n){
    if(b[i] > 0){
      ans++;
    }
  }
  cout << ans << '\n';  
} 
 
signed main(){
  // USACO("cowjog");
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(0);

  // cout << "?";
    // cout << fixed << setprecision(15);
  // int t;
  // cin >> t;
  // while(t--)
    solve();
  return 0;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Incorrect 1 ms 204 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Incorrect 1 ms 204 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Incorrect 1 ms 204 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Incorrect 1 ms 204 KB Output isn't correct
8 Halted 0 ms 0 KB -