結果

問題 No.2769 Number of Rhombi
ユーザー ButterflvButterflv
提出日時 2024-05-31 23:14:19
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 2,427 ms / 5,000 ms
コード長 2,726 bytes
コンパイル時間 224 ms
コンパイル使用メモリ 82,436 KB
実行使用メモリ 174,688 KB
最終ジャッジ日時 2024-12-21 01:33:08
合計ジャッジ時間 61,392 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 46 ms
55,908 KB
testcase_01 AC 47 ms
55,644 KB
testcase_02 AC 49 ms
57,480 KB
testcase_03 AC 1,271 ms
134,020 KB
testcase_04 AC 1,198 ms
127,060 KB
testcase_05 AC 1,109 ms
114,780 KB
testcase_06 AC 2,072 ms
137,352 KB
testcase_07 AC 2,360 ms
150,112 KB
testcase_08 AC 1,868 ms
145,800 KB
testcase_09 AC 2,096 ms
151,964 KB
testcase_10 AC 1,590 ms
150,600 KB
testcase_11 AC 2,005 ms
158,292 KB
testcase_12 AC 2,390 ms
170,956 KB
testcase_13 AC 2,392 ms
165,364 KB
testcase_14 AC 2,000 ms
166,936 KB
testcase_15 AC 2,353 ms
174,688 KB
testcase_16 AC 1,665 ms
161,816 KB
testcase_17 AC 2,421 ms
172,268 KB
testcase_18 AC 2,308 ms
164,204 KB
testcase_19 AC 1,840 ms
163,616 KB
testcase_20 AC 1,631 ms
159,740 KB
testcase_21 AC 2,427 ms
170,020 KB
testcase_22 AC 1,904 ms
163,576 KB
testcase_23 AC 1,787 ms
162,792 KB
testcase_24 AC 48 ms
55,168 KB
testcase_25 AC 1,534 ms
158,832 KB
testcase_26 AC 1,782 ms
160,840 KB
testcase_27 AC 1,547 ms
158,784 KB
testcase_28 AC 2,320 ms
167,016 KB
testcase_29 AC 1,644 ms
160,424 KB
testcase_30 AC 1,733 ms
161,400 KB
testcase_31 AC 1,535 ms
158,544 KB
testcase_32 AC 2,005 ms
149,436 KB
testcase_33 AC 1,611 ms
145,312 KB
testcase_34 AC 1,990 ms
153,496 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import math
import random


mod=random.randint(1<<50,1<<60)
B=random.randint(1<<50,1<<60)
while math.gcd(B,mod)!=1: B=random.randint(1<<50,1<<60)

base = [pow(B,i,mod) for i in range(10)]

ans = 0

N=int(input())
P = []
for i in range(N):
  x, y = map(int, input().split())
  P.append((x, y))

point_info = dict()

for i in range(N):
  for j in range(N):
    if P[i]==P[j]: continue
    x1, y1 = P[i]
    x2, y2 = P[j]

    if (x1+x2)%2==0:
      tyuten_x = ((x1+x2)//2, 1)
    else:
      tyuten_x = (x1+x2, 2)

    if (y1+y2)%2==0:
      tyuten_y = ((y1+y2)//2, 1)
    else:
      tyuten_y = (y1+y2, 2)

    # 方向 vec
    vec = [x1-x2, y1-y2]
    if x1-x2==0:
      vec[1] = abs(vec[1])
    if y1-y2==0:
      vec[0] = abs(vec[0])
    if vec[1]<0: vec[0]*=-1; vec[1]*=-1
    g = math.gcd(abs(vec[0]), abs(vec[1]))
    vec[0]//=g; vec[1]//=g

    # vec = tuple(vec)

    a,b=tyuten_x
    c,d=tyuten_y
    e,f=vec

    hush = ((
      a*base[0] + b*base[1] + c*base[2] +
      d*base[3] + e*base[4] + f*base[5]
    )%mod)

    if point_info.get(hush)==None:
      point_info[hush]=0
    point_info[hush]+=1

    # if point_info.get((tyuten, vec))==None:
    #   point_info[(tyuten, vec)] = 0
    # point_info[(tyuten, vec)] += 1

# for key in point_info:
#   point_info[key]=dict(point_info[key])

# point_info = dict(point_info)

# for key in point_info:
#   print(key, point_info[key])

for i in range(N):
  for j in range(N):
    if P[i]==P[j]: continue
    x1, y1 = P[i]
    x2, y2 = P[j]


    if (x1+x2)%2==0:
      tyuten_x = ((x1+x2)//2, 1)
    else:
      tyuten_x = (x1+x2, 2)

    if (y1+y2)%2==0:
      tyuten_y = ((y1+y2)//2, 1)
    else:
      tyuten_y = (y1+y2, 2)

    # 方向 vec
    vec = [x1-x2, y1-y2]
    if x1-x2==0:
      vec[1] = abs(vec[1])
    if y1-y2==0:
      vec[0] = abs(vec[0])
    if vec[1]<0: vec[0]*=-1; vec[1]*=-1
    g = math.gcd(abs(vec[0]), abs(vec[1]))
    vec[0]//=g; vec[1]//=g

    # vec = tuple(vec)

    # a,b=tyuten_x
    # c,d=tyuten_y
    # e,f=vec

    # hush = ((
    #   a*base[0] + b*base[1] + c*base[2] +
    #   d*base[3] + e*base[4] + f*base[5]
    # )%mod)

    # if point_info.get(hush)==None:
    #   point_info[hush]=0
    # point_info[hush]+=1


    inv_vec = [vec[1], vec[0]*(-1)]
    if inv_vec[1]<0:
      inv_vec[0]*=-1; inv_vec[1]*=-1
    if inv_vec[0]==0:
      inv_vec[1] = abs(inv_vec[1])
    if inv_vec[1]==0:
      inv_vec[0] = abs(inv_vec[0])
    inv_vec = tuple(inv_vec)

    a,b=tyuten_x
    c,d=tyuten_y
    e,f=inv_vec


    hush = ((
      a*base[0] + b*base[1] + c*base[2] +
      d*base[3] + e*base[4] + f*base[5]
    )%mod)

    if point_info.get(hush)!=None:
      ans += point_info[hush]

print(ans//8 if ans!=0 else 0)

# print(point_info)
0