#793822 (C++17) No.2024 Xer

• 問題: No.2024 Xer
• ユーザー: akua
• 提出日時: 2022-08-29 03:51:03
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 187 ms / 2,000 ms
• コード長: 5,460 bytes
• コンパイル時間: 4,033 ms
• コンパイル使用メモリ: 196,536 KB
• 実行使用メモリ: 160,392 KB
• 最終ジャッジ日時: 2024-11-06 04:07:23
• 合計ジャッジ時間: 13,785 ms
• ジャッジサーバーID （参考情報）: judge1 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	144 ms; 159,484 KB
testcase_01	AC	144 ms; 159,552 KB
testcase_02	AC	144 ms; 159,548 KB
testcase_03	AC	143 ms; 159,424 KB
testcase_04	AC	145 ms; 159,480 KB
testcase_05	AC	145 ms; 159,428 KB
testcase_06	AC	145 ms; 159,572 KB
testcase_07	AC	183 ms; 160,288 KB
testcase_08	AC	171 ms; 160,252 KB
testcase_09	AC	184 ms; 160,392 KB
testcase_10	AC	170 ms; 160,360 KB
testcase_11	AC	157 ms; 159,820 KB
testcase_12	AC	166 ms; 160,016 KB
testcase_13	AC	169 ms; 160,036 KB
testcase_14	AC	184 ms; 160,132 KB
testcase_15	AC	161 ms; 159,828 KB
testcase_16	AC	171 ms; 159,964 KB
testcase_17	AC	161 ms; 159,736 KB
testcase_18	AC	161 ms; 159,772 KB
testcase_19	AC	183 ms; 160,284 KB
testcase_20	AC	168 ms; 159,904 KB
testcase_21	AC	185 ms; 160,244 KB
testcase_22	AC	187 ms; 160,360 KB
testcase_23	AC	186 ms; 160,388 KB
testcase_24	AC	186 ms; 160,316 KB
testcase_25	AC	143 ms; 159,456 KB
testcase_26	AC	146 ms; 159,592 KB
testcase_27	AC	142 ms; 159,484 KB
testcase_28	AC	142 ms; 159,520 KB
testcase_29	AC	143 ms; 159,556 KB
testcase_30	AC	143 ms; 159,504 KB
testcase_31	AC	143 ms; 159,484 KB
testcase_32	AC	144 ms; 159,588 KB
testcase_33	AC	143 ms; 159,460 KB
testcase_34	AC	144 ms; 159,596 KB
testcase_35	AC	146 ms; 159,556 KB
testcase_36	AC	145 ms; 159,452 KB
testcase_37	AC	142 ms; 159,544 KB
testcase_38	AC	142 ms; 159,472 KB
testcase_39	AC	141 ms; 159,468 KB
testcase_40	AC	141 ms; 159,640 KB
testcase_41	AC	143 ms; 159,508 KB
testcase_42	AC	143 ms; 159,448 KB
testcase_43	AC	142 ms; 159,452 KB
testcase_44	AC	144 ms; 159,480 KB
testcase_45	AC	166 ms; 160,060 KB
testcase_46	AC	148 ms; 159,732 KB
testcase_47	AC	159 ms; 159,928 KB
testcase_48	AC	142 ms; 159,484 KB
testcase_49	AC	142 ms; 159,540 KB
testcase_50	AC	142 ms; 159,448 KB

ソースコード

#include <atcoder/all>
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <math.h>
#include <iomanip>
using namespace std;  
using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
typedef long long ll;
typedef unsigned long long ull;
const ll inf=1e18;  
using graph = vector<vector<int> > ;
using P= pair<ll,ll>;  
using vi=vector<int>;
using vvi=vector<vi>;
using vll=vector<ll>; 
using vvll=vector<vll>;
using vp=vector<P>;
using vpp=vector<vp>;
//string T="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
//string S="abcdefghijklmnopqrstuvwxyz";
//g++ main.cpp -std=c++14 -I .  
//cout <<setprecision(20);
//cout << fixed << setprecision(10);
//cin.tie(0); ios::sync_with_stdio(false);
const double PI = acos(-1);

int vx[]={0,1,0,-1,-1,1,1,-1},vy[]={1,0,-1,0,1,1,-1,-1};
 
ll pow_pow(ll x,ll n,ll mod){
    if(n==0) return 1; 
    x%=mod;
    ll res=pow_pow(x*x%mod,n/2,mod);
    if(n&1)res=res*x%mod;
    return res;
}
 struct UnionFind { vector<int> par, siz; UnionFind(int n) : par(n, -1) , siz(n, 1) { } int root(int x) { if (par[x] == -1) return x;
        else return par[x] = root(par[x]);
    }
    bool issame(int x, int y) {
        return root(x) == root(y);
    }
    bool unite(int x, int y) {
        x = root(x), y = root(y);
        if (x == y) return false; 
        if (siz[x] < siz[y]) swap(x, y);
        par[y] = x;
        siz[x] += siz[y];
        return true;
    }
    int size(int x) {
        return siz[root(x)];
    }
};

int gcd(int x,int y){
    if(y==0)return x;
    return gcd(y,x%y);
}

ll lcm(ll x,ll y){
    return ll(x/gcd(x,y))*y;
}
 
 
 
 
template<class T> bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    else return false;
}
template<class T> bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    else return false;
}
 
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const ll mod =998244353;
struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+(const mint a) const { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }
 
  // for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
// combination mod prime
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
struct combination {
  vector<mint> fact, ifact;
  combination(int n):fact(n+1),ifact(n+1) {
    //assert(n < mod);
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n) return 0;
    return fact[n]*ifact[k]*ifact[n-k];
  }
  mint p(int n, int k) {
    return fact[n]*ifact[n-k];
  }
} c(10000050);
using vm=vector<mint> ;
using vvm=vector<vm> ;
 
 
ll sqrt_(ll x) {
  ll l = 0, r = ll(3e9)+1;
  while (l+1<r) {
    ll c = (l+r)/2;
    if (c*c <= x) l = c; else r = c;
  }
  return l;
}


int valid(int x,int y,int h,int w){
  if(x>=0 && y>=0 && x<h && y<w)return 1;
  else return 0;
}


 

ll comb[51][51];

void init_comb(){
  comb[0][0]=1;
  for(int i=1; i<=50; i++){
    for(int j=0; j<=i; j++){
      if(j==0 || j==i)comb[i][j]=1;
      else comb[i][j]=comb[i-1][j]+comb[i-1][j-1];
    }
  }
}

ll nCk(int n,int k){
  return comb[n][k];
}

struct edge{
  int to; ll cost;ll d;
  edge(int to,ll cost,ll d) : to(to),cost(cost),d(d) {}
}; 

using ve=vector<edge>;
using vve =vector<ve>;

void comp(vll&a){
  set<ll>s(a.begin(),a.end());
  int cnt=0;
  map<ll,ll>d;
  for(auto y:s)d[y]=cnt++;
  for(auto&y:a)y=d[y];
}


int main(){cin.tie(0); ios::sync_with_stdio(false);
  int n,x; cin >> n >> x;
  vi a(n);rep(i,n)cin >> a[i];
  auto f=[&](int i, int j){
    return i+(i^x)<j+(j^x);
  };
  sort(a.begin(),a.end(),f);
  int ok=1;
  rep(i,n-1){
    if(a[i]>=(a[i+1]^x))ok=0;
    if((a[i]^x)>=a[i+1])ok=0;
  }
  if(ok)cout << "Yes" << endl;
  else cout << "No" << endl;
 
}