結果
問題 | No.168 ものさし |
ユーザー | rpy3cpp |
提出日時 | 2015-05-21 12:53:20 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 164 ms / 2,000 ms |
コード長 | 1,942 bytes |
コンパイル時間 | 293 ms |
コンパイル使用メモリ | 87,336 KB |
実行使用メモリ | 87,772 KB |
最終ジャッジ日時 | 2023-08-25 20:56:59 |
合計ジャッジ時間 | 3,925 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 134 ms
79,916 KB |
testcase_01 | AC | 72 ms
71,472 KB |
testcase_02 | AC | 77 ms
71,492 KB |
testcase_03 | AC | 73 ms
71,500 KB |
testcase_04 | AC | 73 ms
71,560 KB |
testcase_05 | AC | 72 ms
71,740 KB |
testcase_06 | AC | 75 ms
71,604 KB |
testcase_07 | AC | 73 ms
71,936 KB |
testcase_08 | AC | 72 ms
71,852 KB |
testcase_09 | AC | 89 ms
76,508 KB |
testcase_10 | AC | 103 ms
77,976 KB |
testcase_11 | AC | 126 ms
80,032 KB |
testcase_12 | AC | 164 ms
85,036 KB |
testcase_13 | AC | 158 ms
87,772 KB |
testcase_14 | AC | 132 ms
84,104 KB |
testcase_15 | AC | 73 ms
71,648 KB |
testcase_16 | AC | 85 ms
76,908 KB |
testcase_17 | AC | 101 ms
77,764 KB |
testcase_18 | AC | 105 ms
78,304 KB |
testcase_19 | AC | 164 ms
87,760 KB |
testcase_20 | AC | 148 ms
87,148 KB |
testcase_21 | AC | 156 ms
87,672 KB |
testcase_22 | AC | 146 ms
87,560 KB |
ソースコード
import heapq def read_data(): N = int(input()) ps = [list(map(int, input().split())) for i in range(N)] return N, ps def solve(N, ps): dist = set_dist(ps) tick = 10 start = 0 goal = N - 1 dist_s = [dist[start][v] for v in range(N)] dist_g = [dist[goal][v] for v in range(N)] pq_s = [(dist_s[v], v) for v in range(1, N)] pq_g = [(dist_g[v], v) for v in range(0, N - 1)] heapq.heapify(pq_s) heapq.heapify(pq_g) max_scale2 = 0 found = False while not found: d_s, vs = get_next(pq_s, dist_s) d_g, vg = get_next(pq_g, dist_g) if d_s < d_g: if d_s > max_scale2: max_scale2 = d_s found = process(dist_s, dist_g, pq_s, vs, dist[vs]) else: if d_g > max_scale2: max_scale2 = d_g found = process(dist_g, dist_s, pq_g, vg, dist[vg]) return square_round(max_scale2, tick) def set_dist(ps): N = len(ps) dist = [[0] * N for v in range(N)] for i in range(N-1): x0, y0 = ps[i] for j in range(i + 1, N): x1, y1 = ps[j] d = (x0 - x1) * (x0 - x1) + (y0 - y1) * (y0 - y1) dist[i][j] = d dist[j][i] = d return dist def get_next(pq, dist_x): d, v = pq[0] while not dist_x[v]: heapq.heappop(pq) d, v = pq[0] return d, v def process(dist_0, dist_1, pq_0, v0, dist_v0): heapq.heappop(pq_0) if not dist_1[v0]: return True dist_0[v0] = 0 for new_v, (d, new_d) in enumerate(zip(dist_0, dist_v0)): if new_d < d: heapq.heappush(pq_0, (new_d, new_v)) dist_0[new_v] = new_d return False def square_round(x_sq, tick): x = x_sq ** 0.5 x_int = (int(x) // tick) * tick if x_int ** 2 < x_sq: x_int += tick return x_int if __name__ == '__main__': N, ps = read_data() print(solve(N, ps))