Submission #2230542


Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <stack>
#include <functional>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <numeric>

#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define Sort(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define vi vector<int>
#define INF (int)1e9
#define INFL 1e18
#define MOD 1000000007
#define pb push_back
#define MP make_pair
typedef long long int ll;
typedef std::pair<int,int> P;
int D=1;
int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};

using namespace std;

int main(){
    int n,x;
    cin>>n>>x;
    vector<int> v(n);
    rep(i,0,n)cin>>v[i];
    
    ll ans=0;
    rep(i,1,n){
        if(v[i-1]+v[i]>x){
            ans+=v[i-1]+v[i]-x;
            v[i]-=(v[i-1]+v[i]-x);
        }
    }
    cout<<ans<<endl;
    return 0;
}

Submission Info

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

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 4
AC × 16
WA × 4
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 640 KB
1_05.txt AC 17 ms 640 KB
1_06.txt AC 44 ms 640 KB
1_07.txt AC 44 ms 640 KB
1_08.txt AC 40 ms 640 KB
1_09.txt AC 40 ms 640 KB
1_10.txt AC 40 ms 640 KB
1_11.txt AC 40 ms 640 KB
1_12.txt WA 39 ms 640 KB
1_13.txt WA 41 ms 640 KB
1_14.txt WA 41 ms 640 KB
1_15.txt WA 41 ms 640 KB