結果
問題 | No.3031 (物理学)長距離相互作用 |
ユーザー | 37zigen |
提出日時 | 2017-08-07 14:15:20 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,273 bytes |
コンパイル時間 | 2,402 ms |
コンパイル使用メモリ | 84,532 KB |
実行使用メモリ | 54,476 KB |
最終ジャッジ日時 | 2024-06-07 14:58:19 |
合計ジャッジ時間 | 18,370 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | AC | 1,258 ms
54,020 KB |
testcase_05 | AC | 1,272 ms
53,784 KB |
testcase_06 | AC | 1,294 ms
53,876 KB |
testcase_07 | AC | 1,311 ms
54,136 KB |
testcase_08 | WA | - |
testcase_09 | AC | 1,291 ms
54,068 KB |
testcase_10 | AC | 1,267 ms
53,944 KB |
ソースコード
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 Main { InputStream is; PrintWriter out; String INPUT = ""; void solve() { double[] a = new double[8]; for (int i = 0; i < 8; i++) a[i] = nd(); double[] b = new double[8]; for (int i = 0; i < 8; i++) b[i] = nd(); double ret = 0; int Z = 100; double Q = 0; for (int x = -Z; x <= Z; x++) { for (int y = -Z; y <= Z; y++) { for (int z = -Z; z <= Z; z++) { for (int i = 0; i < 8; i++) { double xx = x, yy = y, zz = z; if (i << ~0 < 0) zz += 0.5; if (i << ~1 < 0) yy += 0.5; if (i << ~2 < 0) xx += 0.5; if (xx == 0 && yy == 0 && zz == 0) continue; double d = Math.sqrt(xx * xx + yy * yy + zz * zz); if (d > Z) continue; ret += a[i] / d; Q -= a[i]; } for (int i = 0; i < 8; i++) { double xx = x + 0.25, yy = y + 0.25, zz = z + 0.25; if (i << ~0 < 0) zz += 0.5; if (i << ~1 < 0) yy += 0.5; if (i << ~2 < 0) xx += 0.5; if (xx == 0 && yy == 0 && zz == 0) continue; double d = Math.sqrt(xx * xx + yy * yy + zz * zz); if (d > Z) continue; ret += b[i] / d; Q -= b[i]; } } } } ret += Q / Z; out.printf("%.6f\n", ret); } 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 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))) { // 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)); } }