提出 #29119464

---

ソースコード 拡げる

// #include <atcoder/all>
// using namespace atcoder;
// using mint = modint998244353;
// using mint = modint1000000007;
#include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep2(i,k,n) for (int i = (k); i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
// using P = pair<int,int>;
using vint = vector<int>;
using vll = vector<ll>;
using vvint = vector<vector<int>>;
using vvll = vector<vector<ll>>;

// const ll INF = (ll)2e18+9;
const int INF = (int)2e9+7;
// const ll MOD = (ll)1e9+9;
template<typename T>
void chmin(T &a, T b) { a = min(a, b); }
template<typename T>
void chmax(T &a, T b) { a = max(a, b); }

template<typename T>
void print(vector<T> v) {
    int n = v.size();
    rep(i,n) {
        if (i == 0) cout << v[i];
        else cout << ' ' << v[i];
    }
    cout << endl;
}

map<P, bool> mp;
bool cal(ll a, ll s) {
    if (s == 0) return a==0;
    P p = {a,s};
    if (mp.count(p)) return mp[p];
    rep(x,2) rep(y,2) {
        // 1 bit ずつ調べていく
        if ((x&y) != (a&1)) continue;
        if ((s-(x+y)) < 0) continue;
        if ((s-(x+y))%2 != 0) continue;
        if (cal(a>>1, (s-(x+y))>>1)) return mp[p] = true;
    }
    return mp[p] = false;
}

void solve() {
    int t;
    cin >> t;
    rep(i,t) {
        ll a, s;
        cin >> a >> s;
        mp = map<P,bool>();
        if (cal(a,s)) cout << "Yes" << endl;
        else cout << "No" << endl;
    }
}

int main() {
    solve();
    return 0;
}

提出情報

ジャッジ結果