oj.uz

Submission #870006

# Submission time Handle Problem Language Result Execution time Memory
870006 2023-11-06T14:52:23 Z melody_rules Rabbit Carrot (LMIO19_triusis) C++17
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
  long long int n=0;
  long long int m=0;
  long long int a=0;
  long long int i=0;
   long long int tot=0;
  
  cin>>n>>m;
  long long int arr[n];
  
  for(i=0;i<n;i++) {
    cin>>a;
    arr[i]=a;
  }
  
  a=0;
  for(i=0;i<n;i++) {
    if((m+a) < arr[i]) {
      arr[i]=m+a;
      a+=m;
      tot++;
    }
  }
  
  cout<<tot<<endl;
  
  return 0;
}

Subtask #1
0 / 14.0

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

Subtask #2
0 / 21.0

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

Subtask #3
0 / 28.0

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

Subtask #4
0 / 37.0

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