結果
問題 | No.306 さいたま2008 |
ユーザー |
|
提出日時 | 2015-11-27 22:38:10 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 111 ms / 2,000 ms |
コード長 | 3,451 bytes |
コンパイル時間 | 4,058 ms |
コンパイル使用メモリ | 82,272 KB |
実行使用メモリ | 54,284 KB |
最終ジャッジ日時 | 2025-02-14 12:08:39 |
合計ジャッジ時間 | 7,778 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 26 |
ソースコード
package contest;import java.io.ByteArrayInputStream;import java.io.IOException;import java.io.InputStream;import java.io.PrintWriter;import java.util.Arrays;import java.util.InputMismatchException;public class Q853 {InputStream is;PrintWriter out;String INPUT = "";void solve(){double xa = -ni(), ya = ni();double xb = ni(), yb = ni();double[] il = interLines(xa, ya, xb, yb, 0, -100, 0, 10000);out.printf("%.14f\n", il[1]);}public static double[] interLines(double ax, double ay, double bx, double by, double cx, double cy, double dx, double dy){double eps = 1E-9;double aa = bx - ax;double cc = by - ay;double bb = cx - dx;double dd = cy - dy;double xx = cx - ax;double yy = cy - ay;double det = aa * dd - bb * cc;if(Math.abs(det) < eps)return null;double t = (dd * xx - bb * yy) / det;double u = (-cc * xx + aa * yy) / det;return new double[]{ax + (bx - ax) * t, ay + (by - ay) * t, t, u};}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 Q853().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))){ // 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 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)); }}