Submission #2228341


Source Code Expand

#include <numeric>
#include<iostream>
#include<set>
#include<queue>
#include<vector>
#include<map>
#include<stack>
#include<algorithm>
#include <sstream>
#include<string.h>
#include <cmath>
#include <iomanip>
using namespace std;
#define inf 1000000007
#define int long long
#define rep(i,j,n) for(int i=j;i<n;i++)
typedef pair<int,int>  P;
struct edge{int from,to,cost;};
double pi = 3.141592653589793;
//使うやつはここから下に置こうな
signed main(){
    int n,x;cin>>n>>x;
    int a[114514];
    rep(i,0,n)cin>>a[i];
    int ans=0;
    rep(i,0,n-1){
        if(a[i]+a[i+1]>=x){
            if(a[i]>x){
                ans+=a[i+1]+a[i]-x;
                a[i+1]=0;
                a[i]=x;
            }
            else {
                ans+=a[i+1]+a[i]-x;
                a[i+1]=x-a[i];
            }
        }
    }
    cout<<ans<<endl;
    return 0;
}

Submission Info

Submission Time
Task C - Boxes and Candies
User birdway
Language C++14 (GCC 5.4.1)
Score 300
Code Size 911 Byte
Status AC
Exec Time 44 ms
Memory 1024 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 1024 KB
1_05.txt AC 17 ms 1024 KB
1_06.txt AC 44 ms 1024 KB
1_07.txt AC 43 ms 1024 KB
1_08.txt AC 40 ms 1024 KB
1_09.txt AC 40 ms 1024 KB
1_10.txt AC 40 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