結果
問題 | No.635 自然門松列 |
ユーザー | yuya178 |
提出日時 | 2018-01-19 22:56:51 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,406 bytes |
コンパイル時間 | 2,668 ms |
コンパイル使用メモリ | 80,944 KB |
実行使用メモリ | 50,280 KB |
最終ジャッジ日時 | 2024-06-06 19:23:58 |
合計ジャッジ時間 | 4,827 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 48 ms
36,472 KB |
testcase_01 | AC | 47 ms
36,104 KB |
testcase_02 | AC | 47 ms
36,768 KB |
testcase_03 | AC | 48 ms
36,472 KB |
testcase_04 | AC | 47 ms
36,716 KB |
testcase_05 | AC | 49 ms
36,200 KB |
testcase_06 | AC | 51 ms
36,680 KB |
testcase_07 | AC | 49 ms
36,720 KB |
testcase_08 | AC | 48 ms
36,832 KB |
testcase_09 | AC | 49 ms
36,728 KB |
testcase_10 | WA | - |
testcase_11 | AC | 48 ms
36,424 KB |
testcase_12 | AC | 49 ms
36,700 KB |
testcase_13 | AC | 49 ms
36,200 KB |
testcase_14 | AC | 50 ms
36,224 KB |
testcase_15 | WA | - |
testcase_16 | AC | 47 ms
36,712 KB |
testcase_17 | AC | 49 ms
36,440 KB |
testcase_18 | AC | 47 ms
36,896 KB |
testcase_19 | AC | 49 ms
36,196 KB |
testcase_20 | AC | 49 ms
36,456 KB |
testcase_21 | AC | 48 ms
36,496 KB |
testcase_22 | AC | 50 ms
36,436 KB |
testcase_23 | AC | 50 ms
36,204 KB |
ソースコード
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(); 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"); } else if(x2<x1&&x2<x3&&x1!=x3){ out.println("YES"); } 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==b && b==c) || (a<=0&&b<=0&&c<=0)){ out.println("NO"); } else out.println("YES"); } else if(x1==x2 && x2==x3){ if(y1==y2 || y2== y3 || y1==y3){ out.println("NO"); } else{ if(y2<y1&&y2>y3){ out.println("NO"); } else if(y2>y1 && y2<y3){ out.println("NO"); } else{ out.println("YES"); } } } else{ if(x1==x2 && y1==y2){ out.println("NO"); } else if(x2==x3 && y2==y3){ out.println("NO"); } else if(x1==x3 && y1==y3){ out.println("NO"); } 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==b && b==c) || (a<=0&&b<=0&&c<=0)){ out.println("NO"); } else out.println("YES"); } } } } 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)); } }