結果
問題 | No.764 浮動点 |
ユーザー |
|
提出日時 | 2018-12-12 00:11:04 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 240 ms / 1,500 ms |
コード長 | 3,816 bytes |
コンパイル時間 | 3,768 ms |
コンパイル使用メモリ | 82,632 KB |
実行使用メモリ | 55,104 KB |
最終ジャッジ日時 | 2024-09-24 17:36:16 |
合計ジャッジ時間 | 10,383 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 23 |
ソースコード
package adv2018;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 Day12 {InputStream is;PrintWriter out;String INPUT = "";void solve(){int n = ni();int D = ni();int[] L = na(n+1);for(int i = 1;i <= n;i++) {long[] l = get(L, 0, i);long[] r = get(L, i, n+1);out.printf("%.14f\n", cand(l[1], r[1], D) - cand(l[0], r[1], D) - cand(l[1], r[0], D) + cand(l[0], r[0], D));}}double cand(double a, double b, double d){if(a+b <= d)return 0;if(d <= Math.abs(a-b)) {return Math.PI*Math.min(a, b)*Math.min(a,b);}double at = Math.acos((a*a+d*d-b*b)/(2*a*d));double bt = Math.acos((b*b+d*d-a*a)/(2*b*d));return a*a*at - a*a*Math.sin(at*2)/2 + b*b*bt - b*b*Math.sin(bt*2)/2;}long[] get(int[] L, int l, int r){long s = 0;long max = 0;for(int j = l;j < r;j++) {s += L[j];max = Math.max(max, L[j]);}long inf = Math.max(0, max-(s-max));return new long[] {inf, s};}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 Day12().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)); }}