답안 #376453

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
376453	2021-03-11T13:43:11 Z	gustason	Rabbit Carrot (LMIO19_triusis)	C++14	0 / 100	1 ms	492 KB

triusis

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, m;
    cin >> n >> m;
    int a[n+1];
    a[0] = 0;
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
    }

    int ans = 0;
    if (a[1] > m) {
        a[1] = m;
        ans++;
    }
    for(int i = 2; i <= n; i++) {
        if (a[i] - a[i-1] > m) {
            ans++;
//            if (i == n) break;
            if (a[i] - (a[i-2] + m) > m) {
                a[i] = a[i-1] + m;
            } else {
                a[i-1] = a[i-2] + m;
            }
        }
//        cerr << a[i] << "\n";
    }
    cout << ans;
    return 0;
}

Subtask #1

0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	0 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	316 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	492 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Incorrect	1 ms	364 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #2

0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	0 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	316 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	492 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Incorrect	1 ms	364 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #3

0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	0 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	316 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	492 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Incorrect	1 ms	364 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #4

0 / 37.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	0 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	316 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	492 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Incorrect	1 ms	364 KB	Output isn't correct
13	Halted	0 ms	0 KB	-