#933330 (C++17) No.2555 Intriguing Triangle

• 問題: No.2555 Intriguing Triangle
• ユーザー: shobonvip
• 提出日時: 2023-12-02 00:05:40
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 1,171 bytes
• コンパイル時間: 1,939 ms
• コンパイル使用メモリ: 200,208 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-09-26 16:05:23
• 合計ジャッジ時間: 2,831 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	WA	-
testcase_02	WA	-
testcase_03	WA	-
testcase_04	WA	-
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	3 ms; 5,376 KB
testcase_11	AC	1 ms; 5,376 KB
testcase_12	AC	2 ms; 5,376 KB
testcase_13	AC	7 ms; 5,376 KB
testcase_14	AC	3 ms; 5,376 KB
testcase_15	AC	2 ms; 5,376 KB
testcase_16	AC	2 ms; 5,376 KB
testcase_17	AC	2 ms; 5,376 KB
testcase_18	WA	-
testcase_19	AC	2 ms; 5,376 KB
testcase_20	AC	2 ms; 5,376 KB
testcase_21	AC	3 ms; 5,376 KB
testcase_22	WA	-
testcase_23	AC	2 ms; 5,376 KB
testcase_24	AC	2 ms; 5,376 KB
testcase_25	AC	3 ms; 5,376 KB
testcase_26	AC	2 ms; 5,376 KB
testcase_27	AC	2 ms; 5,376 KB
testcase_28	AC	2 ms; 5,376 KB
testcase_29	AC	2 ms; 5,376 KB

ソースコード

#include<bits/stdc++.h>
using namespace std;

int main(){
	int a, b, c; cin >> a >> b >> c;

	auto hen_to_cos = [&](long double a, long double b, long double c){
		return (a*a + b*b - c*c) / (2.0*a*b);
	};

	const long double eps = 1e-13;

	bool mode = false;
	for (int x=a+2; x<b+c; x++){
		long double ax = 0.0, ay = 0.0;
		long double cx = c, cy = 0.0;
		long double bx, by;
		long double cos1 = hen_to_cos(b, c, x);
		long double sin1 = sqrt(1 - cos1 * cos1);
		bx = cos1 * b;
		by = sin1 * b;
		for (int y=1; ; y++){
			if (x-y-a <= 0) break;
			long double dx = bx + (cx - bx) * (long double)y / (long double)x;
			long double dy = by + (cy - by) * (long double)y / (long double)x;
			long double ex = bx + (cx - bx) * (long double)(y+a) / (long double)x;
			long double ey = by + (cy - by) * (long double)(y+a) / (long double)x;
			long double AD = sqrt((dx - ax) * (dx - ax) + (dy - ay) * (dy - ay));
			long double AE = sqrt((ex - ax) * (ex - ax) + (ey - ay) * (ey - ay));
			if (abs(hen_to_cos(b, AD, y) - hen_to_cos(c, AE, x-y-a)) < eps){
				mode = true;
				break;
			}
		}
		if (mode) break;
	}

	if (mode){
		cout << "Yes\n";
	}else{
		cout << "No\n";
	}
}