oj.uz

Submission #516470

# Submission time Handle Problem Language Result Execution time Memory
516470 2022-01-21T11:25:06 Z Kipras Rabbit Carrot (LMIO19_triusis) C++14
0 / 100
 1 ms 1468 KB 
#include <bits/stdc++.h>

using namespace std;

const int maxN = 1e5*3;

int main()
{

    int n, m;
    cin>>n>>m;
    int a[maxN];
    for(int i = 1; i <= n; i++)cin>>a[i];
    int uses=0;
    int curH=0;
    for(int i = 1; i <= n; i++){
        if(curH+m>=a[i])curH=a[i];
        else{ curH=curH+m;uses++;}
    }
    cout<<uses;

    return 0;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1356 KB Output is correct
2 Correct 1 ms 1440 KB Output is correct
3 Correct 1 ms 1356 KB Output is correct
4 Correct 1 ms 1356 KB Output is correct
5 Correct 1 ms 1464 KB Output is correct
6 Correct 1 ms 1356 KB Output is correct
7 Correct 1 ms 1468 KB Output is correct
8 Correct 1 ms 1464 KB Output is correct
9 Correct 1 ms 1460 KB Output is correct
10 Correct 1 ms 1356 KB Output is correct
11 Correct 1 ms 1356 KB Output is correct
12 Incorrect 1 ms 1356 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1356 KB Output is correct
2 Correct 1 ms 1440 KB Output is correct
3 Correct 1 ms 1356 KB Output is correct
4 Correct 1 ms 1356 KB Output is correct
5 Correct 1 ms 1464 KB Output is correct
6 Correct 1 ms 1356 KB Output is correct
7 Correct 1 ms 1468 KB Output is correct
8 Correct 1 ms 1464 KB Output is correct
9 Correct 1 ms 1460 KB Output is correct
10 Correct 1 ms 1356 KB Output is correct
11 Correct 1 ms 1356 KB Output is correct
12 Incorrect 1 ms 1356 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1356 KB Output is correct
2 Correct 1 ms 1440 KB Output is correct
3 Correct 1 ms 1356 KB Output is correct
4 Correct 1 ms 1356 KB Output is correct
5 Correct 1 ms 1464 KB Output is correct
6 Correct 1 ms 1356 KB Output is correct
7 Correct 1 ms 1468 KB Output is correct
8 Correct 1 ms 1464 KB Output is correct
9 Correct 1 ms 1460 KB Output is correct
10 Correct 1 ms 1356 KB Output is correct
11 Correct 1 ms 1356 KB Output is correct
12 Incorrect 1 ms 1356 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1356 KB Output is correct
2 Correct 1 ms 1440 KB Output is correct
3 Correct 1 ms 1356 KB Output is correct
4 Correct 1 ms 1356 KB Output is correct
5 Correct 1 ms 1464 KB Output is correct
6 Correct 1 ms 1356 KB Output is correct
7 Correct 1 ms 1468 KB Output is correct
8 Correct 1 ms 1464 KB Output is correct
9 Correct 1 ms 1460 KB Output is correct
10 Correct 1 ms 1356 KB Output is correct
11 Correct 1 ms 1356 KB Output is correct
12 Incorrect 1 ms 1356 KB Output isn't correct
13 Halted 0 ms 0 KB -