結果
| 問題 | No.622 点と三角柱の内外判定 |
| ユーザー |
 yuya178
|
| 提出日時 | 2017-12-22 05:26:47 |
| 言語 | Java21 (openjdk 21) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 5,742 bytes |
| コンパイル時間 | 2,267 ms |
| コンパイル使用メモリ | 80,908 KB |
| 実行使用メモリ | 48,176 KB |
| 最終ジャッジ日時 | 2024-05-09 18:47:54 |
| 合計ジャッジ時間 | 5,335 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge4 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 43 ms
42,584 KB |
| testcase_01 | TLE | - |
| testcase_02 | -- | - |
| testcase_03 | -- | - |
| testcase_04 | -- | - |
| testcase_05 | -- | - |
| testcase_06 | -- | - |
| testcase_07 | -- | - |
| testcase_08 | -- | - |
| testcase_09 | -- | - |
| testcase_10 | -- | - |
| testcase_11 | -- | - |
| testcase_12 | -- | - |
| testcase_13 | -- | - |
| testcase_14 | -- | - |
| testcase_15 | -- | - |
| testcase_16 | -- | - |
| testcase_17 | -- | - |
| testcase_18 | -- | - |
| testcase_19 | -- | - |
| testcase_20 | -- | - |
| testcase_21 | -- | - |
| testcase_22 | -- | - |
| testcase_23 | -- | - |
| testcase_24 | -- | - |
| testcase_25 | -- | - |
| testcase_26 | -- | - |
| testcase_27 | -- | - |
| testcase_28 | -- | - |
| testcase_29 | -- | - |
| testcase_30 | -- | - |
| testcase_31 | -- | - |
ソースコード
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;
int inf = Integer.MAX_VALUE;
void solve()
{
double[] a = new double[3];
double[] b = new double[3];
double[] c = new double[3];
double[] d = new double[3];
String[] s;
s = ns().split(" ");
for(int i = 0; i < 3; i++) a[i] = Double.parseDouble(s[i]);
s = ns().split(" ");
for(int i = 0; i < 3; i++) b[i] = Double.parseDouble(s[i]);
s = ns().split(" ");
for(int i = 0; i < 3; i++) c[i] = Double.parseDouble(s[i]);
s = ns().split(" ");
for(int i = 0; i < 3; i++) d[i] = Double.parseDouble(s[i]);
double[] ab = new double[]{a[0]-b[0], a[1]-b[1], a[2]-b[2]};
double[] ac = new double[]{a[0]-c[0], a[1]-c[1], a[2]-c[2]};
double[] w = new double[3];
for(int i = 0; i < 3; i++){
w[i] = ab[(i+1)%3]*ac[(i+2)%3]-ab[(i+2)%3]*ac[(i+1)%3];
}
double left = -inf;
double right = inf;
while(true){
double x = (left+left+right)/3;
double y = (left+right+right)/3;
double res1 = go(x,ab,ac,a,d,w);
double res2 = go(y,ab,ac,a,d,w);
if(res1 > res2) left = x;
else right = y;
if(Math.max(res1,res2)<1e-5) break;
}
double[] r = new double[3];
double[] dx = new double[3];
for(int i = 0; i < 3; i++){
dx[i] = d[i] + left*w[i];
}
r[0] = judge(a,b,dx);
r[1] = judge(b,c,dx);
r[2] = judge(c,a,dx);
if((r[0]>=0&&r[1]>=0&&r[2]>=0)||(r[0]<0&&r[1]<0&&r[2]<0)) out.println("YES");
else out.println("NO");
}
double go(double res, double[] ab, double[] ac, double[] a, double[] d, double[] w){
double[] adx = new double[3];
for(int i = 0; i < 3; i++){
adx[i] = d[i] + res*w[i] - a[i];
}
double det = 0;
for(int i = 0; i < 3; i++){
det += ab[i%3]*ac[(i+1)%3]*adx[(i+2)%3];
det -= ab[i%3]*ac[(i+2)%3]*adx[(i+4)%3];
}
return Math.abs(det);
}
double judge(double[] a, double[] b, double[] p){
double res = 0;
double[] ab = new double[]{a[0]-b[0], a[1]-b[1], a[2]-b[2]};
double[] bp = new double[]{b[0]-p[0], b[1]-p[1], b[2]-p[2]};
double[] w = new double[3];
for(int i = 0; i < 3; i++){
w[i] = ab[(i+1)%3]*bp[(i+2)%3]-ab[(i+2)%3]*bp[(i+1)%3];
}
return w[2];
}
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)); }
}