Submission #24115464


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef pair<ll,ll> Pll;
typedef pair<string,string> Pstring;
typedef pair<double,double> Pdouble;


#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define Precision13 cout << fixed << setprecision(13)
const double PI=3.14159265358979323846;
const int MAX = 510000;
const int MOD = 1000000007;
const int INF = 1<<29;
using Graph = vector<vector<ll>>;

int main(){

  ll n, x;
  cin >> n >> x;

  vector<ll> a(n+1);

  ll sum = 0;

  REP1(i,n){
    cin >> a.at(i);

    sum +=a.at(i);
    if(i%2==0){
      sum--;
    }

  }

  if(sum<=x){
    cout <<"Yes" << endl;
  }else{
    cout <<"No" << endl;
  }


}

Submission Info

Submission Time
Task B - Can you buy them all?
User takkey
Language C++ (GCC 9.2.1)
Score 200
Code Size 776 Byte
Status AC
Exec Time 7 ms
Memory 3604 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 11
Set Name Test Cases
Sample sample_00.txt, sample_01.txt, sample_02.txt
All case_00.txt, case_01.txt, case_02.txt, case_03.txt, case_04.txt, case_05.txt, case_06.txt, case_07.txt, sample_00.txt, sample_01.txt, sample_02.txt
Case Name Status Exec Time Memory
case_00.txt AC 7 ms 3556 KiB
case_01.txt AC 2 ms 3504 KiB
case_02.txt AC 2 ms 3604 KiB
case_03.txt AC 2 ms 3604 KiB
case_04.txt AC 3 ms 3496 KiB
case_05.txt AC 3 ms 3532 KiB
case_06.txt AC 2 ms 3536 KiB
case_07.txt AC 2 ms 3596 KiB
sample_00.txt AC 2 ms 3596 KiB
sample_01.txt AC 3 ms 3604 KiB
sample_02.txt AC 2 ms 3600 KiB