結果

問題 No.2024 Xer
ユーザー 👑 deuteridayodeuteridayo
提出日時 2022-07-31 16:00:39
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 92 ms / 2,000 ms
コード長 2,570 bytes
コンパイル時間 4,381 ms
コンパイル使用メモリ 236,280 KB
実行使用メモリ 7,956 KB
最終ジャッジ日時 2023-09-28 04:08:18
合計ジャッジ時間 7,558 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,352 KB
testcase_01 AC 1 ms
4,352 KB
testcase_02 AC 1 ms
4,356 KB
testcase_03 AC 1 ms
4,352 KB
testcase_04 AC 1 ms
4,352 KB
testcase_05 AC 1 ms
4,380 KB
testcase_06 AC 2 ms
4,356 KB
testcase_07 AC 71 ms
7,728 KB
testcase_08 AC 69 ms
7,904 KB
testcase_09 AC 88 ms
7,772 KB
testcase_10 AC 78 ms
7,956 KB
testcase_11 AC 28 ms
4,732 KB
testcase_12 AC 48 ms
5,796 KB
testcase_13 AC 54 ms
5,980 KB
testcase_14 AC 85 ms
7,560 KB
testcase_15 AC 38 ms
4,920 KB
testcase_16 AC 60 ms
6,368 KB
testcase_17 AC 34 ms
4,948 KB
testcase_18 AC 33 ms
4,652 KB
testcase_19 AC 85 ms
7,712 KB
testcase_20 AC 52 ms
5,712 KB
testcase_21 AC 91 ms
7,792 KB
testcase_22 AC 91 ms
7,780 KB
testcase_23 AC 92 ms
7,824 KB
testcase_24 AC 90 ms
7,776 KB
testcase_25 AC 2 ms
4,352 KB
testcase_26 AC 4 ms
4,352 KB
testcase_27 AC 2 ms
4,356 KB
testcase_28 AC 2 ms
4,352 KB
testcase_29 AC 2 ms
4,356 KB
testcase_30 AC 3 ms
4,356 KB
testcase_31 AC 4 ms
4,356 KB
testcase_32 AC 4 ms
4,356 KB
testcase_33 AC 2 ms
4,356 KB
testcase_34 AC 2 ms
4,356 KB
testcase_35 AC 1 ms
4,352 KB
testcase_36 AC 3 ms
4,356 KB
testcase_37 AC 3 ms
4,352 KB
testcase_38 AC 4 ms
4,352 KB
testcase_39 AC 2 ms
4,356 KB
testcase_40 AC 2 ms
4,360 KB
testcase_41 AC 2 ms
4,352 KB
testcase_42 AC 3 ms
4,352 KB
testcase_43 AC 2 ms
4,352 KB
testcase_44 AC 3 ms
4,360 KB
testcase_45 AC 71 ms
6,920 KB
testcase_46 AC 18 ms
4,356 KB
testcase_47 AC 55 ms
5,740 KB
testcase_48 AC 2 ms
4,352 KB
testcase_49 AC 2 ms
4,356 KB
testcase_50 AC 2 ms
4,360 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
using lint = long long;
using ulint = unsigned long long;
#define endl '\n'
int const INF = 1<<30;
lint const INF64 = 1LL<<61;
// lint const mod = 1e9+7;
long const mod = 998244353;
lint ceilDiv(lint x, lint y){if(x >= 0){return (x+y-1)/y;}else{return x/y;}}
lint floorDiv(lint x, lint y){if(x >= 0){return x/y;}else{return (x-y+1)/y;}}
lint Sqrt(lint x){lint upper = 1e9;lint lower = 0;while(upper - lower > 0){lint mid = (1+upper + lower)/2;if(mid * mid > x){upper = mid-1;}else{lower = mid;}}return upper;}
lint gcd(lint a,lint b){if(a<b)swap(a,b);if(a%b==0)return b;else return gcd(b,a%b);}
lint lcm(lint a,lint b){return (a / gcd(a,b)) * b;}
lint chmin(vector<lint>&v){lint ans = INF64;for(lint i:v){ans = min(ans, i);}return ans;}
lint chmax(vector<lint>&v){lint ans = -INF64;for(lint i:v){ans = max(ans, i);}return ans;}
double dist(double x1, double y1, double x2, double y2){return sqrt(pow(x1-x2, 2) + pow(y1-y2,2));}
string toString(lint n){string ans = "";if(n == 0){ans += "0";}else{while(n > 0){int a = n%10;char b = '0' + a;string c = "";c += b;n /= 10;ans = c + ans;}}return ans;}
string toString(lint n, lint k){string ans = toString(n);string tmp = "";while(ans.length() + tmp.length() < k){tmp += "0";}return tmp + ans;}
vector<lint>prime;void makePrime(lint n){prime.push_back(2);for(lint i=3;i<=n;i+=2){bool chk = true;for(lint j=0;j<prime.size() && prime[j]*prime[j] <= i;j++){if(i % prime[j]==0){chk=false;break;}}if(chk)prime.push_back(i);}}
lint kai[20000001]; bool firstCallnCr = true; 
lint ncrmodp(lint n,lint r,lint p){ if(firstCallnCr){ kai[0] = 1; for(int i=1;i<=20000000;i++){ kai[i] = kai[i-1] * i; kai[i] %= mod;} firstCallnCr = false;} if(n<0)return 0;
if(n < r)return 0;if(n==0)return 1;lint ans = kai[n];lint tmp = (kai[r] * kai[n-r]) % p;for(lint i=1;i<=p-2;i*=2){if(i & p-2){ans *= tmp;ans %= p;}tmp *= tmp;tmp %= p;}return ans;}


struct edge{
    int to;
};
using graph = vector<vector<edge>>;

int main(){
    int n,x;
    cin >> n >> x;
    lint a[n];
    vector<pair<lint,int>>b(n);
    for(int i = 0; i < n; i++) {
        cin >> a[i];
        b[i] = {min(a[i], a[i]^x), i};
    }
    sort(b.begin(), b.end());
    bool chk = true;
    for(int i = 0; i < n-1; i++) {
        int i1 = b[i].second;
        int i2 = b[i+1].second;
        if((a[i1] <(a[i2] ^ x)) && ((a[i1]^x) < a[i2] )) {
            continue;
        } else {
            chk = false;
            break;
        }
    }
    cout << (chk ? "Yes" : "No") << endl;

}
0