📦 ved015 / Codeforces-solution

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133// #include<bits/stdc++.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<string>
#include<cmath>
using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<long long> vll;
typedef vector<vector<ll> > vvll;

#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define mp make_pair
#define sz(x) ((int)(x).size())
#define all(x) x.begin(),x.end()

ll gcd(ll a, ll b) {if (b > a) return gcd(b, a); if (b == 0) return a; return gcd(b, a % b);}
ll fact(ll a) { return (a <= 1) ? 1 : a * fact(a - 1); }

vll factors(int n) { vll ans; int l = sqrt(n); for (int i = 1; i <= l; i++) { if (n % i == 0){ if (n/i == i) ans.pb(i); else {ans.pb(i); ans.pb(n/i);}}} return ans;}
string DecimalToBinary(ll num){ string str; while(num){ if(num & 1) str.pb('1'); else str.pb('0'); num >>= 1; } return str; }
ll BinaryToDecimal(string num){ ll ans = 0; ll base = 1; for (int i = sz(num) - 1; i >= 0; i--) { if (num[i] == '1') ans += base; base <<= 1; } return ans; }

long long pow(long long x,long long n){
    long long ans = 1;
    while(n > 0){
        if(n & 1){
            ans = ans * x;
            n--;
        }
        else{
            x = x * x;
            n = n / 2;
        }
    }
    return ans;
}

int helper1(vll a,int k){
    int cnt = 0,idx = -1;
    for(int i = 0; i < sz(a) - 2; i++){
        if(a[i] <= k) cnt++;
        if(cnt >= ceil((i + 1)/2.0)){
            idx = i;
            break;
        }
    }
    if(idx == -1) return false;
    int len = (idx + 1);

    if(len & 1 && idx < sz(a) - 3){
        if(a[idx + 1] > k) idx++;
    }

    cnt = 0;
    for(int i = idx + 1; i < sz(a) - 1; i++){
        if(a[i] <= k) cnt++;
        if(cnt >= ceil((i - idx)/2.0)) return true;
    }
    return false;
}

int helper2(vll a,int k){
    int cnt = 0,idx = -1;
    for(int i = 0; i < sz(a) - 2; i++){
        if(a[i] <= k) cnt++;
        if(cnt >= ceil((i + 1)/2.0)){
            idx = i;
            break;
        }
    }
    if(idx == -1) return false;
    cnt = 0;
    for(int i = sz(a) - 1; i > idx + 1; i--){
        if(a[i] <= k) cnt++;
        if(cnt >= ceil((sz(a) - i)/2.0)) return true;
    }
    return false;
}

int helper3(vll a,int k){
    int cnt = 0,idx = -1;
    for(int i = sz(a) - 1; i >= 2; i--){
        if(a[i] <= k) cnt++;
        if(cnt >= ceil((sz(a) - i)/2.0)){
            idx = i;
            break;
        }
    }
    if(idx == -1) return false;
    int len = sz(a) - idx;
    if(len & 1 && idx > 3){
        if(a[idx - 1] > k) idx--;
    }
    cnt = 0;
    for(int i = idx - 1; i >= 1; i--){
        if(a[i] <= k) cnt++;
        if(cnt >= ceil((idx - i)/2.0)) return true;
    }
    return false;
}

void Vedant(){
    ll n,k;
    cin >> n >> k;

    vll a(n);
    for(auto &it : a) cin >> it;

    if(helper1(a,k) || helper2(a,k) || helper3(a,k)){
        cout << "YES" << endl;
        return;
    }
    cout << "NO" << endl;
    return;
}

int main(){
    fastio();
    int t;
    cin >> t;
    while(t--){
       Vedant();
    }
    return 0;
}