Submission #1868767


Source Code Expand

#include<bits/stdc++.h>
#define r(i,n) for(int i=0;i<n;i++)
using namespace std;
#define int long long
bool used[50];
typedef pair<int,int>P;
int n,k,a[100001];
signed main(){
  cin>>n>>k;
  int ans=0;
  r(i,n)cin>>a[i];
  if(a[0]>k)ans+=a[0]-k,a[0]=k;
  for(int i=1;i<n;i++){
    if(a[i-1]+a[i]>k){
      int t=k-a[i-1];
      ans+=a[i]-t;
      a[i]=t;
    }
  }
  cout<<ans<<endl;
}

Submission Info

Submission Time
Task C - Boxes and Candies
User c7c7
Language C++14 (GCC 5.4.1)
Score 300
Code Size 405 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 6 ms 764 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 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