結果
| 問題 |
No.1508 Avoid being hit
|
| コンテスト | |
| ユーザー |
tamato
|
| 提出日時 | 2021-05-14 23:49:44 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
RE
|
| 実行時間 | - |
| コード長 | 2,765 bytes |
| コンパイル時間 | 463 ms |
| コンパイル使用メモリ | 82,176 KB |
| 実行使用メモリ | 379,932 KB |
| 最終ジャッジ日時 | 2024-10-02 06:14:26 |
| 合計ジャッジ時間 | 6,364 ms |
|
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 2 RE * 1 TLE * 1 -- * 39 |
ソースコード
mod = 1000000007
eps = 10**-9
def main():
import sys
import random
input = sys.stdin.readline
N, Q = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ok = [1] * (N+2)
ok[0] = ok[-1] = 0
st = set()
snapshot = [None] * Q
for i in range(Q-1, -1, -1):
a, b = A[i], B[i]
st_new = set()
for v in st:
flg = ok[v-1] | ok[v] | ok[v+1]
if flg:
ok[v] = 1
if ok[v-1] == 0 and v-1 != 0:
st_new.add(v-1)
if ok[v+1] == 0 and v+1 != N+1:
st_new.add(v+1)
st = st_new
st.add(a)
st.add(b)
ok[a] = ok[b] = 0
if i % 100 == 0 and i != 0:
snapshot[i] = ok[:]
if sum(ok) == 0:
print("NO")
else:
print("YES")
ans = []
v0 = []
for v in range(1, N+1):
if ok[v]:
v0.append(v)
v = v0[len(v0) // 2]
ans.append(v)
t = 0
while True:
t0 = t
if t0 == 0:
v = random.sample(v0, 1)[0]
ans = [v]
ok_flg = 1
for _ in range(100):
if len(ans) == Q + 1:
break
a, b = A[t], B[t]
if v == 1:
R = [2, 1]
elif v == N:
R = [0, 1]
elif v == 2:
if random.randint(0, 9) < 8:
R = [2, 1, 0]
else:
R = random.sample(range(3), k=3)
elif v == N-1:
if random.randint(0, 9) < 8:
R = [0, 1, 2]
else:
R = random.sample(range(3), k=3)
else:
R = random.sample(range(3), k=3)
flg = 0
for r in R:
u = v + r - 1
if u != a and u != b and u != 0 and u != N+1:
flg = 1
ans.append(u)
v = u
break
if not flg:
ok_flg = 0
break
t += 1
if len(ans) == Q+1:
break
if not ok_flg:
while len(ans) > t0 + 1:
ans.pop()
t = t0
else:
if snapshot[t0 // 100 + 1][v] == 0:
while len(ans) > t0 + 1:
ans.pop()
t = t0
print(*ans, sep="\n")
if __name__ == '__main__':
main()
tamato