結果

問題 No.953 席
ユーザー mkawa2mkawa2
提出日時 2021-03-30 18:14:35
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,658 ms / 2,000 ms
コード長 1,976 bytes
コンパイル時間 167 ms
コンパイル使用メモリ 82,048 KB
実行使用メモリ 138,496 KB
最終ジャッジ日時 2024-05-07 21:00:17
合計ジャッジ時間 29,537 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 46 ms
54,912 KB
testcase_01 AC 45 ms
54,528 KB
testcase_02 AC 824 ms
106,368 KB
testcase_03 AC 684 ms
101,504 KB
testcase_04 AC 757 ms
104,960 KB
testcase_05 AC 539 ms
97,792 KB
testcase_06 AC 829 ms
105,984 KB
testcase_07 AC 1,018 ms
111,232 KB
testcase_08 AC 1,536 ms
124,032 KB
testcase_09 AC 957 ms
110,208 KB
testcase_10 AC 480 ms
89,472 KB
testcase_11 AC 1,237 ms
111,488 KB
testcase_12 AC 1,334 ms
121,472 KB
testcase_13 AC 1,570 ms
126,848 KB
testcase_14 AC 1,183 ms
117,504 KB
testcase_15 AC 1,150 ms
116,736 KB
testcase_16 AC 1,171 ms
117,248 KB
testcase_17 AC 1,272 ms
127,104 KB
testcase_18 AC 1,212 ms
122,624 KB
testcase_19 AC 1,658 ms
138,496 KB
testcase_20 AC 1,257 ms
124,288 KB
testcase_21 AC 934 ms
110,848 KB
testcase_22 AC 1,308 ms
121,216 KB
testcase_23 AC 955 ms
111,104 KB
testcase_24 AC 992 ms
112,256 KB
testcase_25 AC 1,540 ms
125,824 KB
testcase_26 AC 405 ms
97,536 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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")
0