Submission #3606631


Source Code Expand

#include <iostream>
#include <algorithm>

typedef long long ll;

using namespace std;

int main() {
    ll n, x, cnt = 0, prev = 0, now;
    cin >> n >> x;
    for (ll i = 0; i < n; ++i) {
        cin >> now;
        prev = now - max(prev + now - x, 0LL);
        cnt += now - prev;
    }
    cout << cnt << endl;
    return 0;
}

Submission Info

Submission Time
Task C - Boxes and Candies
User kyuko_haboro
Language C++14 (GCC 5.4.1)
Score 300
Code Size 348 Byte
Status AC
Exec Time 44 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 4
AC × 20
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
0_03.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 1 ms 256 KB
1_03.txt AC 1 ms 256 KB
1_04.txt AC 17 ms 256 KB
1_05.txt AC 17 ms 256 KB
1_06.txt AC 44 ms 256 KB
1_07.txt AC 44 ms 256 KB
1_08.txt AC 40 ms 256 KB
1_09.txt AC 40 ms 256 KB
1_10.txt AC 40 ms 256 KB
1_11.txt AC 40 ms 256 KB
1_12.txt AC 39 ms 256 KB
1_13.txt AC 41 ms 256 KB
1_14.txt AC 41 ms 256 KB
1_15.txt AC 40 ms 256 KB