#38029 (Java) No.245 貫け！

• 問題: No.245 貫け！
• ユーザー: Grenache
• 提出日時: 2015-07-20 17:08:12
• 言語: Java (openjdk 23)
• 結果: AC
• 実行時間: 218 ms / 5,000 ms
• コード長: 2,680 bytes
• コンパイル時間: 3,353 ms
• コンパイル使用メモリ: 77,792 KB
• 実行使用メモリ: 43,424 KB
• 最終ジャッジ日時: 2024-07-08 11:18:09
• 合計ジャッジ時間: 7,479 ms
• ジャッジサーバーID （参考情報）: judge4 / judge5

ファイルパターン	結果
sample	AC * 4
other	AC * 16

ソースコード

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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
import java.util.Scanner;
public class Main_yukicoder245 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[][] a = new int[4][n];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < 4; j++) {
                a[j][i] = sc.nextInt();
            }
        }
        int max = 0;
        for (int i = 0; i < n; i++) {
            for (int j = i; j < n; j ++) {
                int tmp = 0;
                int tmp1 = 0;
                int tmp2 = 0;
                int tmp3 = 0;
                for (int k = 0; k < n; k++) {
                    if (Geom.lineIntersect(a[0][i], a[1][i], a[0][j], a[1][j], a[0][k], a[1][k], a[2][k], a[3][k])) {
                        tmp++;
                    }
                    if (Geom.lineIntersect(a[0][i], a[1][i], a[2][j], a[3][j], a[0][k], a[1][k], a[2][k], a[3][k])) {
                        tmp1++;
                    }
                    if (Geom.lineIntersect(a[2][i], a[3][i], a[0][j], a[1][j], a[0][k], a[1][k], a[2][k], a[3][k])) {
                        tmp2++;
                    }
                    if (Geom.lineIntersect(a[2][i], a[3][i], a[2][j], a[3][j], a[0][k], a[1][k], a[2][k], a[3][k])) {
                        tmp3++;
                    }
                }
                
                max = Math.max(max, tmp);
                max = Math.max(max, tmp1);
                max = Math.max(max, tmp2);
                max = Math.max(max, tmp3);
            }
        }
        
        System.out.println(max);
        sc.close();
    }
    @SuppressWarnings("unused")
    private static class Geom {
        static int dot(int xa, int ya, int xb, int yb) {
            return xa * xb + ya * yb;
        }
        static int cross(int xa, int ya, int xb, int yb) {
            return xa * yb - xb * ya;
        }
        
        static int sumofsquare(int xa, int ya) {
            return xa * xa + ya * ya;
        }
        static boolean lineIntersect(int xa, int ya, int xb, int yb, int xc, int yc, int xd, int yd) {
            /*
             * 直線ABと線分CDとの交差判定。端点含む
             * 
             * |AB|==0 && |CD|==0
             *     点A==点C
             * |AB|==0 && |CD|!=0
             *     ACxAD==0 && AC.AD<0
             * |AB|!=0
             *     ABxAC*ABxAD<=0
             */
            int xab = xb - xa;
            int yab = yb - ya;
            if (xab != 0 || yab != 0) {
                int xac = xc - xa;
                int yac = yc - ya;
                int xad = xd - xa;
                int yad = yd - ya;
                return (long)cross(xab, yab, xac, yac) * cross(xab, yab, xad, yad) <= 0;
            } else {
                int xcd = xd - xc;
                int ycd = yd - yc;
                if (xcd != 0 || ycd != 0) {
                    int xac = xc - xa;
                    int yac = yc - ya;
                    int xad = xd - xa;
                    int yad = yd - ya;
                    return cross(xac, yac, xad, yad) == 0 && dot(xac, yac, xad, yad) < 0;
                } else {
                    return xa == xc && ya == yc;
                }
            }
        }
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX