結果
問題 | No.808 Kaiten Sushi? |
ユーザー | mkawa2 |
提出日時 | 2022-03-03 09:33:13 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,192 bytes |
コンパイル時間 | 274 ms |
コンパイル使用メモリ | 86,948 KB |
実行使用メモリ | 116,392 KB |
最終ジャッジ日時 | 2023-09-24 06:17:08 |
合計ジャッジ時間 | 14,631 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 78 ms
71,564 KB |
testcase_01 | AC | 74 ms
71,472 KB |
testcase_02 | AC | 75 ms
71,668 KB |
testcase_03 | AC | 73 ms
71,512 KB |
testcase_04 | AC | 75 ms
71,304 KB |
testcase_05 | AC | 74 ms
71,264 KB |
testcase_06 | AC | 74 ms
71,516 KB |
testcase_07 | AC | 90 ms
76,620 KB |
testcase_08 | AC | 91 ms
76,944 KB |
testcase_09 | AC | 155 ms
79,044 KB |
testcase_10 | AC | 129 ms
79,048 KB |
testcase_11 | WA | - |
testcase_12 | AC | 137 ms
78,792 KB |
testcase_13 | AC | 133 ms
78,984 KB |
testcase_14 | AC | 99 ms
76,968 KB |
testcase_15 | AC | 152 ms
79,176 KB |
testcase_16 | WA | - |
testcase_17 | AC | 111 ms
78,044 KB |
testcase_18 | AC | 95 ms
75,908 KB |
testcase_19 | AC | 87 ms
75,804 KB |
testcase_20 | AC | 93 ms
75,908 KB |
testcase_21 | AC | 90 ms
75,924 KB |
testcase_22 | AC | 93 ms
75,928 KB |
testcase_23 | AC | 126 ms
97,108 KB |
testcase_24 | AC | 119 ms
91,644 KB |
testcase_25 | AC | 126 ms
98,196 KB |
testcase_26 | AC | 127 ms
98,348 KB |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | AC | 385 ms
116,392 KB |
testcase_33 | AC | 302 ms
98,332 KB |
testcase_34 | AC | 324 ms
103,316 KB |
testcase_35 | AC | 336 ms
107,160 KB |
testcase_36 | AC | 299 ms
98,436 KB |
testcase_37 | AC | 75 ms
71,500 KB |
testcase_38 | AC | 75 ms
71,124 KB |
testcase_39 | AC | 321 ms
107,632 KB |
testcase_40 | AC | 179 ms
83,904 KB |
testcase_41 | AC | 235 ms
86,088 KB |
testcase_42 | AC | 312 ms
105,432 KB |
testcase_43 | AC | 263 ms
87,860 KB |
testcase_44 | AC | 262 ms
96,872 KB |
testcase_45 | AC | 265 ms
87,784 KB |
testcase_46 | AC | 245 ms
84,652 KB |
testcase_47 | AC | 340 ms
111,780 KB |
testcase_48 | AC | 340 ms
111,488 KB |
testcase_49 | AC | 334 ms
111,688 KB |
testcase_50 | AC | 338 ms
111,484 KB |
testcase_51 | AC | 339 ms
111,440 KB |
testcase_52 | AC | 255 ms
102,596 KB |
testcase_53 | AC | 300 ms
110,696 KB |
testcase_54 | AC | 75 ms
71,424 KB |
testcase_55 | AC | 76 ms
71,436 KB |
testcase_56 | AC | 75 ms
71,292 KB |
testcase_57 | AC | 187 ms
87,140 KB |
testcase_58 | AC | 222 ms
93,604 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 from heapq import * n, l = LI() xx = LI() yy = LI() xt = [] for x in xx: xt.append((x, 0)) for x in yy: xt.append((x, 1)) xt.sort(key=lambda x: x[0]) # print(xt) gg = [] tt = [] for x, t in xt: if not tt or tt[-1] != t: gg.append([]) tt.append(t) heappush(gg[-1], -x) # pDB(gg) # pDB(tt) if tt[0] == tt[-1]: g = gg.pop() tt.pop() for x in g: heappush(gg[0], x+l) # pDB(gg) # pDB(tt) if tt[0] == 1: tt = tt[1:]+tt[:1] gg = gg[1:]+gg[:1] # pDB(gg) # pDB(tt) log = [] ans = 0 now = 0 while gg: ngg = [] ntt = [] last = -1 for t, g in zip(tt, gg): x = -heappop(g) log.append(x) ans += (x-now)%l now = x last = t if g: if not ntt or ntt[-1] != t: ntt.append(t) ngg.append(g) else: for x in g: heappush(ngg[-1], x) # pDB(ngg) # pDB(ntt) tt, gg = ntt, ngg if tt and tt[0] == tt[-1]: if last == tt[0]: for x in gg[0]: heappush(gg[-1], x-l) gg.pop(0) tt.pop(0) else: for x in gg[-1]: heappush(gg[0], x+l) gg.pop() tt.pop() print(ans) # print(*log, sep="\n") # pre = 0 # s = 0 # for x in log: # if x < 0: x += l # if x-pre > 0: # s += x-pre # else: # s += x-pre+l # pre = x # print(s)