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

• 問題: No.2555 Intriguing Triangle
• ユーザー: 👑 binap
• 提出日時: 2023-12-01 00:54:48
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 2,087 bytes
• コンパイル時間: 4,612 ms
• コンパイル使用メモリ: 261,612 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-09-26 15:25:30
• 合計ジャッジ時間: 4,952 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	2 ms; 5,248 KB
testcase_03	AC	2 ms; 5,248 KB
testcase_04	AC	2 ms; 5,376 KB
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	2 ms; 5,376 KB
testcase_11	AC	2 ms; 5,376 KB
testcase_12	AC	2 ms; 5,376 KB
testcase_13	WA	-
testcase_14	AC	2 ms; 5,376 KB
testcase_15	WA	-
testcase_16	AC	2 ms; 5,376 KB
testcase_17	AC	3 ms; 5,376 KB
testcase_18	AC	2 ms; 5,376 KB
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	AC	2 ms; 5,376 KB
testcase_23	AC	1 ms; 5,376 KB
testcase_24	AC	2 ms; 5,376 KB
testcase_25	AC	2 ms; 5,376 KB
testcase_26	AC	1 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>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template <typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}

const long double delta = 0.00000003;

int main(){
	int a, b, c;
	cin >> a >> b >> c;
	for(int x = 1; x <= 100; x++){
		for(int y = 1; y <= 100; y++){
			if(x + a + y <= abs(b - c) or x + a + y >= b + c) continue;
			long double s = (long double)((x + a + y) + b + c) / 2;
			long double area = sqrtl(s * (s - (x + a + y)) * (s - b) * (s - c));
			
			long double sin_beta = 2 * area / (x + a + y) / b;
			long double cos_beta = sqrtl(1 - sin_beta * sin_beta);
			
			long double sin_gamma = 2 * area / (x + a + y) / c;
			long double cos_gamma = sqrtl(1 - sin_gamma * sin_gamma);
			
			long double p = b * b + (x + a) * (x + a) - 2 * b * (x + a) * cos_beta;
			long double q = c * c + (y + a) * (y + a) - 2 * c * (y + a) * cos_gamma;
			
			long double d = (x + a) * (x + a) * sin_beta * sin_beta / p - (y + a) * (y + a) * sin_gamma * sin_gamma / q;
			if(abs(d) < delta){
				cout << "Yes\n";
//				cout << x << ' ' << y << "\n";
				return 0;
			}
		}
	}
	cout << "No\n";
	return 0;
}