結果

問題 No.635 自然門松列
ユーザー yuya178yuya178
提出日時 2018-01-19 23:12:47
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 6,423 bytes
コンパイル時間 2,291 ms
コンパイル使用メモリ 83,516 KB
実行使用メモリ 37,008 KB
最終ジャッジ日時 2024-06-06 19:27:19
合計ジャッジ時間 4,277 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 41 ms
37,000 KB
testcase_01 AC 43 ms
36,896 KB
testcase_02 AC 42 ms
36,836 KB
testcase_03 AC 42 ms
36,756 KB
testcase_04 AC 44 ms
36,816 KB
testcase_05 AC 46 ms
37,008 KB
testcase_06 AC 44 ms
36,812 KB
testcase_07 AC 46 ms
36,556 KB
testcase_08 AC 44 ms
36,856 KB
testcase_09 AC 43 ms
36,624 KB
testcase_10 WA -
testcase_11 AC 43 ms
36,940 KB
testcase_12 AC 45 ms
36,592 KB
testcase_13 AC 44 ms
36,644 KB
testcase_14 AC 43 ms
36,784 KB
testcase_15 WA -
testcase_16 AC 43 ms
36,836 KB
testcase_17 AC 44 ms
36,600 KB
testcase_18 AC 45 ms
36,496 KB
testcase_19 AC 44 ms
36,476 KB
testcase_20 AC 43 ms
36,572 KB
testcase_21 AC 46 ms
36,808 KB
testcase_22 AC 45 ms
36,972 KB
testcase_23 AC 43 ms
36,452 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import java.math.*;
// import java.awt.Point;
 
public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";
 
    long MOD = 1_000_000_007;
    long inf = Long.MAX_VALUE;

    void solve(){ 
        int n = ni();
        outer:
        for(int i = 0; i < n; i++){
            long x1 = nl();
            long x2 = nl();
            long x3 = nl();
            long y1 = nl();
            long y2 = nl();
            long y3 = nl();
            if(x2>x1&&x2>x3&&x1!=x3){
                out.println("YES");
                continue outer;
            }
            else if(x2<x1&&x2<x3&&x1!=x3){
                out.println("YES");
                continue outer;
            }
            else if(x1!=x2 && x2!=x3 && x1!=x3){
                double a = y1!=y2 ? (double)(x2-x1)/(y1-y2) : -1;
                double b = y2!=y3 ? (double)(x3-x2)/(y2-y3) : -1;
                double c = y3!=y1 ? (double)(x1-x3)/(y3-y1) : -1;
                if((a<=0&&b<=0&&c<=0)){
                    out.println("NO");
                    continue outer;
                }
                else if((x2-x1)*(y2-y3) == (x3-x2)*(y1-y2) && (x2-x1)*(y3-y1) == (x1-x3)*(y1-y2) && (x3-x2)*(y3-y1)==(x1-x3)*(y2-y3)){
                    out.println("NO");
                    continue outer;
                }
                else{
                    out.println("YES");
                    continue outer;
                }
            }
            else if(x1==x2 && x2==x3){
                if(y1==y2 || y2== y3 || y1==y3){
                    out.println("NO");
                    continue outer;
                }
                else{
                    if(y2<y1&&y2>y3){
                        out.println("NO");
                        continue outer;
                    }
                    else if(y2>y1 && y2<y3){
                        out.println("NO");
                        continue outer;
                    }
                    else{
                        out.println("YES");
                        continue outer;
                    }
                }
            }
            else{
                if(x1==x2 && y1==y2){
                    out.println("NO");
                    continue outer;
                }
                else if(x2==x3 && y2==y3){
                    out.println("NO");
                    continue outer;
                }
                else if(x1==x3 && y1==y3){
                    out.println("NO");
                    continue outer;
                }
                else{
                    double a = y1!=y2 ? (double)(x2-x1)/(y1-y2) : -1;
                    double b = y2!=y3 ? (double)(x3-x2)/(y2-y3) : -1;
                    double c = y3!=y1 ? (double)(x1-x3)/(y3-y1) : -1;
                    if((a<=0&&b<=0&&c<=0)){
                        out.println("NO");
                        continue outer;
                    }
                    else if((x2-x1)*(y2-y3) == (x3-x2)*(y1-y2) && (x2-x1)*(y3-y1) == (x1-x3)*(y1-y2) && (x3-x2)*(y3-y1)==(x1-x3)*(y2-y3)){
                        out.println("NO");
                        continue outer;
                    }
                    else{
                        out.println("YES");
                        continue outer;
                    }
                }   
            }
        }        
    }


    void run() throws Exception
    {
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        long s = System.currentTimeMillis();
        solve();
        out.flush();
        if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
    }
    
    public static void main(String[] args) throws Exception { new Main().run(); }
    
    private byte[] inbuf = new byte[1024];
    private int lenbuf = 0, ptrbuf = 0;
    
    private 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 boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
    private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
    
    private double nd() { return Double.parseDouble(ns()); }
    private char nc() { return (char)skip(); }
    
    private String ns()
    {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b) && b != ' ')){
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    
    private 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 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 int[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private 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 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) { System.out.println(Arrays.deepToString(o)); }
 
}
0