結果
| 問題 |
No.2769 Number of Rhombi
|
| コンテスト | |
| ユーザー |
|
| 提出日時 | 2024-05-31 22:42:11 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
MLE
|
| 実行時間 | - |
| コード長 | 1,774 bytes |
| コンパイル時間 | 338 ms |
| コンパイル使用メモリ | 82,340 KB |
| 実行使用メモリ | 620,608 KB |
| 最終ジャッジ日時 | 2024-12-21 00:32:38 |
| 合計ジャッジ時間 | 150,929 ms |
|
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | WA * 10 TLE * 16 MLE * 6 |
ソースコード
from collections import defaultdict as dd
import math
ans = 0
N=int(input())
P = []
for i in range(N):
x, y = map(int, input().split())
P.append((x, y))
point_info = dd(lambda: dd(lambda: 0))
for i in range(N):
for j in range(N):
if P[i]==P[j]: continue
x1, y1 = P[i]
x2, y2 = P[j]
tyuten_x = [x1+x2, 2]
if (x1+x2)%2==0:
tyuten_x = [(x1+x2)//2, 1]
tyuten_x = tuple(tyuten_x)
tyuten_y = [y1+y2, 2]
if (y1+y2)%2==0:
tyuten_y = [(y1+y2)//2, 1]
tyuten_y = tuple(tyuten_y)
tyuten = (tyuten_x, tyuten_y)
# 方向 vec
vec = [x1-x2, y1-y2]
if x1-x2==0: vec[0]=0
if y1-y2==0: vec[1]=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)
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]
tyuten_x = [x1+x2, 2]
if (x1+x2)%2==0:
tyuten_x = [(x1+x2)//2, 1]
tyuten_x = tuple(tyuten_x)
tyuten_y = [y1+y2, 2]
if (y1+y2)%2==0:
tyuten_y = [(y1+y2)//2, 1]
tyuten_y = tuple(tyuten_y)
tyuten = (tyuten_x, tyuten_y)
# 方向 vec
vec = [x1-x2, y1-y2]
if x1-x2==0: vec[0]=0
if y1-y2==0: vec[1]=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)
inv_vec = [vec[1], vec[0]*(-1)]
if inv_vec[1]<0:
inv_vec[0]*=-1; inv_vec[1]*=-1
inv_vec = tuple(inv_vec)
ans += point_info[tyuten][inv_vec]
print(ans//8 + 1 if ans!=0 else 0)