結果

問題 No.2180 Comprehensive Line Segments
ユーザー MasKoaTSMasKoaTS
提出日時 2022-12-21 17:24:19
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 5,454 bytes
コンパイル時間 3,764 ms
コンパイル使用メモリ 234,580 KB
実行使用メモリ 7,808 KB
最終ジャッジ日時 2024-12-22 15:53:46
合計ジャッジ時間 22,415 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 2,748 ms
7,808 KB
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 2 ms
5,248 KB
testcase_07 AC 2 ms
5,248 KB
testcase_08 AC 2 ms
5,248 KB
testcase_09 AC 309 ms
7,680 KB
testcase_10 AC 741 ms
7,680 KB
testcase_11 AC 822 ms
7,808 KB
testcase_12 AC 583 ms
5,504 KB
testcase_13 AC 3,550 ms
7,808 KB
testcase_14 AC 1,367 ms
7,808 KB
testcase_15 AC 813 ms
7,808 KB
testcase_16 AC 110 ms
5,248 KB
testcase_17 AC 349 ms
5,248 KB
testcase_18 AC 3,402 ms
7,808 KB
testcase_19 AC 1,237 ms
5,504 KB
testcase_20 AC 3 ms
5,248 KB
testcase_21 AC 387 ms
5,248 KB
testcase_22 AC 4 ms
5,248 KB
testcase_23 AC 32 ms
5,248 KB
testcase_24 AC 9 ms
5,248 KB
testcase_25 AC 116 ms
5,248 KB
testcase_26 WA -
testcase_27 WA -
testcase_28 AC 72 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("Ofast")

#include <bits/stdc++.h>
using namespace std;
template <class T>	using V = vector<T>;


struct Fraction {
	int numor;
	int denom;

	static int gcd(int x, int y) {
		if (x < 0) {
			x = -x;
		}
		if (y < 0) {
			y = -y;
		}
		while (y != 0) {
			int r = x % y;
			x = y;
			y = r;
		}
		return x;
	}

	static int lcm(int x, int y) {
		return x / gcd(x, y) * y;
	}

	Fraction(void) {
		numor = 0;
		denom = 1;
	}

	Fraction(int numor, int denom) {
		assert(denom != 0);
		int g = gcd(numor, denom);
		numor /= g;
		denom /= g;
		if (denom < 0) {
			numor = -numor;
			denom = -denom;
		}
		this->numor = numor;
		this->denom = denom;
	}

	static Fraction abs(Fraction x) {
		if (x.numor < 0) {
			return -x;
		}
		return x;
	}

	static Fraction zero(void) {
		return Fraction();
	}

	Fraction operator+(void) const {
		return *this;
	}

	Fraction operator-(void) const {
		return Fraction() - (*this);
	}

	Fraction operator+(const Fraction other) const {
		int l = lcm(this->denom, other.denom);
		int a = l / this->denom;
		int b = l / other.denom;
		int new_numor = this->numor * a + other.numor * b;
		int new_denom = l;
		return Fraction(new_numor, new_denom);
	}

	Fraction operator-(const Fraction other) const {
		Fraction f = Fraction(-other.numor, other.denom);
		return (*this) + f;
	}

	Fraction operator*(const Fraction other) const {
		int new_numor = this->numor * other.numor;
		int new_denom = this->denom * other.denom;
		return Fraction(new_numor, new_denom);
	}

	Fraction operator/(const Fraction other) const {
		Fraction f = Fraction(other.denom, other.numor);
		return (*this) * f;
	}

	bool operator<(const Fraction other) const {
		int l = lcm(this->denom, other.denom);
		int a = l / this->denom;
		int b = l / other.denom;
		return (this->numor * a < other.numor* b);
	}

	bool operator>(const Fraction other) const {
		return (other < (*this));
	}

	bool operator==(const Fraction other) const {
		int l = lcm(this->denom, other.denom);
		int a = l / this->denom;
		int b = l / other.denom;
		return (this->numor * a == other.numor * b);
	}

	bool operator!=(const Fraction other) const {
		return (((*this) == other) == false);
	}
};

int sgn(Fraction x) {
	if (x < Fraction::zero()) {
		return -1;
	}
	else if (x > Fraction::zero()) {
		return 1;
	}
	return 0;
}


template <class T>
struct Vector2 {
	T x;
	T y;

	Vector2(void) {

	}

	Vector2(T x, T y) {
		this->x = x;
		this->y = y;
	}

	static Vector2 normalize(Vector2 v) {
		T norm = v.x * v.x + v.y * v.y;
		return Vector2(v.x * Fraction::abs(v.x) / norm, v.y * Fraction::abs(v.y) / norm);
	}

	static bool same_inclination(Vector2& v1, Vector2& v2) {
		return (v1 * v2 == 0 and (v1.x * v2.x > 0 or v1.y * v2.y > 0));
	}

	Vector2 operator+(const Vector2 other) const {
		return Vector2(this->x + other.x, this->y + other.y);
	}

	Vector2 operator-(const Vector2 other) const {
		return Vector2(this->x - other.x, this->y - other.y);
	}

	T operator*(const Vector2 other) const {
		return this->x * other.y - this->y * other.x;
	}

	bool operator<(const Vector2 other) const {
		return tie(this->x, this->y) < tie(other.x, other.y);
	}

	bool operator==(const Vector2 other) const {
		return tie(this->x, this->y) == tie(other.x, other.y);
	}

	bool operator!=(const Vector2 other) const {
		return tie(this->x, this->y) != tie(other.x, other.y);
	}
};


int main(void) {
	int N;	cin >> N;
	V<Vector2<Fraction> > P(N);
	for (auto& p : P) {
		int x, y;	cin >> x >> y;
		p.x = Fraction(x, 1);
		p.y = Fraction(y, 1);
	}

	if (N == 1) {
		cout << 1 << endl;
		return 0;
	}

	V<V<Vector2<Fraction> > > vec_lis(N, V<Vector2<Fraction> >(N));
	V<V<V<int> > > dp(1 << N, V<V<int> >(N, V<int>(N, N)));
	for (int i = 0; i < N; ++i) {
		for (int j = 0; j < N; ++j) {
			if (i == j) {
				continue;
			}
			vec_lis[i][j] = Vector2<Fraction>::normalize(P[j] - P[i]);
			dp[(1 << i) | (1 << j)][i][j] = 1;
		}
	}

	int goal = (1 << N) - 1;
	for (int b_now = 3; b_now < goal; ++b_now) {
		bool flag = (bitset<12>(b_now).count() == N - 1);
		for (int v_prev = 0; v_prev < N; ++v_prev) {
			for (int v_now = 0; v_now < N; ++v_now) {
				if (v_prev == v_now or dp[b_now][v_prev][v_now] == N or ((b_now >> v_prev) & 1) == 0 or ((b_now >> v_now) & 1) == 0) {
					continue;
				}
				int c_now = dp[b_now][v_prev][v_now], c_next = 0;
				Vector2<Fraction>& v1 = vec_lis[v_prev][v_now];
				for (int v_next1 = 0; v_next1 < N; ++v_next1) {
					for (int v_next2 = 0; v_next2 < N; ++v_next2) {
						if (flag == false and v_now == v_next1) {
							continue;
						}
						if (v_next1 == v_next2 or (((b_now >> v_next1) & 1) and v_now != v_next1) or ((b_now >> v_next2) & 1)) {
							continue;
						}
						int b_next = b_now | (1 << v_next1) | (1 << v_next2);
						Vector2<Fraction>& v2 = vec_lis[v_now][v_next1], v3 = vec_lis[v_next1][v_next2];
						if (v_now == v_next1) {
							c_next = c_now + 1 - (v1 == v3);
						}
						else {
							int d = (v1 == v2) + (v2 == v3);
							if (d == 0) {
								int s1 = sgn(v1 * v2), s2 = sgn(v2 * v3), s3 = sgn(v1 * v3);
								d = (s1 == s2 and s2 == s3);
							}
							c_next = c_now + 2 - d;
						}
						if (dp[b_next][v_next1][v_next2] <= c_next) {
							continue;
						}
						dp[b_next][v_next1][v_next2] = c_next;
					}
				}
			}
		}
	}

	int ans = N;
	for (auto v : dp[goal]) {
		for (auto k : v) {
			if (ans <= k) {
				continue;
			}
			ans = k;
		}
	}
	cout << ans << endl;

	return 0;
}
0