Submission #51850501

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
using namespace chrono;

using ull = unsigned long long;
using ll = long long;
using ld = long double;

typedef pair<int, int> pi;
typedef pair<char, int> pc;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef set<int> si;
typedef set<ll> sl;
typedef set<char> sc;

#define nl "\n"
#define mpr make_pair
#define ins insert
#define pb push_back
#define fi first
#define se second
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define f(i,n) for(ll i=0;i<n;i++)
#define fr(i,n) for(ll i=n-1;i>=0;i--)
#define fo(i,a,b) for(ll i=a;i<=b;i++)
#define frr(i,a,b) for(ll i=b;i>=a;i--)
#define fa(s,j) for(auto j: s)
#define faa(s,j) for(auto &j: s)
#define print(nums) for(ll i=0;i<nums.size();i++) cout<<nums[i]<<" "; cout<<"\n";
#define na cout<<- 1 <<'\n'

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x<<" : " << x << '\n';
#else
#define debug(x);
#endif

/*-------------------------------------------------------------------------------------*/

void arrpri(ll arr[],ll size)
{
    for(ll i=0;i<size;i++)
    {
        cout<<arr[i]<<" ";
    }
    cout<<'\n';
}

void yes()
{
    cout<<"Yes"<<'\n';
    // cout<<"Alice"<<'\n';
}

void no()
{
    cout<<"No"<<'\n';
    // cout<<"Bob"<<'\n';
}

void setpri(unordered_set<ll> s)
{
    fa(s,j)
    {
        cout<<j<<' ';
    }
    cout<<nl;
}

/*-------------------------------------------------------------------------------------*/

void solve()
{
    ll n,a,b;
    cin>>n>>a>>b;
    ll m=(a+b);
    ll d[n];
    cin>>d[0];
    ll uk=max(1-(d[0]%m),a-(d[0]%m)),lk=min(1-(d[0]%m),a-(d[0]%m));
    bool ok=true;
    fo(i,1,n-1)
    {
        cin>>d[i];
        ll uk1=max(1-(d[i]%m),a-(d[i]%m));
        ll lk1=min(1-(d[i]%m),a-(d[i]%m));
        if(uk1<lk or lk1>uk)
        {
            ok=false;
        }
        uk=min(uk1,uk);
        lk=max(lk,lk1);
    }
    if(ok) yes();
    else no();
}

/*-------------------------------------------------------------------------------------*/

int main() {

#ifndef ONLINE_JUDGE
    freopen("Input.txt", "r", stdin);
    freopen("Output.txt", "w", stdout);
    freopen("Error.txt", "w", stderr);
#endif

    fastio();

    auto start1 = high_resolution_clock::now();
    ll t=1;
    //cin>>t;
    while(t--)
    {
        solve();
    }
    auto stop1 = high_resolution_clock::now();
    auto duration = duration_cast<microseconds>(stop1 - start1);

#ifndef ONLINE_JUDGE
    cerr << "Time: " << duration . count() / 1000 << " ms" << endl;
#endif

    return 0;
}

Submission Info

Judge Result