結果

問題 No.55 正方形を描くだけの簡単なお仕事です。
ユーザー amyuamyu
提出日時 2015-12-21 03:51:00
言語 Java21
(openjdk 21)
結果
AC  
実行時間 81 ms / 5,000 ms
コード長 4,177 bytes
コンパイル時間 2,658 ms
コンパイル使用メモリ 84,816 KB
実行使用メモリ 39,360 KB
最終ジャッジ日時 2024-04-26 22:16:45
合計ジャッジ時間 5,351 ms
ジャッジサーバーID
(参考情報)
judge3 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 76 ms
37,792 KB
testcase_01 AC 52 ms
36,764 KB
testcase_02 AC 76 ms
38,160 KB
testcase_03 AC 78 ms
38,140 KB
testcase_04 AC 51 ms
36,864 KB
testcase_05 AC 52 ms
36,508 KB
testcase_06 AC 52 ms
36,884 KB
testcase_07 AC 53 ms
36,820 KB
testcase_08 AC 52 ms
36,808 KB
testcase_09 AC 51 ms
36,532 KB
testcase_10 AC 52 ms
36,736 KB
testcase_11 AC 81 ms
39,360 KB
testcase_12 AC 52 ms
36,536 KB
testcase_13 AC 76 ms
37,808 KB
testcase_14 AC 78 ms
38,036 KB
testcase_15 AC 51 ms
36,512 KB
testcase_16 AC 78 ms
37,988 KB
testcase_17 AC 51 ms
36,348 KB
testcase_18 AC 79 ms
37,712 KB
testcase_19 AC 52 ms
36,672 KB
testcase_20 AC 78 ms
37,608 KB
testcase_21 AC 78 ms
37,748 KB
testcase_22 AC 76 ms
37,996 KB
testcase_23 AC 78 ms
37,900 KB
testcase_24 AC 77 ms
37,708 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

import java.util.*;
import java.io.*;

public class Main{
    static final Reader sc = new Reader();
    static final PrintWriter out = new PrintWriter(System.out,false);

    public static void main(String[] args) throws Exception {
    	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();
    	}
    	Point[][] p = new Point[3][2];
    	boolean flag = false;
    	int n = 0;
    	for(int i=0;i<3;i++){
    		p[i][0] = new Point(x[i]-x[(i+1)%3],y[i]-y[(i+1)%3]);
    		p[i][1] = new Point(x[i]-x[(i+2)%3],y[i]-y[(i+2)%3]);
    		if(p[i][0].x*p[i][0].x+p[i][0].y*p[i][0].y==p[i][1].x*p[i][1].x+p[i][1].y*p[i][1].y && p[i][0].x*p[i][1].x+p[i][0].y*p[i][1].y==0){
    			flag = true;
    			n = i;
    		}
    	}
    	if(flag){
    		out.println((x[(n+2)%3]-p[n][0].x)+" "+(y[(n+2)%3]-p[n][0].y));
    	}
    	else{
    		out.println(-1);
    	}
    	out.flush();
        sc.close();
        out.close();
    }

    static void trace(Object... o) { System.out.println(Arrays.deepToString(o));}
}

class Point{
	int x;
	int y;
	Point(int x,int y){
		this.x = x;
		this.y = y;
	}
}

class Reader {

    private final InputStream in;
    private final byte[] buf = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;

    public Reader() { this(System.in);}
    public Reader(InputStream source) { this.in = source;}

    private boolean hasNextByte() {
        if (ptr < buflen) return true;
        ptr = 0;
        try{
            buflen = in.read(buf);
        }catch (IOException e) {e.printStackTrace();}
        if (buflen <= 0) return false;
        return true;
    }

    private int readByte() { if (hasNextByte()) return buf[ptr++]; else return -1;}

    private boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}

    private void skip() { while(hasNextByte() && !isPrintableChar(buf[ptr])) ptr++;}

    public boolean hasNext() {skip(); 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();
        boolean minus = false;
        long num = readByte();

        if(num == '-'){
            num = 0;
            minus = true;
        }else if (num < '0' || '9' < num){
            throw new NumberFormatException();
        }else{
            num -= '0';
        }

        while(true){
            int b = readByte();
            if('0' <= b && b <= '9')
                num = num * 10 + (b - '0');
            else if(b == -1 || !isPrintableChar(b))
                return minus ? -num : num;
            else
                throw new NoSuchElementException();
        }
    }

    public int nextInt() {
        long num = nextLong();
        if (num < Integer.MIN_VALUE || Integer.MAX_VALUE < num)
            throw new NumberFormatException();
        return (int)num;
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }

    public char nextChar() {
        if (!hasNext()) throw new NoSuchElementException();
        return (char)readByte();
    }

    public String nextLine() {
        while (hasNextByte() && (buf[ptr] == '\n' || buf[ptr] == '\r')) ptr++;
        if (!hasNextByte()) throw new NoSuchElementException();

        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (b != '\n' && b != '\r') {
            sb.appendCodePoint(b);
            b = readByte();
        }

        return sb.toString();
    }

    public int[] nextIntArray(int n) {
        int[] res = new int[n];
        for (int i=0; i<n; i++) res[i] = nextInt();
        return res;
    }

    public char[] nextCharArray(int n) {
        char[] res = new char[n];
        for (int i=0; i<n; i++) res[i] = nextChar();
        return res;
    }

    public void close() {try{ in.close();}catch(IOException e){ e.printStackTrace();}};
}
0