結果
問題 | No.1265 Balloon Survival |
ユーザー | McGregorsh |
提出日時 | 2023-05-19 21:16:38 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 1,856 bytes |
コンパイル時間 | 268 ms |
コンパイル使用メモリ | 87,084 KB |
実行使用メモリ | 167,988 KB |
最終ジャッジ日時 | 2023-08-22 23:21:16 |
合計ジャッジ時間 | 38,985 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 226 ms
92,168 KB |
testcase_01 | AC | 227 ms
92,220 KB |
testcase_02 | AC | 222 ms
92,184 KB |
testcase_03 | AC | 225 ms
92,392 KB |
testcase_04 | AC | 220 ms
92,368 KB |
testcase_05 | AC | 224 ms
92,132 KB |
testcase_06 | AC | 224 ms
92,220 KB |
testcase_07 | AC | 224 ms
92,176 KB |
testcase_08 | AC | 225 ms
92,308 KB |
testcase_09 | AC | 226 ms
92,548 KB |
testcase_10 | AC | 225 ms
92,232 KB |
testcase_11 | AC | 222 ms
92,372 KB |
testcase_12 | AC | 215 ms
92,128 KB |
testcase_13 | AC | 223 ms
92,384 KB |
testcase_14 | AC | 431 ms
102,152 KB |
testcase_15 | AC | 376 ms
100,636 KB |
testcase_16 | AC | 293 ms
95,144 KB |
testcase_17 | AC | 1,395 ms
126,168 KB |
testcase_18 | AC | 322 ms
97,108 KB |
testcase_19 | AC | 314 ms
95,512 KB |
testcase_20 | AC | 430 ms
102,196 KB |
testcase_21 | AC | 702 ms
109,564 KB |
testcase_22 | AC | 491 ms
102,928 KB |
testcase_23 | AC | 521 ms
104,960 KB |
testcase_24 | TLE | - |
testcase_25 | TLE | - |
testcase_26 | TLE | - |
testcase_27 | TLE | - |
testcase_28 | TLE | - |
testcase_29 | TLE | - |
testcase_30 | TLE | - |
testcase_31 | TLE | - |
testcase_32 | TLE | - |
testcase_33 | TLE | - |
testcase_34 | AC | 231 ms
92,864 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) heappush(que, (score, i, j)) juge = [False] * N ans = 0 while que: score, x, y = heappop(que) 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()