結果
問題 | No.953 席 |
ユーザー | mkawa2 |
提出日時 | 2021-03-30 18:14:35 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,834 ms / 2,000 ms |
コード長 | 1,976 bytes |
コンパイル時間 | 301 ms |
コンパイル使用メモリ | 87,064 KB |
実行使用メモリ | 139,860 KB |
最終ジャッジ日時 | 2023-08-20 14:32:57 |
合計ジャッジ時間 | 33,346 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 94 ms
71,412 KB |
testcase_01 | AC | 95 ms
71,668 KB |
testcase_02 | AC | 899 ms
108,168 KB |
testcase_03 | AC | 793 ms
104,564 KB |
testcase_04 | AC | 889 ms
106,936 KB |
testcase_05 | AC | 587 ms
100,420 KB |
testcase_06 | AC | 888 ms
108,920 KB |
testcase_07 | AC | 1,198 ms
115,124 KB |
testcase_08 | AC | 1,773 ms
126,716 KB |
testcase_09 | AC | 1,103 ms
110,648 KB |
testcase_10 | AC | 579 ms
91,076 KB |
testcase_11 | AC | 1,415 ms
117,456 KB |
testcase_12 | AC | 1,492 ms
123,888 KB |
testcase_13 | AC | 1,796 ms
128,748 KB |
testcase_14 | AC | 1,330 ms
119,908 KB |
testcase_15 | AC | 1,305 ms
119,632 KB |
testcase_16 | AC | 1,327 ms
117,544 KB |
testcase_17 | AC | 1,436 ms
129,224 KB |
testcase_18 | AC | 1,357 ms
124,716 KB |
testcase_19 | AC | 1,797 ms
139,860 KB |
testcase_20 | AC | 1,390 ms
127,180 KB |
testcase_21 | AC | 1,050 ms
113,260 KB |
testcase_22 | AC | 1,458 ms
124,172 KB |
testcase_23 | AC | 1,109 ms
113,424 KB |
testcase_24 | AC | 1,147 ms
115,272 KB |
testcase_25 | AC | 1,834 ms
129,016 KB |
testcase_26 | AC | 486 ms
98,624 KB |
ソースコード
import sys sys.setrecursionlimit(10**6) int1 = lambda x: int(x)-1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.buffer.readline()) def LI(): return list(map(int, sys.stdin.buffer.readline().split())) def LI1(): return list(map(int1, sys.stdin.buffer.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def BI(): return sys.stdin.buffer.readline().rstrip() def SI(): return sys.stdin.buffer.readline().rstrip().decode() # 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 = 10**16 # md = 998244353 md = 10**9+7 from heapq import * from collections import deque n, k1, k2 = LI() seat = [-1]*(n+2) ent = (k1*2+k2)/3 vac = [] for j in range(1, n+1): heappush(vac, (0, abs(j-ent), j)) wait = deque() outin = [] q = II() ans = [-1]*q bb = [-1]*q for i in range(q): a, b = LI() bb[i] = b heappush(outin, (a, 1, i)) while outin: t, op, i = heappop(outin) if op: wait.append(i) else: j = i i = seat[j] seat[j] = -1 if seat[j-1] == -1 and seat[j+1] == -1: heappush(vac, (0, abs(j-ent), j)) else: heappush(vac, (1, abs(j-ent), j)) if j-1 >= 1 and seat[j-1] == -1 and seat[j-2] == -1: heappush(vac, (0, abs(j-1-ent), j-1)) if j+1 <= n and seat[j+1] == -1 and seat[j+2] == -1: heappush(vac, (0, abs(j+1-ent), j+1)) if outin and t == outin[0][0]: continue while wait and vac: side, d, j = heappop(vac) if seat[j] != -1: continue if side == 0 and (seat[j-1] != -1 or seat[j+1] != -1): heappush(vac, (1, d, j)) continue i = wait.popleft() seat[j] = i ans[i] = j heappush(outin, (t+bb[i], 0, j)) # print(t, seat, wait, outin) print(*ans, sep="\n")