#742917 (PyPy3) No.808 Kaiten Sushi?

提出ソース

結果

問題	No.808 Kaiten Sushi?
ユーザー	mkawa2
提出日時	2022-03-03 11:55:51
言語	PyPy3 (7.3.15)
結果	AC
実行時間	761 ms / 2,000 ms
コード長	5,337 bytes
コンパイル時間	262 ms
コンパイル使用メモリ	82,532 KB
実行使用メモリ	115,148 KB
最終ジャッジ日時	2024-07-17 08:29:47
合計ジャッジ時間	19,487 ms
ジャッジサーバーID （参考情報）	judge3 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	65 ms 68,208 KB
testcase_01	AC	62 ms 68,644 KB
testcase_02	AC	62 ms 68,216 KB
testcase_03	AC	61 ms 67,992 KB
testcase_04	AC	63 ms 69,228 KB
testcase_05	AC	64 ms 68,020 KB
testcase_06	AC	63 ms 68,016 KB
testcase_07	AC	110 ms 79,096 KB
testcase_08	AC	109 ms 79,168 KB
testcase_09	AC	144 ms 80,048 KB
testcase_10	AC	136 ms 79,664 KB
testcase_11	AC	117 ms 79,392 KB
testcase_12	AC	136 ms 79,876 KB
testcase_13	AC	129 ms 80,128 KB
testcase_14	AC	93 ms 77,924 KB
testcase_15	AC	154 ms 79,932 KB
testcase_16	AC	137 ms 80,268 KB
testcase_17	AC	98 ms 78,468 KB
testcase_18	AC	76 ms 74,040 KB
testcase_19	AC	67 ms 70,632 KB
testcase_20	AC	77 ms 73,940 KB
testcase_21	AC	70 ms 72,748 KB
testcase_22	AC	76 ms 73,956 KB
testcase_23	AC	192 ms 86,360 KB
testcase_24	AC	178 ms 84,812 KB
testcase_25	AC	225 ms 85,764 KB
testcase_26	AC	217 ms 85,684 KB
testcase_27	AC	681 ms 103,788 KB
testcase_28	AC	247 ms 82,540 KB
testcase_29	AC	667 ms 99,996 KB
testcase_30	AC	439 ms 88,180 KB
testcase_31	AC	703 ms 104,348 KB
testcase_32	AC	761 ms 109,420 KB
testcase_33	AC	462 ms 86,996 KB
testcase_34	AC	555 ms 95,372 KB
testcase_35	AC	608 ms 98,520 KB
testcase_36	AC	438 ms 87,328 KB
testcase_37	AC	61 ms 68,540 KB
testcase_38	AC	62 ms 68,612 KB
testcase_39	AC	513 ms 104,924 KB
testcase_40	AC	241 ms 81,656 KB
testcase_41	AC	235 ms 81,568 KB
testcase_42	AC	442 ms 100,216 KB
testcase_43	AC	280 ms 84,056 KB
testcase_44	AC	378 ms 94,616 KB
testcase_45	AC	303 ms 83,864 KB
testcase_46	AC	232 ms 81,504 KB
testcase_47	AC	543 ms 110,180 KB
testcase_48	AC	566 ms 109,792 KB
testcase_49	AC	538 ms 110,180 KB
testcase_50	AC	561 ms 110,180 KB
testcase_51	AC	589 ms 110,308 KB
testcase_52	AC	323 ms 99,708 KB
testcase_53	AC	407 ms 115,148 KB
testcase_54	AC	61 ms 68,128 KB
testcase_55	AC	60 ms 68,212 KB
testcase_56	AC	61 ms 69,196 KB
testcase_57	AC	215 ms 84,504 KB
testcase_58	AC	251 ms 88,288 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
md = 10**9+7
# md = 998244353

# Thanks for tatyam
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedSet.py
import math
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, TypeVar, Union, List

T = TypeVar('T')

class SortedSet(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 SortedSet from iterable. / O(N) if sorted and unique / O(N log N)"
        a = list(a)
        if not all(a[i] < a[i+1] for i in range(len(a)-1)):
            a = sorted(set(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 "SortedSet"+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 add(self, x: T) -> bool:
        "Add an element and return True if added. / O(√N)"
        if self.size == 0:
            self.a = [[x]]
            self.size = 1
            return True
        a = self._find_bucket(x)
        i = bisect_left(a, x)
        if i != len(a) and a[i] == x: return False
        a.insert(i, x)
        self.size += 1
        if len(a) > len(self.a)*self.REBUILD_RATIO:
            self._build()
        return True

    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, l = LI()
xx = SortedSet(LI())
yy = SortedSet(LI())

ans = now = xx[0]
xx.discard(xx[0])
for _ in range(n-1):
    j = yy.index(now)%len(yy)  # 一番近いお茶
    i = xx.index(yy[j])%len(xx)  # お茶後の寿司
    x = xx[i]
    j = (yy.index(x)-1)%len(yy)  # 次の寿司直前のお茶
    y = yy[j]
    ans += (y-now)%l+(x-y)%l
    xx.discard(x)
    yy.discard(y)
    now = x
    # pDB(y, x, ans)

ans += (yy[0]-now)%l

print(ans)

yukicoder

結果

テストケース

ソースコード