#444930 (Java) No.55 正方形を描くだけの簡単なお仕事です。

• 問題: No.55 正方形を描くだけの簡単なお仕事です。
• ユーザー: 37zigen
• 提出日時: 2020-03-17 03:00:57
• 言語: Java (openjdk 23)
• 結果: AC
• 実行時間: 175 ms / 5,000 ms
• コード長: 3,138 bytes
• コンパイル時間: 2,486 ms
• コンパイル使用メモリ: 81,472 KB
• 実行使用メモリ: 55,148 KB
• 最終ジャッジ日時: 2024-11-29 03:04:56
• 合計ジャッジ時間: 7,255 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

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

ソースコード

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
102
103
104
105
106
107
108
109
110
111
112
import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.NoSuchElementException;
import java.util.Scanner;
class Main {
    public static void main(String[] args) {
        new Main().run();
    }
    
    int inner_product(int x1,int y1,int x2,int y2) {
        return x1*x2+y1*y2;
    }
    
    void f(int x0,int y0,int x1,int y1,int x2,int y2) {
        x1-=x0;
        y1-=y0;
        x2-=x0;
        y2-=y0;
        if(inner_product(x1, y1, x2, y2)!=0)return;
        if(x1*x1+y1*y1!=x2*x2+y2*y2)return;
        System.out.println((x0+x1+x2)+" "+(y0+y1+y2));
        System.exit(0);
    }
    
    void run() {
        Scanner sc=new Scanner(System.in);
        int[] x=new int[3];
        int[] y=new int[3];
        for(int i=0;i<3;++i) {
            x[i]=sc.nextInt();
            y[i]=sc.nextInt();
        }
        f(x[0],y[0],x[1],y[1],x[2],y[2]);
        f(x[0],y[0],x[2],y[2],x[1],y[1]);
        f(x[1],y[1],x[0],y[0],x[2],y[2]);
        f(x[1],y[1],x[2],y[2],x[0],y[0]);
        f(x[2],y[2],x[0],y[0],x[1],y[1]);
        f(x[2],y[2],x[1],y[1],x[0],y[0]);
        System.out.println(-1);
    }
    
    void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));}
}
class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    public double nextDouble() { return Double.parseDouble(next());}
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX