結果

問題 No.2024 Xer
ユーザー siganaisiganai
提出日時 2022-07-29 23:02:11
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 5,097 bytes
コンパイル時間 167 ms
コンパイル使用メモリ 82,456 KB
実行使用メモリ 198,508 KB
最終ジャッジ日時 2024-07-19 16:22:14
合計ジャッジ時間 16,630 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 66 ms
68,248 KB
testcase_01 AC 63 ms
68,880 KB
testcase_02 AC 63 ms
68,984 KB
testcase_03 AC 62 ms
68,828 KB
testcase_04 WA -
testcase_05 AC 61 ms
68,384 KB
testcase_06 AC 61 ms
69,440 KB
testcase_07 AC 655 ms
196,916 KB
testcase_08 AC 588 ms
198,508 KB
testcase_09 AC 731 ms
122,924 KB
testcase_10 AC 563 ms
189,400 KB
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 AC 299 ms
93,892 KB
testcase_18 WA -
testcase_19 WA -
testcase_20 AC 537 ms
106,172 KB
testcase_21 AC 833 ms
123,816 KB
testcase_22 AC 800 ms
123,716 KB
testcase_23 AC 784 ms
123,156 KB
testcase_24 AC 847 ms
122,812 KB
testcase_25 AC 86 ms
78,036 KB
testcase_26 AC 121 ms
79,128 KB
testcase_27 WA -
testcase_28 WA -
testcase_29 AC 101 ms
79,548 KB
testcase_30 AC 114 ms
79,476 KB
testcase_31 AC 134 ms
79,192 KB
testcase_32 WA -
testcase_33 AC 118 ms
79,508 KB
testcase_34 AC 85 ms
77,856 KB
testcase_35 AC 60 ms
69,624 KB
testcase_36 AC 113 ms
79,396 KB
testcase_37 AC 126 ms
79,720 KB
testcase_38 AC 117 ms
79,608 KB
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 AC 112 ms
79,816 KB
testcase_43 WA -
testcase_44 WA -
testcase_45 AC 571 ms
118,768 KB
testcase_46 AC 193 ms
83,012 KB
testcase_47 AC 481 ms
107,940 KB
testcase_48 AC 56 ms
68,396 KB
testcase_49 WA -
testcase_50 AC 58 ms
68,516 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#!/usr/bin/env PyPy3

from collections import Counter, defaultdict, deque
import itertools
import re
import math
from functools import reduce
import operator
import bisect
from heapq import *
import functools
mod=998244353

import sys
input=sys.stdin.readline
from bisect import bisect_left, bisect_right, insort
from typing import Generic, Iterable, Iterator, TypeVar, Union, List
T = TypeVar('T')
class SortedMultiset(Generic[T]):
    BUCKET_RATIO = 50
    REBUILD_RATIO = 170

    def _build(self, a=None) -> None:
        "Evenly divide `a` into buckets."
        if a is None: a = list(self)
        size = self.size = len(a)
        bucket_size = int(math.ceil(math.sqrt(size / self.BUCKET_RATIO)))
        self.a = [a[size * i // bucket_size : size * (i + 1) // bucket_size] for i in range(bucket_size)]
    
    def __init__(self, a: Iterable[T] = []) -> None:
        "Make a new SortedMultiset from iterable. / O(N) if sorted / O(N log N)"
        a = list(a)
        if not all(a[i] <= a[i + 1] for i in range(len(a) - 1)):
            a = sorted(a)
        self._build(a)

    def __iter__(self) -> Iterator[T]:
        for i in self.a:
            for j in i: yield j

    def __reversed__(self) -> Iterator[T]:
        for i in reversed(self.a):
            for j in reversed(i): yield j
    
    def __len__(self) -> int:
        return self.size
    
    def __repr__(self) -> str:
        return "SortedMultiset" + str(self.a)
    
    def __str__(self) -> str:
        s = str(list(self))
        return "{" + s[1 : len(s) - 1] + "}"

    def _find_bucket(self, x: T) -> List[T]:
        "Find the bucket which should contain x. self must not be empty."
        for a in self.a:
            if x <= a[-1]: return a
        return a

    def __contains__(self, x: T) -> bool:
        if self.size == 0: return False
        a = self._find_bucket(x)
        i = bisect_left(a, x)
        return i != len(a) and a[i] == x

    def count(self, x: T) -> int:
        "Count the number of x."
        return self.index_right(x) - self.index(x)

    def add(self, x: T) -> None:
        "Add an element. / O(√N)"
        if self.size == 0:
            self.a = [[x]]
            self.size = 1
            return
        a = self._find_bucket(x)
        insort(a, x)
        self.size += 1
        if len(a) > len(self.a) * self.REBUILD_RATIO:
            self._build()

    def discard(self, x: T) -> bool:
        "Remove an element and return True if removed. / O(√N)"
        if self.size == 0: return False
        a = self._find_bucket(x)
        i = bisect_left(a, x)
        if i == len(a) or a[i] != x: return False
        a.pop(i)
        self.size -= 1
        if len(a) == 0: self._build()
        return True

    def lt(self, x: T) -> Union[T, None]:
        "Find the largest element < x, or None if it doesn't exist."
        for a in reversed(self.a):
            if a[0] < x:
                return a[bisect_left(a, x) - 1]

    def le(self, x: T) -> Union[T, None]:
        "Find the largest element <= x, or None if it doesn't exist."
        for a in reversed(self.a):
            if a[0] <= x:
                return a[bisect_right(a, x) - 1]

    def gt(self, x: T) -> Union[T, None]:
        "Find the smallest element > x, or None if it doesn't exist."
        for a in self.a:
            if a[-1] > x:
                return a[bisect_right(a, x)]

    def ge(self, x: T) -> Union[T, None]:
        "Find the smallest element >= x, or None if it doesn't exist."
        for a in self.a:
            if a[-1] >= x:
                return a[bisect_left(a, x)]
    
    def __getitem__(self, x: int) -> T:
        "Return the x-th element, or IndexError if it doesn't exist."
        if x < 0: x += self.size
        if x < 0: raise IndexError
        for a in self.a:
            if x < len(a): return a[x]
            x -= len(a)
        raise IndexError

    def index(self, x: T) -> int:
        "Count the number of elements < x."
        ans = 0
        for a in self.a:
            if a[-1] >= x:
                return ans + bisect_left(a, x)
            ans += len(a)
        return ans

    def index_right(self, x: T) -> int:
        "Count the number of elements <= x."
        ans = 0
        for a in self.a:
            if a[-1] > x:
                return ans + bisect_right(a, x)
            ans += len(a)
        return ans
n,x = map(int,input().split())
a = list(map(int,input().split()))
ms1 = SortedMultiset(a)
ms2 = SortedMultiset([a[i] ^ x for i in range(n)])
fn = 0
now = -1
cnt = 0
li = []
while cnt < n:
    cnt += 1
    if fn:
        if now >= ms2[-1]:
            print('No')
            exit()
        tmp = ms2.gt(now)
        now = tmp
        ms2.discard(tmp)
        ms1.discard(tmp ^ x)
        li.append(tmp ^ x)
    else:
        if now >= ms1[-1]:
            print('No')
            exit()
        tmp = ms1.gt(now)
        now = tmp
        ms1.discard(tmp)
        ms2.discard(tmp ^ x)
        li.append(tmp ^ x)
    fn ^= 1
for i in range(1,n):
    if li[i] <= li[i-1]:
        print('No')
        exit()
print('Yes')
0