結果

問題 No.1265 Balloon Survival
ユーザー Coki628
提出日時 2020-12-05 01:57:29
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,134 ms / 2,000 ms
コード長 1,247 bytes
コンパイル時間 353 ms
コンパイル使用メモリ 81,920 KB
実行使用メモリ 148,420 KB
最終ジャッジ日時 2024-09-15 09:54:23
合計ジャッジ時間 15,477 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge6
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 32
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import sys
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for k in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10**9)
INF = 10**19
MOD = 10**9 + 7
EPS = 10**-10
N = INT()
XY = [()] * N
for i in range(N):
    x, y = MAP()
    XY[i] = (x, y)
edges = []
for i, (x, y) in enumerate(XY):
    for j, (x2, y2) in enumerate(XY[i+1:], i+1):
        dist = (x-x2)**2 + (y-y2)**2
        edges.append((dist, i, j))
edges.sort(key=itemgetter(0))
removed = [0] * N
ans = 0
for dist, a, b in edges:
    if removed[a] or removed[b]:
        continue
    if a == 0:
        ans += 1
        removed[b] = 1
    elif b == 0:
        ans += 1
        removed[a] = 1
    else:
        removed[a] = 1
        removed[b] = 1
print(ans)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0