結果
問題 |
No.622 点と三角柱の内外判定
|
ユーザー |
|
提出日時 | 2020-03-24 19:16:01 |
言語 | Java (openjdk 23) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,532 bytes |
コンパイル時間 | 2,683 ms |
コンパイル使用メモリ | 78,128 KB |
実行使用メモリ | 50,204 KB |
最終ジャッジ日時 | 2024-12-31 15:17:42 |
合計ジャッジ時間 | 5,993 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 17 WA * 15 |
ソースコード
import java.io.FileNotFoundException; import java.io.IOException; import java.io.InputStream; import java.util.Arrays; import java.util.NoSuchElementException; public class Main { public static void main(String[] args) throws FileNotFoundException { long t = System.currentTimeMillis(); new Main().run(); System.err.println(System.currentTimeMillis() - t); } double dot(double[] a,double[] b) { double ret=0; for(int i=0;i<3;++i)ret+=a[i]*b[i]; return ret; } double norm(double[] a) { double ret=0; for(int i=0;i<a.length;++i)ret+=a[i]*a[i]; return Math.sqrt(ret); } //aをbに射影 double project(double[] a,double[] b) { return dot(a,b)/norm(b); } double[] vector_product(double[] a,double[] b){ return new double[] {a[1]*b[2]-a[2]*b[1],a[2]*b[0]-a[0]*b[2],a[0]*b[1]-a[1]*b[0]}; } void run() { FastScanner sc = new FastScanner(); double[][] e=new double[3][3]; for(int i=0;i<3;++i) { for(int j=0;j<3;++j) { e[i][j]=sc.nextLong(); } } double[] v=new double[3]; for(int i=0;i<v.length;++i)v[i]=sc.nextInt(); for(int i=0;i<3;++i)v[i]-=e[2][i]; for(int i=0;i<3;++i) { for(int j=0;j<3;++j) { e[i][j]-=e[2][j]; } } e[2]=vector_product(e[0], e[1]); double[] coe=new double[3]; coe[0]=project(v, e[0])/norm(e[0]); coe[1]=project(v, e[1])/norm(e[1]); coe[2]=project(v, e[2])/norm(e[2]); System.out.println(0<=coe[0]&&0<=coe[1]&&coe[0]<=1&&coe[1]<=1&&(coe[0]+coe[1])<=1?"YES":"NO"); } static 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;} private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;} public boolean hasNext() { skipUnprintable(); 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() { return (int)nextLong(); } }