結果
問題 | No.2180 Comprehensive Line Segments |
ユーザー | MasKoaTS |
提出日時 | 2022-12-17 13:46:45 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,336 bytes |
コンパイル時間 | 202 ms |
コンパイル使用メモリ | 82,116 KB |
実行使用メモリ | 112,700 KB |
最終ジャッジ日時 | 2024-04-28 10:36:48 |
合計ジャッジ時間 | 7,491 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 320 ms
91,156 KB |
testcase_01 | AC | 137 ms
88,120 KB |
testcase_02 | AC | 130 ms
88,532 KB |
testcase_03 | TLE | - |
testcase_04 | -- | - |
testcase_05 | -- | - |
testcase_06 | -- | - |
testcase_07 | -- | - |
testcase_08 | -- | - |
testcase_09 | -- | - |
testcase_10 | -- | - |
testcase_11 | -- | - |
testcase_12 | -- | - |
testcase_13 | -- | - |
testcase_14 | -- | - |
testcase_15 | -- | - |
testcase_16 | -- | - |
testcase_17 | -- | - |
testcase_18 | -- | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
ソースコード
from __future__ import annotations import sys from itertools import permutations from fractions import Fraction as frac input = sys.stdin.readline class Vector2: def __init__(self, x, y): self.x = x self.y = y def __str__(self): return str((self.x, self.y)) __repr__ = __str__ def __eq__(self, other): return (self.x == other.x and self.y == other.y) def __hash__(self): return hash((self.x, self.y)) def __add__(self, other): return Vector2(self.x + other.x, self.y + other.y) def __sub__(self, other): return Vector2(self.x - other.x, self.y - other.y) def __mul__(self, other): return self.x * other.y - self.y * other.x def normalize(self) -> Vector2: assert(self.x != 0 or self.y != 0) norm = self.x ** 2 + self.y ** 2 self.x *= abs(self.x) / norm self.y *= abs(self.y) / norm return self def sgn(x: frac) -> int: if(x > 0): return 1 if(x < 0): return -1 return 0 """ Main Code """ N = int(input()) P = [Vector2(*map(frac, input().split())) for _ in [0] * N] if(N == 1): print(1) exit(0) vec_lis = [[None]*N for _ in [0]*N] for i in range(N - 1): for j in range(i + 1, N): vec_lis[i][j] = (P[j] - P[i]).normalize() vec_lis[j][i] = (P[i] - P[j]).normalize() ans = N dp = [[[N]*N for _ in [0]*N] for _ in [0]*(1 << N)] num = [*range(N)] for i, j in permutations(num, 2): dp[(1 << i) | (1 << j)][i][j] = 1 goal = (1 << N) - 1 for b_now in range(3, goal): for v_prev, v_now in permutations(num, 2): if(dp[b_now][v_prev][v_now] == N or not((b_now >> v_prev) & 1) or not((b_now >> v_now) & 1)): continue c_next = c_now = dp[b_now][v_prev][v_now] v1 = vec_lis[v_prev][v_now] for v_next1, v_next2 in permutations(num, 2): if((((b_now >> v_next1) & 1) and v_now != v_next1) or ((b_now >> v_next2) & 1)): continue b_next = b_now | (1 << v_next1) | (1 << v_next2) v2, v3 = vec_lis[v_now][v_next1], vec_lis[v_next1][v_next2] if(v_now == v_next1): c_next = c_now + (v1 != v3) else: d = (v1 == v2) + (v2 == v3) if(d == 0): d = (sgn(v1 * v2) == sgn(v2 * v3) == sgn(v1 * v3)) c_next = c_now + 2 - d # print(b_now, b_next, v_prev, v_now, v_next1, v_next2, c_now, c_next) if(dp[b_next][v_next1][v_next2] <= c_next): continue dp[b_next][v_next1][v_next2] = c_next ans = min(min(lis) for lis in dp[goal]) print(ans)