Submission #51845269

---

Source Code Expand

#include <algorithm>
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
template <class T>
using ordered_set = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define fori(i,n) for(int i=0;i<n;i++)
#define int long long
#define limit LLONG_MAX
#define pi pair<int,int>
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vb vector<bool>
#define pb push_back
#define all(v) v.begin(),v.end()
#define yesi cout<<"Yes"<<'\n'
#define nosi cout<<"No"<<'\n'
#define endl '\n'
#define approx(a) fixed << setprecision(a)
#define ff first
#define ss second
template <class T> void read(vector<T> &v);
template <class F, class S> void read(pair<F, S> &p);
template <class T, size_t Z> void read(array<T, Z> &a);
template <class T> void read(T &x) {cin >> x;}
template <class R, class... T> void read(R& r, T&... t){read(r); read(t...);};
template <class T> void read(vector<T> &v) {for(auto& x : v) read(x);}
template <class F, class S> void read(pair<F, S> &p) {read(p.ff, p.ss);}
template <class T, size_t Z> void read(array<T, Z> &a) { for(auto &x : a) read(x); }

template <class F, class S> void pr(const pair<F, S> &x);
template <class T> void pr(const T &x) {cout << x;}
template <class R, class... T> void pr(const R& r, const T&... t) {pr(r); pr(t...);}
template <class F, class S> void pr(const pair<F, S> &x) {pr("{", x.ff, ", ", x.ss, "}\n");}
void ps() {pr("\n");}
template <class T> void ps(const T &x) {pr(x); ps();}
template <class T> void ps(vector<T> &v) {for(auto& x : v) pr(x, ' '); ps();}
template <class T, size_t Z> void ps(const array<T, Z> &a) { for(auto &x : a) pr(x, ' '); ps(); }
template <class F, class S> void ps(const pair<F, S> &x) {pr(x.ff, ' ', x.ss); ps();}
template <class R, class... T> void ps(const R& r,  const T &...t) {pr(r, ' '); ps(t...);}
 
int n,m,t=1,q;

void solve(){
    int a,b;
    read(n,a,b);
    vi v(n); read(v);
    int days = a+b;
    fori(i,n){
        if(v[i]>=days)v[i] = v[i]%days;
    }
    int mn=limit;
    fori(i,n)mn=min(mn, v[i]);
    // int mx=*max_element(all(v));
    fori(i,n)v[i]-=mn;
    fori(i,n)if(v[i]>=a){
        nosi; return;
    }
    yesi;
}


int32_t main(){
    ios::sync_with_stdio(false); cin.tie(0);
    // cin>>t; 
    while(t--){
        solve();
    }
}

Submission Info

Judge Result