C++14(g++5.4) 解法, 执行用时: 151ms, 内存消耗: 352K, 提交时间: 2018-10-10 19:21:23

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

int a, b;
int SG(int s)
{
    if (s <= b) return 0;
    if (a == 1) return s % (a+b);
    s -= b;
    s %= (a+b);
    s /= a;
    if (s <= 1) s ^= 1;
    return s;
}
int main()
{   
    int T, n;
    cin >> T;
    while (T--) {
        int s;
        int ans = 0;
        int tmp = 0;
        scanf("%d %d %d", &n, &a, &b);
        for (int i = 1; i <= n; ++i) {
            scanf("%d", &s);
            if (s >= a && s <= b)   tmp = 1;
            ans ^= SG(s);
        }
        if (tmp == 1 || ans)    cout << "Yes" << '\n';
        else    cout << "No" << '\n';
    }
    return 0;
}

C++(clang++11) 解法, 执行用时: 380ms, 内存消耗: 360K, 提交时间: 2020-12-16 19:50:43

#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define ll long long  
ll n,a,b,s,x;
bool f;
 
 
ll sg(ll x){
    x%=b+a;
    if(a==1)return x;
    if(x<a)return 0;
    if(x>=b)return 1;
    return x/a+1;
}
 
int main(){
    int t;
	cin>>t;
	while(t--){
	f=false;s=0;
     cin>>n>>a>>b;
	for(int i=0;i<n;i++){
	    cin>>x;
	    if(a<=x&&x<=b)f=true;
	    s^=sg(x);
	}
	puts(f||s?"Yes":"No");
    }
    return 0;
}