結果

問題 No.2180 Comprehensive Line Segments
ユーザー MasKoaTSMasKoaTS
提出日時 2022-12-17 14:00:04
言語 PyPy3
(7.3.15)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 2,189 bytes
コンパイル時間 269 ms
コンパイル使用メモリ 81,900 KB
実行使用メモリ 87,636 KB
最終ジャッジ日時 2024-04-28 10:36:58
合計ジャッジ時間 9,322 ms
ジャッジサーバーID
(参考情報)
judge4 / judge1
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 80 ms
76,484 KB
testcase_01 AC 41 ms
54,660 KB
testcase_02 AC 41 ms
53,980 KB
testcase_03 AC 578 ms
86,172 KB
testcase_04 AC 40 ms
54,456 KB
testcase_05 AC 40 ms
53,416 KB
testcase_06 AC 40 ms
55,060 KB
testcase_07 AC 40 ms
54,608 KB
testcase_08 AC 38 ms
54,456 KB
testcase_09 AC 497 ms
84,864 KB
testcase_10 AC 500 ms
86,140 KB
testcase_11 WA -
testcase_12 AC 268 ms
80,960 KB
testcase_13 AC 677 ms
85,988 KB
testcase_14 AC 756 ms
87,636 KB
testcase_15 WA -
testcase_16 AC 124 ms
77,804 KB
testcase_17 AC 166 ms
78,592 KB
testcase_18 AC 717 ms
86,360 KB
testcase_19 AC 258 ms
80,904 KB
testcase_20 AC 50 ms
63,212 KB
testcase_21 AC 164 ms
78,832 KB
testcase_22 AC 75 ms
76,712 KB
testcase_23 AC 117 ms
77,296 KB
testcase_24 AC 96 ms
76,396 KB
testcase_25 AC 119 ms
77,680 KB
testcase_26 AC 756 ms
87,244 KB
testcase_27 AC 255 ms
79,516 KB
testcase_28 WA -
権限があれば一括ダウンロードができます

ソースコード

diff #

from __future__ import annotations
import sys
from itertools import permutations
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: int) -> int:
	if(x > 0):
		return 1
	if(x < 0):
		return -1
	return 0


"""
Main Code
"""

N = int(input())
P = [Vector2(*map(int, input().split())) for _ in [0] * N]

if(N == 1):
	print(1)
	exit(0)

perm = [*permutations([*range(N)], 2)]
vec_lis = [[None]*N for _ in [0]*N]
for i, j in perm:
	vec_lis[i][j] = P[j] - P[i]

ans = N
dp = [[[N]*N for _ in [0]*N] for _ in [0]*(1 << N)]
for i, j in perm:
	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 perm:
		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 perm:
			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 != 0)
			else:
				d = (v1 * v2 == 0) + (v2 * v3 == 0)
				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)
0