結果
問題 | No.808 Kaiten Sushi? |
ユーザー | mkawa2 |
提出日時 | 2022-03-03 11:55:51 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 927 ms / 2,000 ms |
コード長 | 5,337 bytes |
コンパイル時間 | 870 ms |
コンパイル使用メモリ | 86,852 KB |
実行使用メモリ | 113,340 KB |
最終ジャッジ日時 | 2023-09-24 08:06:37 |
合計ジャッジ時間 | 27,495 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 166 ms
80,428 KB |
testcase_01 | AC | 168 ms
80,368 KB |
testcase_02 | AC | 166 ms
80,376 KB |
testcase_03 | AC | 167 ms
80,424 KB |
testcase_04 | AC | 166 ms
80,152 KB |
testcase_05 | AC | 166 ms
80,484 KB |
testcase_06 | AC | 169 ms
80,400 KB |
testcase_07 | AC | 214 ms
83,804 KB |
testcase_08 | AC | 215 ms
83,368 KB |
testcase_09 | AC | 250 ms
84,396 KB |
testcase_10 | AC | 242 ms
84,168 KB |
testcase_11 | AC | 222 ms
83,756 KB |
testcase_12 | AC | 235 ms
84,168 KB |
testcase_13 | AC | 228 ms
84,348 KB |
testcase_14 | AC | 192 ms
82,932 KB |
testcase_15 | AC | 253 ms
84,492 KB |
testcase_16 | AC | 234 ms
84,404 KB |
testcase_17 | AC | 198 ms
83,084 KB |
testcase_18 | AC | 184 ms
81,980 KB |
testcase_19 | AC | 180 ms
81,456 KB |
testcase_20 | AC | 184 ms
82,116 KB |
testcase_21 | AC | 175 ms
81,572 KB |
testcase_22 | AC | 182 ms
82,228 KB |
testcase_23 | AC | 300 ms
94,148 KB |
testcase_24 | AC | 283 ms
90,900 KB |
testcase_25 | AC | 332 ms
93,196 KB |
testcase_26 | AC | 338 ms
91,864 KB |
testcase_27 | AC | 803 ms
109,172 KB |
testcase_28 | AC | 367 ms
89,280 KB |
testcase_29 | AC | 790 ms
105,896 KB |
testcase_30 | AC | 555 ms
98,968 KB |
testcase_31 | AC | 834 ms
109,204 KB |
testcase_32 | AC | 927 ms
113,144 KB |
testcase_33 | AC | 562 ms
96,156 KB |
testcase_34 | AC | 666 ms
99,544 KB |
testcase_35 | AC | 737 ms
102,756 KB |
testcase_36 | AC | 544 ms
96,672 KB |
testcase_37 | AC | 165 ms
80,488 KB |
testcase_38 | AC | 165 ms
80,484 KB |
testcase_39 | AC | 632 ms
109,632 KB |
testcase_40 | AC | 354 ms
86,872 KB |
testcase_41 | AC | 345 ms
88,376 KB |
testcase_42 | AC | 551 ms
106,028 KB |
testcase_43 | AC | 393 ms
91,976 KB |
testcase_44 | AC | 498 ms
99,672 KB |
testcase_45 | AC | 409 ms
91,984 KB |
testcase_46 | AC | 340 ms
86,352 KB |
testcase_47 | AC | 652 ms
112,984 KB |
testcase_48 | AC | 674 ms
113,328 KB |
testcase_49 | AC | 647 ms
113,096 KB |
testcase_50 | AC | 672 ms
113,220 KB |
testcase_51 | AC | 714 ms
113,340 KB |
testcase_52 | AC | 430 ms
103,092 KB |
testcase_53 | AC | 523 ms
113,136 KB |
testcase_54 | AC | 167 ms
80,516 KB |
testcase_55 | AC | 166 ms
80,480 KB |
testcase_56 | AC | 168 ms
80,448 KB |
testcase_57 | AC | 323 ms
91,576 KB |
testcase_58 | AC | 368 ms
97,300 KB |
ソースコード
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)