Submission #3608422


Source Code Expand

//おまじない
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <utility>
#define INF 1e9+7
#define rep(i,m,n) for(int i=m;i<n;i++)
#define mrep(i,m,n) for(int i=m;i>n;i--)
#define NO cout<<"NO"<<endl;
#define YES cout << "YES"<<endl;
#define No cout << "No"<<endl;
#define Yes cout << "Yes"<<endl;
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;


//(int)'a'は97 (int)'A'は65 (int)'1'は49
//おまじない



int main() {
	ull a[100000];
	ull N, x;
	ull ans = 0;

	cin >> N >> x;

	rep(i, 0, N) {
		cin >> a[i];
	}

	rep(i, 0, N - 1) {
		if (a[i] > x && a[i + 1] == 0) {
			ans += a[i] - x;
		}
		else if (a[i] + a[i + 1] > x) {
			ull c = a[i + 1];
			a[i + 1] = x - a[i];
			ans += c - a[i + 1];
		}
	}

	if (a[N - 1] > x) {
		ans += a[N - 1] - x;
	}

	cout << ans << endl;


	return 0;
}

Submission Info

Submission Time
Task C - Boxes and Candies
User Atomic
Language C++14 (GCC 5.4.1)
Score 0
Code Size 925 Byte
Status WA
Exec Time 44 ms
Memory 1024 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 3
WA × 1
AC × 17
WA × 3
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 WA 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt WA 1 ms 256 KB
1_03.txt AC 1 ms 256 KB
1_04.txt AC 17 ms 1024 KB
1_05.txt AC 17 ms 1024 KB
1_06.txt WA 44 ms 1024 KB
1_07.txt AC 44 ms 1024 KB
1_08.txt AC 40 ms 1024 KB
1_09.txt AC 40 ms 1024 KB
1_10.txt AC 41 ms 1024 KB
1_11.txt AC 40 ms 1024 KB
1_12.txt AC 39 ms 1024 KB
1_13.txt AC 40 ms 1024 KB
1_14.txt AC 41 ms 1024 KB
1_15.txt AC 40 ms 1024 KB