結果

問題 No.1265 Balloon Survival
ユーザー McGregorshMcGregorsh
提出日時 2022-07-15 09:15:32
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 2,331 bytes
コンパイル時間 1,003 ms
コンパイル使用メモリ 86,736 KB
実行使用メモリ 158,940 KB
最終ジャッジ日時 2023-09-09 10:42:35
合計ジャッジ時間 15,846 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 242 ms
92,220 KB
testcase_01 AC 243 ms
92,324 KB
testcase_02 AC 249 ms
92,300 KB
testcase_03 AC 243 ms
92,256 KB
testcase_04 WA -
testcase_05 AC 243 ms
92,320 KB
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 AC 241 ms
92,288 KB
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 AC 244 ms
92,496 KB
testcase_35 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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
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())
   
   if n == 1:
   	  print(0)
   	  exit()
   
   cicle = [i_list() for i in range(n)]
   nums = [[] for i in range(n)]
   for i in range(n):
   	  point1_x, point1_y = cicle[i]
   	  for j in range(n):
   	  	  if i == j:
   	  	  	  continue
   	  	  point2_x, point2_y = cicle[j]
   	  	  score = get_distance(point1_x, point1_y, point2_x, point2_y)
   	  	  heappush(nums[i], (score, j))
   #print(nums)
   juge = [False] * n
   
   ans = 0
   while True:
   	  cou = 0
   	  for i in range(1, n):
   	  	  if juge[i] == False:
   	  	  	  kyori, num = heappop(nums[i])
   	  	  	  if num == 0:
   	  	  	  	  cou += 1
   	  	  	  	  juge[i] = True
   	  	  	  else:
   	  	  	  	  if juge[num]:
   	  	  	  	  	  cou += 1
   	  	  	  	  	  juge[i] = True
   	  	  	  	  else:
   	  	  	  	  	  heappush(nums[i], (kyori, num))
   	  if cou == 0:
   	  	  print(ans)
   	  	  #print(juge)
   	  	  exit()
   	  else:
   	  	  ans += cou
   
   
if __name__ == '__main__':
    main()
0