#943331 (C++17) No.2602 Real Collider

提出ソース

結果

問題	No.2602 Real Collider
ユーザー	ゆにぽけ
提出日時	2024-01-12 21:55:41
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	3,857 bytes
コンパイル時間	1,231 ms
コンパイル使用メモリ	131,168 KB
実行使用メモリ	6,948 KB
最終ジャッジ日時	2024-09-27 22:03:51
合計ジャッジ時間	5,884 ms
ジャッジサーバーID （参考情報）	judge3 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	2 ms 6,944 KB
testcase_03	AC	2 ms 6,944 KB
testcase_04	AC	2 ms 6,944 KB
testcase_05	WA	-
testcase_06	WA	-
testcase_07	AC	1 ms 6,940 KB
testcase_08	AC	2 ms 6,940 KB
testcase_09	AC	1 ms 6,940 KB
testcase_10	AC	37 ms 6,944 KB
testcase_11	AC	15 ms 6,944 KB
testcase_12	AC	19 ms 6,940 KB
testcase_13	AC	9 ms 6,944 KB
testcase_14	AC	20 ms 6,940 KB
testcase_15	WA	-
testcase_16	AC	19 ms 6,940 KB
testcase_17	WA	-
testcase_18	AC	14 ms 6,940 KB
testcase_19	AC	17 ms 6,940 KB
testcase_20	WA	-
testcase_21	AC	13 ms 6,944 KB
testcase_22	AC	16 ms 6,944 KB
testcase_23	AC	11 ms 6,940 KB
testcase_24	AC	15 ms 6,940 KB
testcase_25	AC	16 ms 6,944 KB
testcase_26	WA	-
testcase_27	AC	19 ms 6,944 KB
testcase_28	WA	-
testcase_29	AC	17 ms 6,944 KB
testcase_30	AC	18 ms 6,944 KB
testcase_31	AC	18 ms 6,940 KB
testcase_32	AC	15 ms 6,940 KB
testcase_33	WA	-
testcase_34	AC	18 ms 6,940 KB
testcase_35	AC	12 ms 6,940 KB
testcase_36	WA	-
testcase_37	AC	20 ms 6,944 KB
testcase_38	AC	20 ms 6,940 KB
testcase_39	AC	20 ms 6,940 KB
testcase_40	WA	-
testcase_41	AC	22 ms 6,940 KB
testcase_42	WA	-
testcase_43	WA	-
testcase_44	AC	23 ms 6,940 KB
testcase_45	AC	14 ms 6,940 KB
testcase_46	AC	14 ms 6,944 KB
testcase_47	AC	20 ms 6,940 KB
testcase_48	AC	15 ms 6,940 KB
testcase_49	AC	12 ms 6,940 KB
testcase_50	WA	-
testcase_51	WA	-
testcase_52	AC	8 ms 6,940 KB
testcase_53	AC	18 ms 6,940 KB
testcase_54	AC	14 ms 6,944 KB
testcase_55	WA	-
testcase_56	WA	-
testcase_57	AC	15 ms 6,944 KB
testcase_58	AC	7 ms 6,940 KB
testcase_59	AC	17 ms 6,940 KB
testcase_60	WA	-
testcase_61	WA	-
testcase_62	AC	17 ms 6,940 KB
testcase_63	WA	-
testcase_64	AC	24 ms 6,944 KB
testcase_65	WA	-
testcase_66	AC	19 ms 6,940 KB
testcase_67	AC	9 ms 6,944 KB
testcase_68	AC	11 ms 6,940 KB
testcase_69	AC	8 ms 6,940 KB
testcase_70	AC	9 ms 6,944 KB
testcase_71	AC	13 ms 6,944 KB
testcase_72	WA	-
testcase_73	WA	-
testcase_74	AC	18 ms 6,940 KB
testcase_75	WA	-
testcase_76	AC	17 ms 6,940 KB
testcase_77	AC	17 ms 6,940 KB
testcase_78	AC	21 ms 6,940 KB
testcase_79	AC	18 ms 6,944 KB
testcase_80	AC	21 ms 6,940 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <iostream>
#include <vector>
#include <algorithm>
#include <array>
#include <iterator>
#include <string>
#include <cctype>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <bitset>
#include <random>
#include <utility>
#include <functional>
using namespace std;
template<int m> struct modint
{
	private:
	unsigned int value;
	static constexpr int mod() {return m;}

	public:
	constexpr modint(const long long x = 0) noexcept
	{
		long long y = x;
		if(y < 0 || y >= mod())
		{
			y %= mod();
			if(y < 0) y += mod();
		}
		value = (unsigned int)y;
	}
	constexpr unsigned int val() noexcept {return value;}
	constexpr modint &operator+=(const modint &other) noexcept
	{
		value += other.value;
		if(value >= mod()) value -= mod();
		return *this;
	}
	constexpr modint &operator-=(const modint &other) noexcept
	{
		unsigned int x = value;
		if(x < other.value) x += mod();
		x -= other.value;
		value = x;
		return *this;
	}
	constexpr modint &operator*=(const modint &other) noexcept
	{
		unsigned long long x = value;
		x *= other.value;
		value = (unsigned int) (x % mod());
		return *this;
	}
	constexpr modint &operator/=(const modint &other) noexcept
	{
		return *this *= other.inverse();
	}
	constexpr modint inverse() const noexcept
	{
		assert(value);
		long long a = value,b = mod(),x = 1,y = 0;
		while(b)
		{
			long long q = a/b;
			a -= q*b; swap(a,b);
			x -= q*y; swap(x,y);
		}
		return modint(x);
	}
	constexpr modint power(long long N) const noexcept
	{
		assert(N >= 0);
		modint p = *this,ret = 1;
		while(N)
		{
			if(N & 1) ret *= p;
			p *= p;
			N >>= 1;
		}
		return ret;
	}
	constexpr modint operator+() {return *this;}
	constexpr modint operator-() {return modint() - *this;}
	constexpr modint &operator++(int) noexcept {return *this += 1;}
	constexpr modint &operator--(int) noexcept {return *this -= 1;}
	friend modint operator+(const modint& lhs, const modint& rhs) {return modint(lhs) += rhs;}
	friend modint operator-(const modint& lhs, const modint& rhs) {return modint(lhs) -= rhs;}
	friend modint operator*(const modint& lhs, const modint& rhs) {return modint(lhs) *= rhs;}
	friend modint operator/(const modint& lhs, const modint& rhs) {return modint(lhs) /= rhs;}
	friend ostream &operator<<(ostream &os,const modint &x) {return os << x.value;}
};
using mint = modint<998244353>;
/* using mint = modint<1000000007>; */
void solve()
{
	int Q;
	cin >> Q;
	vector<long long> X(3),Y(3);
	for(int i = 0;i < 3;i++) cin >> X[i] >> Y[i];

	long double cx = 0,cy = 0;
	long double r2 = 1e20;
	long long denom = (X[0] - X[1]) * (Y[1] - Y[2]) - (X[1] - X[2]) * (Y[0] - Y[1]);
	
	{
		for(int i = 0;i < 3;i++)
		{
			int j = (i + 1) % 3,k = (i + 2) % 3;
			long double tx = 0.5 * (X[i] + X[j]),ty = 0.5 * (Y[i] + Y[j]);
			long double s2 = (X[i] - tx) * (X[i] - tx) + (Y[i] - ty) * (Y[i] - ty);
			if((X[k] - tx) * (X[k] - tx) + (Y[k] - ty) * (Y[k] - ty) <= s2)
			{
				if(r2 > s2)
				{
					cx = tx,cy = ty;
					r2 = s2;
				}
			}
		}
	}
	if(denom != 0)
	{
		long double tx = 0,ty = 0;
		long double s2 = 0;
		for(int i = 0;i < 3;i++)
		{
			tx += (X[i] * X[i] + Y[i] * Y[i]) * (Y[(i + 1) % 3] - Y[(i + 2) % 3]);
			ty += (X[i] * X[i] + Y[i] * Y[i]) * (X[(i + 1) % 3] - X[(i + 2) % 3]);
		}
		tx /= denom * 2;
		ty /= denom * (-2);
		s2 = (X[0] - tx) * (X[0] - tx) + (Y[0] - ty) * (Y[0] - ty);
		if(s2 < r2)
		{
			cx = tx,cy = ty;
			r2 = s2;
		}
	}
	for(;Q--;)
	{
		int x,y;
		cin >> x >> y;
		long double D = (cx - x) * (cx - x) + (cy - y) * (cy - y);
		cout << (D <= r2 ? "Yes\n":"No\n");
	}
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	/* cin >> tt; */
	while(tt--) solve();
}

yukicoder

結果

テストケース

ソースコード