結果
問題 | No.2376 障害物競プロ |
ユーザー | mkawa2 |
提出日時 | 2023-07-08 11:19:16 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 3,389 bytes |
コンパイル時間 | 950 ms |
コンパイル使用メモリ | 87,308 KB |
実行使用メモリ | 97,176 KB |
最終ジャッジ日時 | 2023-10-05 21:57:56 |
合計ジャッジ時間 | 91,296 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 68 ms
71,576 KB |
testcase_01 | AC | 72 ms
71,796 KB |
testcase_02 | AC | 73 ms
72,016 KB |
testcase_03 | AC | 72 ms
71,944 KB |
testcase_04 | AC | 373 ms
79,948 KB |
testcase_05 | AC | 648 ms
84,636 KB |
testcase_06 | AC | 559 ms
85,456 KB |
testcase_07 | AC | 943 ms
86,800 KB |
testcase_08 | AC | 925 ms
86,736 KB |
testcase_09 | AC | 894 ms
86,532 KB |
testcase_10 | AC | 926 ms
87,404 KB |
testcase_11 | AC | 1,060 ms
89,952 KB |
testcase_12 | AC | 1,020 ms
92,320 KB |
testcase_13 | AC | 907 ms
87,988 KB |
testcase_14 | AC | 950 ms
87,100 KB |
testcase_15 | AC | 918 ms
87,124 KB |
testcase_16 | AC | 937 ms
86,488 KB |
testcase_17 | AC | 1,125 ms
94,308 KB |
testcase_18 | AC | 1,088 ms
91,428 KB |
testcase_19 | TLE | - |
testcase_20 | AC | 3,799 ms
97,176 KB |
testcase_21 | AC | 3,778 ms
95,656 KB |
testcase_22 | AC | 917 ms
86,516 KB |
testcase_23 | AC | 705 ms
85,724 KB |
testcase_24 | AC | 312 ms
78,184 KB |
testcase_25 | AC | 389 ms
82,692 KB |
testcase_26 | AC | 335 ms
78,536 KB |
testcase_27 | AC | 526 ms
83,532 KB |
testcase_28 | AC | 582 ms
85,300 KB |
testcase_29 | AC | 450 ms
85,400 KB |
testcase_30 | AC | 604 ms
86,356 KB |
testcase_31 | AC | 534 ms
84,800 KB |
testcase_32 | AC | 389 ms
84,796 KB |
testcase_33 | AC | 477 ms
86,640 KB |
testcase_34 | AC | 481 ms
85,876 KB |
testcase_35 | AC | 158 ms
78,268 KB |
testcase_36 | AC | 759 ms
86,920 KB |
testcase_37 | AC | 766 ms
88,224 KB |
testcase_38 | AC | 504 ms
85,576 KB |
testcase_39 | AC | 808 ms
87,056 KB |
testcase_40 | AC | 618 ms
87,904 KB |
testcase_41 | AC | 474 ms
85,172 KB |
testcase_42 | AC | 3,123 ms
90,544 KB |
testcase_43 | AC | 3,118 ms
88,628 KB |
ソースコード
import sys # sys.setrecursionlimit(200005) # sys.set_int_max_str_digits(1000005) 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 # md = 10**9+7 md = 998244353 def ccw(s, t, p): x1 = p[0]-s[0] y1 = p[1]-s[1] x2 = t[0]-s[0] y2 = t[1]-s[1] if x1*y2-x2*y1 > 0: return 1 if x1*y2-x2*y1 < 0: return -1 if x1*x2+y1*y2 < 0: return -2 if x1**2+y1**2 > x2**2+y2**2: return 2 return False # 共有点の有無のみ def common_point(a, b, s, t): cc = [] cc.append(ccw(a, b, s)) cc.append(ccw(a, b, t)) cc.append(ccw(s, t, a)) cc.append(ccw(s, t, b)) if any(c == 0 for c in cc): return True if any(abs(c) == 2 for c in cc): return False if cc[0] == cc[1] or cc[2] == cc[3]: return False return True # co = 10**10 n, m = LI() xy, st = [], [] for _ in range(n): x, y, s, t = LI() # xy.append((x*co, y*co)) # st.append((s*co, t*co)) xy.append((x, y)) st.append((s, t)) dist = [[inf]*2*n for _ in range(2*n)] def can(a, b, i, j): for k in range(n): if k == i or k == j: continue if common_point(a, b, xy[k], st[k]): return False return True for i in range(n): dist[i*2][i*2] = 0 dist[i*2+1][i*2+1] = 0 if can(xy[i], st[i], i, i): x, y = xy[i] s, t = st[i] # dist[i*2][i*2+1] = dist[i*2+1][i*2] = round(((s-x)**2+(t-y)**2)**0.5) dist[i*2][i*2+1] = dist[i*2+1][i*2] = ((s-x)**2+(t-y)**2)**0.5 for j in range(i): if can(xy[i], xy[j], i, j): x, y = xy[i] s, t = xy[j] # dist[i*2][j*2] = dist[j*2][i*2] = round(((s-x)**2+(t-y)**2)**0.5) dist[i*2][j*2] = dist[j*2][i*2] = ((s-x)**2+(t-y)**2)**0.5 if can(xy[i], st[j], i, j): x, y = xy[i] s, t = st[j] # dist[i*2][j*2+1] = dist[j*2+1][i*2] = round(((s-x)**2+(t-y)**2)**0.5) dist[i*2][j*2+1] = dist[j*2+1][i*2] = ((s-x)**2+(t-y)**2)**0.5 if can(st[i], xy[j], i, j): x, y = st[i] s, t = xy[j] # dist[i*2+1][j*2] = dist[j*2][i*2+1] = round(((s-x)**2+(t-y)**2)**0.5) dist[i*2+1][j*2] = dist[j*2][i*2+1] = ((s-x)**2+(t-y)**2)**0.5 if can(st[i], st[j], i, j): x, y = st[i] s, t = st[j] # dist[i*2+1][j*2+1] = dist[j*2+1][i*2+1] = round(((s-x)**2+(t-y)**2)**0.5) dist[i*2+1][j*2+1] = dist[j*2+1][i*2+1] = ((s-x)**2+(t-y)**2)**0.5 # p2D(dist) for j in range(n*2): for i in range(n*2): ij = dist[i][j] if ij == inf: continue for k in range(n*2): jk = dist[j][k] if jk == inf: continue dist[i][k] = min(dist[i][k], ij+jk) for _ in range(m): i, b, j, d = LI1() ans = dist[i*2+b][j*2+d] # print(ans/co) print(ans)