Submission #73260860

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int N = 200010;
ll n, k, a[N], l[N], r[N];
ll ans = 0;

int main () {
	scanf("%lld%lld", &n, &k);
	for (int i = 1; i <= n; i++)
		scanf("%lld", &a[i]);
	l[1] = a[1];
	r[n] = a[n];
	for (int i = 2; i <= n; i++)
		l[i] = max(a[i], l[i - 1] - k);
	for (int i = n - 1; i >= 1; i--) {
		r[i] = max(a[i], r[i + 1] - k);
	}
	for (int i = 1; i <= n; i++) {
		ans += max(l[i], r[i]) - a[i];
	}
	printf("%lld\n", ans);
	return 0;
}

Submission Info

Submission Time
Task C - Staircase-Shaped Flower Bed
User Timmy1224
Language C++23 (GCC 15.2.0)
Score 333
Code Size 522 Byte
Status AC
Exec Time 15 ms
Memory 8712 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 333 / 333
Status
AC × 3
AC × 75
Set Name Test Cases
Sample sample01.txt, sample02.txt, sample03.txt
All sample01.txt, sample02.txt, sample03.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt, in53.txt, in54.txt, in55.txt, in56.txt, in57.txt, in58.txt, in59.txt, in60.txt, in61.txt, in62.txt, in63.txt, in64.txt, in65.txt, in66.txt, in67.txt, in68.txt, in69.txt, in70.txt, in71.txt, in72.txt
Case Name Status Exec Time Memory
in01.txt AC 2 ms 3832 KiB
in02.txt AC 1 ms 3716 KiB
in03.txt AC 1 ms 3832 KiB
in04.txt AC 1 ms 3824 KiB
in05.txt AC 1 ms 3740 KiB
in06.txt AC 1 ms 3740 KiB
in07.txt AC 1 ms 3872 KiB
in08.txt AC 1 ms 3740 KiB
in09.txt AC 15 ms 8476 KiB
in10.txt AC 14 ms 8560 KiB
in11.txt AC 15 ms 8664 KiB
in12.txt AC 15 ms 8608 KiB
in13.txt AC 15 ms 8612 KiB
in14.txt AC 15 ms 8624 KiB
in15.txt AC 1 ms 3768 KiB
in16.txt AC 15 ms 8664 KiB
in17.txt AC 1 ms 3832 KiB
in18.txt AC 15 ms 8600 KiB
in19.txt AC 15 ms 8504 KiB
in20.txt AC 14 ms 8612 KiB
in21.txt AC 13 ms 8560 KiB
in22.txt AC 11 ms 8576 KiB
in23.txt AC 15 ms 8604 KiB
in24.txt AC 1 ms 3844 KiB
in25.txt AC 1 ms 3932 KiB
in26.txt AC 14 ms 8588 KiB
in27.txt AC 1 ms 3832 KiB
in28.txt AC 1 ms 3868 KiB
in29.txt AC 1 ms 3832 KiB
in30.txt AC 1 ms 3832 KiB
in31.txt AC 1 ms 3868 KiB
in32.txt AC 1 ms 3868 KiB
in33.txt AC 1 ms 3740 KiB
in34.txt AC 1 ms 3888 KiB
in35.txt AC 1 ms 3928 KiB
in36.txt AC 1 ms 3876 KiB
in37.txt AC 1 ms 3824 KiB
in38.txt AC 1 ms 3740 KiB
in39.txt AC 1 ms 3900 KiB
in40.txt AC 1 ms 3904 KiB
in41.txt AC 14 ms 8608 KiB
in42.txt AC 10 ms 7428 KiB
in43.txt AC 13 ms 8608 KiB
in44.txt AC 1 ms 3772 KiB
in45.txt AC 1 ms 3824 KiB
in46.txt AC 12 ms 8560 KiB
in47.txt AC 1 ms 3888 KiB
in48.txt AC 1 ms 3740 KiB
in49.txt AC 13 ms 8712 KiB
in50.txt AC 14 ms 8616 KiB
in51.txt AC 15 ms 8612 KiB
in52.txt AC 15 ms 8616 KiB
in53.txt AC 15 ms 8508 KiB
in54.txt AC 15 ms 8580 KiB
in55.txt AC 1 ms 3832 KiB
in56.txt AC 1 ms 3844 KiB
in57.txt AC 7 ms 6320 KiB
in58.txt AC 7 ms 6172 KiB
in59.txt AC 1 ms 3840 KiB
in60.txt AC 1 ms 3740 KiB
in61.txt AC 1 ms 3844 KiB
in62.txt AC 1 ms 3880 KiB
in63.txt AC 1 ms 3928 KiB
in64.txt AC 1 ms 3840 KiB
in65.txt AC 1 ms 3872 KiB
in66.txt AC 1 ms 3880 KiB
in67.txt AC 1 ms 3824 KiB
in68.txt AC 1 ms 3740 KiB
in69.txt AC 1 ms 3840 KiB
in70.txt AC 1 ms 3880 KiB
in71.txt AC 1 ms 3888 KiB
in72.txt AC 15 ms 8576 KiB
sample01.txt AC 1 ms 3824 KiB
sample02.txt AC 1 ms 3876 KiB
sample03.txt AC 1 ms 3824 KiB