Submission #4046103
Source Code Expand
#include<iostream> #include<algorithm> #include<string> #include<cstdlib> #include<map> #include<iomanip> #include<sstream> using namespace std; int main() { long long int n, sum = 0,x,a[234567]; cin >> n >> x; for (int i = 0; i < n; i++) { cin >> a[i]; } for (int i = 1; i < n-1; i++) { if (a[i]+a[i-1]>x&&a[i]+a[i+1]>x) { sum += min(max(a[i] + a[i - 1] - x, a[i] + a[i + 1] - x), a[i]); a[i] -= min(max(a[i] + a[i - 1] - x, a[i] + a[i + 1] - x), a[i]); } } for (int i = 0; i < n-1; i++) { if (a[i]+a[i+1] > x) { sum += a[i]+a[i+1]-x; i++; } } cout << sum; }
Submission Info
Submission Time | |
---|---|
Task | C - Boxes and Candies |
User | fukubutyo |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 632 Byte |
Status | WA |
Exec Time | 44 ms |
Memory | 1024 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | ||||||
Status |
|
|
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 | 1024 KB |
1_05.txt | AC | 17 ms | 1024 KB |
1_06.txt | AC | 44 ms | 1024 KB |
1_07.txt | AC | 44 ms | 1024 KB |
1_08.txt | WA | 40 ms | 1024 KB |
1_09.txt | WA | 41 ms | 1024 KB |
1_10.txt | WA | 40 ms | 1024 KB |
1_11.txt | WA | 40 ms | 1024 KB |
1_12.txt | WA | 40 ms | 1024 KB |
1_13.txt | WA | 41 ms | 1024 KB |
1_14.txt | WA | 41 ms | 1024 KB |
1_15.txt | WA | 41 ms | 1024 KB |