結果
| 問題 | No.622 点と三角柱の内外判定 |
| ユーザー |
 uwi
|
| 提出日時 | 2017-12-22 00:11:21 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 56 ms / 1,500 ms |
| コード長 | 4,872 bytes |
| コンパイル時間 | 4,190 ms |
| コンパイル使用メモリ | 88,872 KB |
| 実行使用メモリ | 50,456 KB |
| 最終ジャッジ日時 | 2024-12-17 22:57:28 |
| 合計ジャッジ時間 | 6,536 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 32 |
ソースコード
package adv2017;import java.io.ByteArrayInputStream;import java.io.IOException;import java.io.InputStream;import java.io.PrintWriter;import java.util.Arrays;import java.util.InputMismatchException;import java.util.Random;public class N622 {InputStream is;PrintWriter out;String INPUT = "";void solve(){long[][] co = new long[4][];for(int i = 0;i < 4;i++){co[i] = new long[3];for(int j = 0;j < 3;j++){co[i][j] = nl();}}double[] a = new double[]{co[1][0] - co[0][0],co[1][1] - co[0][1],co[1][2] - co[0][2]};double[] b = new double[]{co[2][0] - co[0][0],co[2][1] - co[0][1],co[2][2] - co[0][2]};double[] nor = cross(a, b);double[] d = new double[]{co[3][0] - co[0][0],co[3][1] - co[0][1],co[3][2] - co[0][2]};// (d+nor*k)*nor = 0// d*nor + nor*nor*k = 0double nnor = 0;for(double u : nor)nnor += u*u;double dnor = 0;for(int i = 0;i < 3;i++){dnor += d[i] * nor[i];}double k = -dnor / nnor;for(int i = 0;i < 3;i++){d[i] += nor[i] * k;}// aA+bB=d// a(ax, ay, az) + b(bx, by, bz) = (dx, dy, dz)Random gen = new Random();double[][] M = new double[2][2];double[] v = new double[2];for(int i = 0;i < 2;i++){double[] cs = new double[3];double as = 0, bs = 0;double ds = 0;for(int j = 0;j < 3;j++){cs[j] = gen.nextDouble();as += a[j] * cs[j];bs += b[j] * cs[j];ds += d[j] * cs[j];}M[i][0] = as;M[i][1] = bs;v[i] = ds;}double[] res = solve2x2(M, v);if(0 <= res[0] && res[0] <= 1 && 0 <= res[1] && res[1] <= 1 && res[0]+res[1] <= 1){out.println("YES");}else{out.println("NO");}}public static double[] solve2x2(double[][] M, double[] V){double EPS = 1E-10;double det = M[0][0]*M[1][1]-M[0][1]*M[1][0];if(Math.abs(det) < EPS)return null;return new double[]{(M[1][1]*V[0]-M[0][1]*V[1])/det,(-M[1][0]*V[0]+M[0][0]*V[1])/det};}public static double[] cross(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() 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");// Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){// @Override// public void run() {// long s = System.currentTimeMillis();// solve();// out.flush();// if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");// }// };// t.start();// t.join();}public static void main(String[] args) throws Exception { new N622().run(); }private byte[] inbuf = new byte[1024];public 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))){ // when nextLine, (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 int[] na(int n){int[] a = new int[n];for(int i = 0;i < n;i++)a[i] = ni();return a;}private long[] nal(int n){long[] a = new long[n];for(int i = 0;i < n;i++)a[i] = nl();return a;}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[][] nmi(int n, int m) {int[][] map = new int[n][];for(int i = 0;i < n;i++)map[i] = na(m);return map;}private int ni() { return (int)nl(); }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)); }}