結果

問題 No.1413 Dynamic Sushi
ユーザー nagiss
提出日時 2021-02-28 22:09:02
言語 PyPy3
(7.3.15)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 1,357 bytes
コンパイル時間 1,130 ms
コンパイル使用メモリ 82,344 KB
実行使用メモリ 83,368 KB
最終ジャッジ日時 2024-10-02 22:31:55
合計ジャッジ時間 55,951 ms
ジャッジサーバーID
(参考情報)
judge3 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 5 TLE * 20
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

from math import sin, cos, pi, hypot
N, W = map(int, input().split())
XYRVA = [list(map(int, input().split())) for _ in range(N)]
def calc_dist(px, py, t_start, idx_sushi):
x, y, r, v, a = XYRVA[idx_sushi]
#
ok = 0.0
ng = 1e5
for _ in range(60):
c = (ok + ng) * 0.5
t = t_start + c
rad = (v*t+a)*pi/180.0
qx = x + r * cos(rad)
qy = y + r * sin(rad)
d_sushi = hypot(qx-px, qy-py)
d_lunlun = c * W
if d_lunlun <= d_sushi:
ok = c
else:
ng = c
return t_start+ok, qx, qy
inf = 1e9
Pxy = [[(inf, 0.0, 0.0) for _ in range(N)] for _ in range(1<<N)]
for sushi in range(N):
t, x, y = calc_dist(0.0, 0.0, 0.0, sushi)
Pxy[1<<sushi][sushi] = t, x, y
# a = calc_dist(2, 0, 1, 0)
# print(a)
for s in range(1<<N):
for sushi1 in range(N):
if s >> sushi1 & 1 == 0:
continue
for sushi2 in range(N):
if s >> sushi2 & 1:
continue
t_start, px, py = Pxy[s][sushi1]
t_goal, qx, qy = calc_dist(px, py, t_start, sushi2)
if t_goal < Pxy[s|1<<sushi2][sushi2][0]:
Pxy[s|1<<sushi2][sushi2] = t_goal, qx, qy
# import numpy as np
# print(np.array(Pxy))
ans = min(t for t, _, _ in Pxy[(1<<N)-1])
print(ans)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0