結果

問題 No.55 正方形を描くだけの簡単なお仕事です。
ユーザー yuya178yuya178
提出日時 2017-09-25 22:13:39
言語 Java21
(openjdk 21)
結果
AC  
実行時間 100 ms / 5,000 ms
コード長 7,128 bytes
コンパイル時間 2,695 ms
コンパイル使用メモリ 94,136 KB
実行使用メモリ 40,248 KB
最終ジャッジ日時 2024-04-26 21:49:29
合計ジャッジ時間 5,445 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 89 ms
39,768 KB
testcase_01 AC 69 ms
37,780 KB
testcase_02 AC 95 ms
40,148 KB
testcase_03 AC 87 ms
39,924 KB
testcase_04 AC 69 ms
37,700 KB
testcase_05 AC 67 ms
37,928 KB
testcase_06 AC 69 ms
37,768 KB
testcase_07 AC 69 ms
37,636 KB
testcase_08 AC 70 ms
38,136 KB
testcase_09 AC 69 ms
38,168 KB
testcase_10 AC 70 ms
37,516 KB
testcase_11 AC 90 ms
39,932 KB
testcase_12 AC 70 ms
37,636 KB
testcase_13 AC 89 ms
40,088 KB
testcase_14 AC 90 ms
39,880 KB
testcase_15 AC 69 ms
38,032 KB
testcase_16 AC 100 ms
39,940 KB
testcase_17 AC 69 ms
38,356 KB
testcase_18 AC 91 ms
40,248 KB
testcase_19 AC 69 ms
38,076 KB
testcase_20 AC 88 ms
40,136 KB
testcase_21 AC 89 ms
39,884 KB
testcase_22 AC 88 ms
39,556 KB
testcase_23 AC 94 ms
39,688 KB
testcase_24 AC 92 ms
40,024 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

public class Main {
    static InputStream is;
    static PrintWriter out;
    static String INPUT = "";
    
    static void solve()
    {
        int[][] a = new int[4][4];
        for(int i=0; i<3; i++){
            a[i][0] = ni();
            a[i][1] = ni();
        }
        int[][] b = new int[4][4];
        for(int i=0; i<3; i++){
            b[i][0] = -a[i][0]+a[(i+1)%3][0];
            b[i][1] = -a[i][1]+a[(i+1)%3][1];
        }
        int[] d = new int[2];
        for(int i=0; i<2; i++){
            for(int j=i+1; j<3; j++){
                int c = b[i][0]*b[j][0]+b[i][1]*b[j][1];
                if(c==0 && b[i][0]*b[i][0]+b[i][1]*b[i][1] == b[j][0]*b[j][0]+b[j][1]*b[j][1]){
                    d[0]=i;
                    d[1]=j;
                }
            }
        }
        if(d[0]==0 && d[1]==0){
            out.println(-1);
            return;
        }
        if(d[0]==0 && d[1]==1){
            out.println((a[0][0]+b[1][0])+" "+(a[0][1]+b[1][1]));
            return;
        }
        if(d[0]==0 && d[1] == 2){
            out.println((a[1][0]-b[2][0])+" "+(a[1][1]-b[2][1]));
            return;
        }
        if(d[0]==1 && d[1] == 2){
            out.println((a[0][0]-b[1][0])+" "+(a[0][1]-b[1][1]));
        }
    }

    public static int[] sieveEratosthenes(int n) {
        if (n <= 32) {
            int[] primes = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };
            for (int i = 0; i < primes.length; i++) {
                if (n < primes[i]) {
                    return Arrays.copyOf(primes, i);
                }
            }
            return primes;
        }

        int u = n + 32;
        double lu = Math.log(u);
        int[] ret = new int[(int) (u / lu + u / lu / lu * 1.5)];
        ret[0] = 2;
        int pos = 1;

        int[] isnp = new int[(n + 1) / 32 / 2 + 1];
        int sup = (n + 1) / 32 / 2 + 1;

        int[] tprimes = { 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };
        for (int tp : tprimes) {
            ret[pos++] = tp;
            int[] ptn = new int[tp];
            for (int i = (tp - 3) / 2; i < tp << 5; i += tp)
                ptn[i >> 5] |= 1 << (i & 31);
            for (int j = 0; j < sup; j += tp) {
                for (int i = 0; i < tp && i + j < sup; i++) {
                    isnp[j + i] |= ptn[i];
                }
            }
        }

        // 3,5,7
        // 2x+3=n
        int[] magic = { 0, 1, 23, 2, 29, 24, 19, 3, 30, 27, 25, 11, 20, 8, 4, 13, 31, 22, 28, 18, 26, 10, 7, 12, 21, 17,
                9, 6, 16, 5, 15, 14 };
        int h = n / 2;
        for (int i = 0; i < sup; i++) {
            for (int j = ~isnp[i]; j != 0; j &= j - 1) {
                int pp = i << 5 | magic[(j & -j) * 0x076be629 >>> 27];
                int p = 2 * pp + 3;
                if (p > n)
                    break;
                ret[pos++] = p;
                if ((long) p * p > n)
                    continue;
                for (int q = (p * p - 3) / 2; q <= h; q += p)
                    isnp[q >> 5] |= 1 << q;
            }
        }

        return Arrays.copyOf(ret, pos);
    }
    
    public static void main(String[] args) throws Exception
    {
        long S = System.currentTimeMillis();
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        
        solve();
        out.flush();
        long G = System.currentTimeMillis();
        tr(G-S+"ms");
    }


    
    private static boolean eof()
    {
        if(lenbuf == -1)return true;
        int lptr = ptrbuf;
        while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
        
        try {
            is.mark(1000);
            while(true){
                int b = is.read();
                if(b == -1){
                    is.reset();
                    return true;
                }else if(!isSpaceChar(b)){
                    is.reset();
                    return false;
                }
            }
        } catch (IOException e) {
            return true;
        }
    }
    
    private static byte[] inbuf = new byte[1024];
    static int lenbuf = 0, ptrbuf = 0;
    
    private static int readByte()
    {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        }
        return inbuf[ptrbuf++];
    }
    
    private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
//  private static boolean isSpaceChar(int c) { return !(c >= 32 && c <= 126); }
    private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
    
    private static double nd() { return Double.parseDouble(ns()); }
    private static char nc() { return (char)skip(); }
    
    private static String ns()
    {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b))){
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    
    private static char[] ns(int n)
    {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }
    
    private static char[][] nm(int n, int m)
    {
        char[][] map = new char[n][];
        for(int i = 0;i < n;i++)map[i] = ns(m);
        return map;
    }
    
    private static int[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private static int ni()
    {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static long nl()
    {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }

    private static int[] nsi(){
        char[] s = ns().toCharArray();
        int[] a = new int[s.length];
        for(int j = 0; j < s.length; j++){
           a[j] = s[j] - '0';
        }
        return a;
    }
}
0