提出 #61601604

---

ソースコード 拡げる

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;


int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    ll n, m, a, b;
    cin>>n>>m>>a>>b;

    vector<pair<ll, ll>>ranges;
    vector<ll>covered(4*b+2);
    for(int i=0; i<m; i++) {
        ll x, y;
        cin>>x>>y;
        // x - k*a <= y-k*b => k*(b-a) <= y-x
        if(a == b) {
            x = x%a;
            y = y%b;
        }
        else {
            ll k = (y-x)/(b-a);
            k = min(k, (x-1)/a);
            x -= k*a;
            y -= k*b;
        }
        
        for(int j = max(a+1, x); j<= min(y, b+1); j++) covered[j] = 1;

        x+=a;
        y+=b;
        for(int j = max(a+1, x); j<= min(y, b+1); j++) covered[j] = 1;
    }

    bool poss = false;
    for(int i=a+1; i<=b+1; i++) if(!covered[i]) poss = true;
    if(poss) cout<<"Yes";
    else cout<<"No";
}

提出情報

ジャッジ結果