結果
問題 | No.1265 Balloon Survival |
ユーザー | McGregorsh |
提出日時 | 2023-05-19 21:19:54 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,872 bytes |
コンパイル時間 | 349 ms |
コンパイル使用メモリ | 86,952 KB |
実行使用メモリ | 156,984 KB |
最終ジャッジ日時 | 2023-08-22 23:23:41 |
合計ジャッジ時間 | 28,490 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 215 ms
92,332 KB |
testcase_01 | AC | 219 ms
92,564 KB |
testcase_02 | AC | 215 ms
92,348 KB |
testcase_03 | AC | 219 ms
92,468 KB |
testcase_04 | AC | 219 ms
92,308 KB |
testcase_05 | AC | 221 ms
92,420 KB |
testcase_06 | AC | 218 ms
92,524 KB |
testcase_07 | AC | 217 ms
92,300 KB |
testcase_08 | AC | 218 ms
92,404 KB |
testcase_09 | AC | 224 ms
92,404 KB |
testcase_10 | AC | 222 ms
92,336 KB |
testcase_11 | AC | 222 ms
92,336 KB |
testcase_12 | AC | 220 ms
92,544 KB |
testcase_13 | AC | 223 ms
92,232 KB |
testcase_14 | AC | 360 ms
102,180 KB |
testcase_15 | AC | 314 ms
99,552 KB |
testcase_16 | AC | 256 ms
94,968 KB |
testcase_17 | AC | 978 ms
131,820 KB |
testcase_18 | AC | 274 ms
96,760 KB |
testcase_19 | AC | 261 ms
95,392 KB |
testcase_20 | AC | 358 ms
102,308 KB |
testcase_21 | AC | 541 ms
109,152 KB |
testcase_22 | AC | 404 ms
105,560 KB |
testcase_23 | AC | 432 ms
106,872 KB |
testcase_24 | AC | 1,843 ms
156,668 KB |
testcase_25 | AC | 1,839 ms
156,816 KB |
testcase_26 | AC | 1,832 ms
156,868 KB |
testcase_27 | AC | 1,843 ms
156,684 KB |
testcase_28 | AC | 1,853 ms
156,528 KB |
testcase_29 | AC | 1,854 ms
156,984 KB |
testcase_30 | AC | 1,843 ms
156,860 KB |
testcase_31 | AC | 1,830 ms
156,616 KB |
testcase_32 | AC | 1,880 ms
156,680 KB |
testcase_33 | AC | 1,819 ms
156,848 KB |
testcase_34 | AC | 216 ms
92,300 KB |
testcase_35 | WA | - |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): N = int(input()) XY = [i_list() for i in range(N)] que = [] for i in range(N-1): for j in range(i+1, N): a, b = XY[i] c, d = XY[j] score = get_distance(a, b, c, d) que.append([score, i, j]) que.sort() juge = [False] * N ans = 0 for i in range(len(que)): score, x, y = que[i] if juge[x] == False and juge[y] == False: if x == 0: ans += 1 else: juge[x] = True juge[y] = True print(ans) if __name__ == '__main__': main()