結果

問題 No.1265 Balloon Survival
ユーザー KeroruKeroru
提出日時 2020-10-27 00:14:15
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,178 ms / 2,000 ms
コード長 4,774 bytes
コンパイル時間 365 ms
コンパイル使用メモリ 82,448 KB
実行使用メモリ 153,008 KB
最終ジャッジ日時 2024-07-21 21:47:13
合計ジャッジ時間 18,447 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 136 ms
92,592 KB
testcase_01 AC 142 ms
92,252 KB
testcase_02 AC 151 ms
92,548 KB
testcase_03 AC 136 ms
92,452 KB
testcase_04 AC 138 ms
92,736 KB
testcase_05 AC 137 ms
92,460 KB
testcase_06 AC 135 ms
92,384 KB
testcase_07 AC 135 ms
92,532 KB
testcase_08 AC 134 ms
92,512 KB
testcase_09 AC 136 ms
92,588 KB
testcase_10 AC 133 ms
92,588 KB
testcase_11 AC 138 ms
92,528 KB
testcase_12 AC 135 ms
92,372 KB
testcase_13 AC 133 ms
92,452 KB
testcase_14 AC 243 ms
98,700 KB
testcase_15 AC 213 ms
96,292 KB
testcase_16 AC 179 ms
93,564 KB
testcase_17 AC 594 ms
118,224 KB
testcase_18 AC 193 ms
94,432 KB
testcase_19 AC 184 ms
93,408 KB
testcase_20 AC 243 ms
98,528 KB
testcase_21 AC 356 ms
104,356 KB
testcase_22 AC 271 ms
99,176 KB
testcase_23 AC 280 ms
99,900 KB
testcase_24 AC 1,124 ms
152,416 KB
testcase_25 AC 1,165 ms
152,660 KB
testcase_26 AC 1,137 ms
148,872 KB
testcase_27 AC 1,132 ms
153,008 KB
testcase_28 AC 1,130 ms
148,700 KB
testcase_29 AC 1,152 ms
148,648 KB
testcase_30 AC 1,172 ms
152,260 KB
testcase_31 AC 1,178 ms
152,280 KB
testcase_32 AC 1,157 ms
148,760 KB
testcase_33 AC 1,166 ms
152,092 KB
testcase_34 AC 142 ms
92,680 KB
testcase_35 AC 134 ms
92,456 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
import bisect,string,math,time,functools,random,fractions
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
rep=range;R=range
def Golf():n,*t=map(int,open(0).read().split())
def I():return int(input())
def S_():return input()
def IS():return input().split()
def LS():return [i for i in input().split()]
def MI():return map(int,input().split())
def LI():return [int(i) for i in input().split()]
def LI_():return [int(i)-1 for i in input().split()]
def NI(n):return [int(input()) for i in range(n)]
def NI_(n):return [int(input())-1 for i in range(n)]
def NLI(n):return [[int(i) for i in input().split()] for i in range(n)]
def NLI_(n):return [[int(i)-1 for i in input().split()] for i in range(n)]
def StoLI():return [ord(i)-97 for i in input()]
def ItoS(n):return chr(n+97)
def LtoS(ls):return ''.join([chr(i+97) for i in ls])
def RA():return map(int,open(0).read().split())
def RLI(n=8,a=1,b=10):return [random.randint(a,b)for i in range(n)]
def RI(a=1,b=10):return random.randint(a,b)
def INP():
    N=9
    n=random.randint(1,N)
    m=random.randint(1,n*n)
    A=[random.randint(1,n) for i in range(m)]
    B=[random.randint(1,n) for i in range(m)]
    G=[[]for i in range(n)];RG=[[]for i in range(n)]
    for i in range(m):
        a,b=A[i]-1,B[i]-1
        if a==b:continue
        G[a]+=(b,1),;RG[b]+=(a,1),
    return n,m,G,RG
def Rtest(T):
    case,err=0,0
    for i in range(T):
        inp=INP()
        a1=naive(*inp)
        a2=solve(*inp)
        if a1==a2:
            print(inp)
            print('naive',a1)
            print('solve',a2)
            err+=1
        case+=1
    print('Tested',case,'case with',err,'errors')
def GI(V,E,ls=None,Directed=False,index=1):
    org_inp=[];g=[[] for i in range(V)]
    FromStdin=True if ls==None else False
    for i in range(E):
        if FromStdin:
            inp=LI()
            org_inp.append(inp)
        else:
            inp=ls[i]
        if len(inp)==2:
            a,b=inp;c=1
        else:
            a,b,c=inp
        if index==1:a-=1;b-=1
        aa=(a,c);bb=(b,c);g[a].append(bb)
        if not Directed:g[b].append(aa)
    return g,org_inp
def GGI(h,w,search=None,replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1):
    #h,w,g,sg=GGI(h,w,search=['S','G'],replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1) # sample usage
    mp=[boundary]*(w+2);found={}
    for i in R(h):
        s=input()
        for char in search:
            if char in s:
                found[char]=((i+1)*(w+2)+s.index(char)+1)
                mp_def[char]=mp_def[replacement_of_found]
        mp+=[boundary]+[mp_def[j] for j in s]+[boundary]
    mp+=[boundary]*(w+2)
    return h+2,w+2,mp,found
def TI(n):return GI(n,n-1)
def accum(ls):
    rt=[0]
    for i in ls:rt+=[rt[-1]+i]
    return rt
def bit_combination(n,base=2):
    rt=[]
    for tb in R(base**n):s=[tb//(base**bt)%base for bt in R(n)];rt+=[s]
    return rt
def gcd(x,y):
    if y==0:return x
    if x%y==0:return y
    while x%y!=0:x,y=y,x%y
    return y
def YN(x):print(['NO','YES'][x])
def Yn(x):print(['No','Yes'][x])
def show(*inp,end='\n'):
    if show_flg:print(*inp,end=end)

mo=10**9+7
#mo=998244353
inf=float('inf')
FourNb=[(-1,0),(1,0),(0,1),(0,-1)];EightNb=[(-1,0),(1,0),(0,1),(0,-1),(1,1),(-1,-1),(1,-1),(-1,1)];compas=dict(zip('WENS',FourNb));cursol=dict(zip('LRUD',FourNb))
#l_alp=string.ascii_lowercase
#sys.setrecursionlimit(10**9)
read=sys.stdin.buffer.read;readline=sys.stdin.buffer.readline;input=lambda:sys.stdin.readline().rstrip()

class Comb:
    def __init__(self,n,mo=10**9+7):
        self.fac=[0]*(n+1)
        self.inv=[1]*(n+1)
        self.fac[0]=1
        self.fact(n)
        for i in range(1,n+1):
            self.fac[i]=i*self.fac[i-1]%mo
            self.inv[n]*=i
            self.inv[n]%=mo
        self.inv[n]=pow(self.inv[n],mo-2,mo)
        for i in range(1,n):
            self.inv[n-i]=self.inv[n-i+1]*(n-i+1)%mo
        return
    
    def fact(self,n):
        return self.fac[n]
        
    def invf(self,n):
        return self.inv[n]

    def comb(self,x,y):
        if y<0 or y>x:
            return 0
        return self.fac[x]*self.inv[x-y]*self.inv[y]%mo



show_flg=False
show_flg=True


ans=0

n=I()
b=[]
for i in range(n):
    x,y=LI()
    b+=(x,y),

q=[]
for i in range(n):
    for j in range(i+1,n):
        s,t=b[i]
        x,y=b[j]
        r=(x-s)**2+(y-t)**2
        heappush(q,(r,(i,j)))

v=[0]*n
while q:
    r,(i,j)=heappop(q)
    #show(r,(i,j),v)
    if i==0 and v[j]==0:
        v[j]=2
    elif j==0 and v[i]==0:
        v[i]=2
    
    if v[i]>0 or v[j]>0:
        continue
    if i!=0 and j!=0:
        v[i]=max(v[i],1)
        v[j]=max(v[j],1)
    
print(v.count(2))
0