結果

問題 No.3005 トレミーの問題
ユーザー sgfc
提出日時 2025-01-17 22:58:48
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 4,850 bytes
コンパイル時間 7,722 ms
コンパイル使用メモリ 334,864 KB
実行使用メモリ 6,816 KB
最終ジャッジ日時 2025-01-17 22:59:00
合計ジャッジ時間 8,047 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 27 WA * 3
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include "bits/stdc++.h"

#include <stdio.h>
#include <math.h>

#include "atcoder/all"
#include <float.h>

//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;

#include <boost/rational.hpp>
using rational = boost::rational<long long>;


using namespace std;
using namespace atcoder;

using ll = long long;
using ull = unsigned long long;
using mint = modint998244353;
using mint2 = modint1000000007;
const double eps = 1e-9;

#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define REPI(i, init, n) for (ll i = init; i < ll(n); ++i)
#define REPD(i, init) for (ll i = init; i >=0; --i)
#define REPDI(i, init, n) for (ll i = init; i >=n; --i)
#define REPE(i, c) for (const auto& i : c)
#define TCASE() ll _ttt; cin >> _ttt; while(_ttt--)

using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>;
#define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;
#define DLI(a, n) deque<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;
#define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x;
#define VVLI(a, n, m, init) vector<vector<ll>> a(n); for(auto& x : a) x.assign(m, init);
using vd = vector<double>; using pl = pair<ll, ll>; using vpl = vector<pl>;

struct uv { ll u; ll v; ll c; };
#define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;}
#define VUVCI(a, n) vector<uv> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;}
vvl to_edge(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; }
vvl to_edge_d(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; }

template <class T = long long> using pql = priority_queue<T>;
template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>;
using vm = vector<mint>; using vvm = vector<vm>;

ostream& operator<<(ostream& os, const mint& v) { os << v.val(); return os; }
void yn(bool f) { std::cout << (f ? "Yes" : "No") << endl; };
template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } };
template<> void ov(const vm& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << it->val(); } };

const ll llhuge = 1LL << 61; //十分でかいが多少足しても溢れない数値
auto gmax(const auto& a, const auto& b) { return a > b ? a : b; };
auto gmin(const auto& a, const auto& b) { return a < b ? a : b; };
bool chmin(auto& a, const auto& b) { const auto olda = a; a = gmin(a, b); return olda != a; }
bool chmax(auto& a, const auto& b) { const auto olda = a; a = gmax(a, b); return olda != a; }
void sort(auto& v) { std::ranges::sort(v); };
void rev(auto& v) { std::ranges::reverse(v); };
template<class T> auto p_sum(const T& v) { T ret(v.size()); std::partial_sum(begin(v), end(v), ret.begin()); return ret; };
template<class T, class K = T::key_type, class V = T::mapped_type> [[nodiscard]] V myat(const T& mp, const K& key) { return mp.find(key) == mp.end() ? V() : mp.at(key); }
long long ceil(const long long a, const long long b) { return (a + b - 1) / b; }

struct pt {
	ll x;
	ll y;
};

double len(pt a, pt b) {
	return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));
}

int main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	pt a, b, c, d;
	cin >> a.x >> a.y >> b.x >> b.y >> c.x >> c.y >> d.x >> d.y;

	map<ll, ll> sx;
	map<ll, ll> sy;
	sx[a.x]++;
	sx[b.x]++;
	sx[c.x]++;
	sx[d.x]++;
	sy[a.y]++;
	sy[b.y]++;
	sy[c.y]++;
	sy[d.y]++;

	REPE(x, sx) {
		if (x.second > 2) {
			cout << "NO" << endl;
			return 0;
		}
	}
	REPE(y, sy) {
		if (y.second > 2) {
			cout << "NO" << endl;
			return 0;
		}
	}

	bool ok2 = true;
	if (a.x != b.x && a.x != c.x) {
		rational ab = rational(b.y - a.y, b.x - a.x);
		rational ac = rational(c.y - a.y, c.x - a.x);
		if (ab == ac) ok2 = false;
	}
	if (a.x != b.x && a.x != d.x) {
		rational ab = rational(b.y - a.y, b.x - a.x);
		rational ad = rational(d.y - a.y, d.x - a.x);
		if (ab == ad) ok2 = false;
	}
	if (a.x != c.x && a.x != d.x) {
		rational ac = rational(c.y - a.y, c.x - a.x);
		rational ad = rational(d.y - a.y, d.x - a.x);
		if (ac == ad) ok2 = false;
	}
	if (b.x != c.x && b.x != d.x) {
		rational bc = rational(c.y - b.y, c.x - b.x);
		rational bd = rational(d.y - b.y, d.x - b.x);
		if (bc == bd) ok2 = false;
	}
	if (!ok2) {
		cout << "NO" << endl;
		return 0;
	}

	bool ok = false;
	if (abs(len(a, b) * len(c, d) + len(b, c) * len(d, a) - len(a, c) * len(b, d)) < eps) ok = true;
	swap(c, d);
	if (abs(len(a, b) * len(c, d) + len(b, c) * len(d, a) - len(a, c) * len(b, d)) < eps) ok = true;

	if (ok) {
		cout << "YES" << endl;
	}
	else {
		cout << "NO" << endl;
	}
	
}
0