#933331 (Java) No.2555 Intriguing Triangle

• 問題: No.2555 Intriguing Triangle
• ユーザー: EvbCFfp1XB
• 提出日時: 2023-12-02 00:05:56
• 言語: Java (openjdk 23)
• 結果: AC
• 実行時間: 138 ms / 2,000 ms
• コード長: 3,171 bytes
• コンパイル時間: 2,189 ms
• コンパイル使用メモリ: 79,208 KB
• 実行使用メモリ: 43,864 KB
• 最終ジャッジ日時: 2024-09-26 16:05:31
• 合計ジャッジ時間: 7,002 ms
• ジャッジサーバーID （参考情報）: judge5 / judge3

ファイルパターン	結果
sample	AC * 2
other	AC * 28

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
import java.util.Optional;
import java.util.Scanner;
public class Main {
    private static final double epsilon = 1e-9;
    public static void main(String[] args) {
        try (Scanner in = new Scanner(System.in)) {
            int de = in.nextInt();
            int ab = in.nextInt();
            // d
            // e
            int ac = in.nextInt();
            boolean res = false;
            for (int bd = 1; bd <= 100; bd++) {
                for (int ec = 1; ec <= 100; ec++) {
                    if (!can_triangle(bd + de + ec, ab, ac)) {
                        continue;
                    }
                    Optional<Double> cos_dba = cosine_formula(ac, ab, bd + de + ec);
                    Optional<Double> cos_eca = cosine_formula(ab, ac, bd + de + ec);
                    if (cos_dba.isEmpty() || cos_eca.isEmpty()) {
                        continue;
                    }
                    double dba = Math.acos(cos_dba.get().doubleValue());
                    double eca = Math.acos(cos_eca.get().doubleValue());
                    Optional<Double> adxad = cosine_formula2(ab, bd, dba);
                    Optional<Double> aexae = cosine_formula2(ac, ec, eca);
                    if (adxad.isEmpty() || aexae.isEmpty()) {
                        continue;
                    }
                    double ad = Math.sqrt(adxad.get().doubleValue());
                    double ae = Math.sqrt(aexae.get().doubleValue());
                    if (!can_triangle(bd, ab, ad)) {
                        continue;
                    }
                    if (!can_triangle(ec, ac, ae)) {
                        continue;
                    }
                    Optional<Double> cos_bad = cosine_formula(bd, ab, ad);
                    Optional<Double> cos_cae = cosine_formula(ec, ac, ae);
                    if (cos_bad.isEmpty() || cos_cae.isEmpty()) {
                        continue;
                    }
                    double bad = Math.acos(cos_bad.get().doubleValue());
                    double cae = Math.acos(cos_cae.get().doubleValue());
                    if (Math.abs(bad - cae) < epsilon) {
                        res = true;
                    }
                }
            }
            System.out.println(res ? "Yes" : "No");
        }
    }
    private static final Optional<Double> cosine_formula(double a, double b, double c) {
        double cos = (b * b + c * c - a * a) / (2.0d * b * c);
        if (Math.abs(cos) > 1.0d) {
            return Optional.empty();
        }
        return Optional.of(cos);
    }
    private static final Optional<Double> cosine_formula2(double b, double c, double cab) {
        double axa = b * b + c * c - 2.0 * b * c * Math.cos(cab);
        if (axa < 0d) {
            return Optional.empty();
        }
        return Optional.of(axa);
    }
    private static final boolean can_triangle(double a, double b, double c) {
        return can_triangle0(a, b, c) || can_triangle0(c, a, b) || can_triangle0(b, c, a);
    }
    private static final boolean can_triangle0(double a, double b, double c) {
        return a >= Math.max(b, c) && a < b + c;
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX