Submission #4027498
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int,int> pii; #define pb push_back #define mp make_pair #define rep(i,n) for(int i=0;i<(n);++i) int main(){ cin.tie(0); ios::sync_with_stdio(false); int n,x;cin >> n >> x; vector<int> a(n); rep(i,n) cin >> a.at(i); ll ans=0; rep(i,n-1){ if(a.at(i)+a.at(i+1)>x){ if(a.at(i+1)>a.at(i)+a.at(i+1)-x){ ans+=a.at(i)+a.at(i+1)-x; a.at(i+1)-=a.at(i)+a.at(i+1)-x; } else{ ans+=a.at(i+1); ans+=a.at(i)-x; a.at(i+1)=0; } } } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - Boxes and Candies |
User | rhincodon66 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 592 Byte |
Status | AC |
Exec Time | 12 ms |
Memory | 640 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 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 | 8 ms | 640 KB |
1_05.txt | AC | 7 ms | 640 KB |
1_06.txt | AC | 12 ms | 640 KB |
1_07.txt | AC | 12 ms | 640 KB |
1_08.txt | AC | 12 ms | 640 KB |
1_09.txt | AC | 12 ms | 640 KB |
1_10.txt | AC | 11 ms | 640 KB |
1_11.txt | AC | 12 ms | 640 KB |
1_12.txt | AC | 11 ms | 640 KB |
1_13.txt | AC | 11 ms | 640 KB |
1_14.txt | AC | 11 ms | 640 KB |
1_15.txt | AC | 11 ms | 640 KB |