답안 #921966

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
921966	2024-02-04T15:15:23 Z	tomb	Rabbit Carrot (LMIO19_triusis)	C++17	0 / 100	1 ms	436 KB

triusis

#include<bits/stdc++.h>
#define ll long long
#define vll vector<ll>
using namespace std;

int main(){
    int n;
    ll m;
    cin >> n >> m;
    vll poles(n);
    for (int i = 0; i < n; i++) cin >> poles[i];
    ll prev = 0;
    int ans = 0;
    for (ll curr : poles){
        if (curr < prev)
            prev = curr;
        else {
            if (curr - prev > m)
                ans++, prev = prev + m;
            else prev = curr;
        }
    }
    cout << ans << endl;
}

Subtask #1

0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	Correct	0 ms	432 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	436 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Incorrect	1 ms	348 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #2

0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	Correct	0 ms	432 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	436 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Incorrect	1 ms	348 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #3

0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	Correct	0 ms	432 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	436 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Incorrect	1 ms	348 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #4

0 / 37.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	Correct	0 ms	432 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	436 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Incorrect	1 ms	348 KB	Output isn't correct
13	Halted	0 ms	0 KB	-