結果

問題 No.1319 最強とんがりコーン
ユーザー uwiuwi
提出日時 2020-12-16 01:45:03
言語 Java19
(openjdk 21)
結果
AC  
実行時間 307 ms / 2,000 ms
コード長 11,349 bytes
コンパイル時間 6,331 ms
コンパイル使用メモリ 93,772 KB
実行使用メモリ 57,076 KB
最終ジャッジ日時 2023-10-20 08:44:02
合計ジャッジ時間 23,997 ms
ジャッジサーバーID
(参考情報)
judge14 / judge15
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 302 ms
55,088 KB
testcase_01 AC 307 ms
57,076 KB
testcase_02 AC 212 ms
57,044 KB
testcase_03 AC 169 ms
57,048 KB
testcase_04 AC 301 ms
57,068 KB
testcase_05 AC 265 ms
56,996 KB
testcase_06 AC 222 ms
56,976 KB
testcase_07 AC 176 ms
57,044 KB
testcase_08 AC 227 ms
57,056 KB
testcase_09 AC 272 ms
57,068 KB
testcase_10 AC 131 ms
57,028 KB
testcase_11 AC 183 ms
57,048 KB
testcase_12 AC 232 ms
56,984 KB
testcase_13 AC 189 ms
57,052 KB
testcase_14 AC 139 ms
54,984 KB
testcase_15 AC 192 ms
57,044 KB
testcase_16 AC 146 ms
57,040 KB
testcase_17 AC 291 ms
57,068 KB
testcase_18 AC 153 ms
57,048 KB
testcase_19 AC 292 ms
57,036 KB
testcase_20 AC 300 ms
57,052 KB
testcase_21 AC 304 ms
57,068 KB
testcase_22 AC 304 ms
57,052 KB
testcase_23 AC 301 ms
57,052 KB
testcase_24 AC 298 ms
57,076 KB
testcase_25 AC 300 ms
57,068 KB
testcase_26 AC 302 ms
57,060 KB
testcase_27 AC 299 ms
56,992 KB
testcase_28 AC 303 ms
57,040 KB
testcase_29 AC 301 ms
57,048 KB
testcase_30 AC 304 ms
57,068 KB
testcase_31 AC 302 ms
57,052 KB
testcase_32 AC 215 ms
57,048 KB
testcase_33 AC 292 ms
57,036 KB
testcase_34 AC 295 ms
57,032 KB
testcase_35 AC 301 ms
57,076 KB
testcase_36 AC 299 ms
57,044 KB
testcase_37 AC 300 ms
57,068 KB
testcase_38 AC 298 ms
57,072 KB
testcase_39 AC 299 ms
57,068 KB
testcase_40 AC 183 ms
57,048 KB
testcase_41 AC 130 ms
56,984 KB
testcase_42 AC 137 ms
57,036 KB
testcase_43 AC 127 ms
57,024 KB
testcase_44 AC 136 ms
57,036 KB
testcase_45 AC 127 ms
57,040 KB
testcase_46 AC 254 ms
57,048 KB
testcase_47 AC 132 ms
57,024 KB
testcase_48 AC 184 ms
57,044 KB
testcase_49 AC 133 ms
57,032 KB
testcase_50 AC 130 ms
57,032 KB
testcase_51 AC 127 ms
57,000 KB
testcase_52 AC 129 ms
57,032 KB
testcase_53 AC 127 ms
57,044 KB
testcase_54 AC 148 ms
56,984 KB
testcase_55 AC 137 ms
57,020 KB
testcase_56 AC 128 ms
57,036 KB
testcase_57 AC 129 ms
57,024 KB
testcase_58 AC 130 ms
57,036 KB
testcase_59 AC 133 ms
56,996 KB
testcase_60 AC 113 ms
56,600 KB
testcase_61 AC 114 ms
56,312 KB
testcase_62 AC 114 ms
56,128 KB
testcase_63 AC 112 ms
56,368 KB
testcase_64 AC 220 ms
57,048 KB
testcase_65 AC 215 ms
55,004 KB
testcase_66 AC 114 ms
55,940 KB
testcase_67 AC 295 ms
57,028 KB
testcase_68 AC 278 ms
57,052 KB
testcase_69 AC 302 ms
57,052 KB
testcase_70 AC 132 ms
57,036 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

package adv2020;

import java.io.*;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Queue;
import java.util.function.DoubleUnaryOperator;

public class Day16 {
	InputStream is;
	FastWriter out;

	String INPUT = "";

	public void solve() {
		// 0140
		double R = nd(), H = nd(), D = nd();
		out.println(simpson(0, H, 1000000, x -> areaCircleInter(R*(H-x)/H, R*(H-x)/H, D)), 14);
	}

	public static double simpson(double l, double r, int k, DoubleUnaryOperator f)
	{
		double h = (r-l)/(2*k);
		double fo = 0, fe = 0;
		for(int i = 1;i <= 2*k-3;i+=2){
			fo += f.applyAsDouble(l+h*i);
			fe += f.applyAsDouble(l+h*(i+1));
		}
		return (f.applyAsDouble(l)+f.applyAsDouble(r)+4*(fo+f.applyAsDouble(r-h))+2*fe)*h/3;
	}

	public static double areaCircleInter(double r1, double r2, double d)
	{
		if(d >= r1 + r2){
			return 0;
		}else if(d > Math.abs(r1-r2)+1e-9){
			double t1 = Math.acos((r1*r1+d*d-r2*r2)/(2*r1*d));
			double t2 = Math.acos((r2*r2+d*d-r1*r1)/(2*r2*d));
			return t1*r1*r1+t2*r2*r2-r1*r1/2*Math.sin(2*t1)-r2*r2/2*Math.sin(2*t2);
		}else{
			double r = Math.min(r1, r2);
			return Math.PI*r*r;
		}
	}

	public static void main(String[] args) {
		new Day16().run();
	}

	public void run()
	{
		long S = System.currentTimeMillis();
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new FastWriter(System.out);

		solve();
		out.flush();
		long G = System.currentTimeMillis();
		tr(G-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();
	}

	private boolean eof()
	{
		if(lenbuf == -1)return true;
		int lptr = ptrbuf;
		while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;

		try {
			is.mark(1000);
			while(true){
				int b = is.read();
				if(b == -1){
					is.reset();
					return true;
				}else if(!isSpaceChar(b)){
					is.reset();
					return false;
				}
			}
		} catch (IOException e) {
			return true;
		}
	}

	private final 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 boolean isSpaceChar(int c) { return !(c >= 32 && 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))){
			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 long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		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();
		}
	}

	public static class FastWriter
	{
		private static final int BUF_SIZE = 1<<13;
		private final byte[] buf = new byte[BUF_SIZE];
		private final OutputStream out;
		private int ptr = 0;

		private FastWriter(){out = null;}

		public FastWriter(OutputStream os)
		{
			this.out = os;
		}

		public FastWriter(String path)
		{
			try {
				this.out = new FileOutputStream(path);
			} catch (FileNotFoundException e) {
				throw new RuntimeException("FastWriter");
			}
		}

		public FastWriter write(byte b)
		{
			buf[ptr++] = b;
			if(ptr == BUF_SIZE)innerflush();
			return this;
		}

		public FastWriter write(char c)
		{
			return write((byte)c);
		}

		public FastWriter write(char[] s)
		{
			for(char c : s){
				buf[ptr++] = (byte)c;
				if(ptr == BUF_SIZE)innerflush();
			}
			return this;
		}

		public FastWriter write(String s)
		{
			s.chars().forEach(c -> {
				buf[ptr++] = (byte)c;
				if(ptr == BUF_SIZE)innerflush();
			});
			return this;
		}

		private static int countDigits(int l) {
			if (l >= 1000000000) return 10;
			if (l >= 100000000) return 9;
			if (l >= 10000000) return 8;
			if (l >= 1000000) return 7;
			if (l >= 100000) return 6;
			if (l >= 10000) return 5;
			if (l >= 1000) return 4;
			if (l >= 100) return 3;
			if (l >= 10) return 2;
			return 1;
		}

		public FastWriter write(int x)
		{
			if(x == Integer.MIN_VALUE){
				return write((long)x);
			}
			if(ptr + 12 >= BUF_SIZE)innerflush();
			if(x < 0){
				write((byte)'-');
				x = -x;
			}
			int d = countDigits(x);
			for(int i = ptr + d - 1;i >= ptr;i--){
				buf[i] = (byte)('0'+x%10);
				x /= 10;
			}
			ptr += d;
			return this;
		}

		private static int countDigits(long l) {
			if (l >= 1000000000000000000L) return 19;
			if (l >= 100000000000000000L) return 18;
			if (l >= 10000000000000000L) return 17;
			if (l >= 1000000000000000L) return 16;
			if (l >= 100000000000000L) return 15;
			if (l >= 10000000000000L) return 14;
			if (l >= 1000000000000L) return 13;
			if (l >= 100000000000L) return 12;
			if (l >= 10000000000L) return 11;
			if (l >= 1000000000L) return 10;
			if (l >= 100000000L) return 9;
			if (l >= 10000000L) return 8;
			if (l >= 1000000L) return 7;
			if (l >= 100000L) return 6;
			if (l >= 10000L) return 5;
			if (l >= 1000L) return 4;
			if (l >= 100L) return 3;
			if (l >= 10L) return 2;
			return 1;
		}

		public FastWriter write(long x)
		{
			if(x == Long.MIN_VALUE){
				return write("" + x);
			}
			if(ptr + 21 >= BUF_SIZE)innerflush();
			if(x < 0){
				write((byte)'-');
				x = -x;
			}
			int d = countDigits(x);
			for(int i = ptr + d - 1;i >= ptr;i--){
				buf[i] = (byte)('0'+x%10);
				x /= 10;
			}
			ptr += d;
			return this;
		}

		public FastWriter write(double x, int precision)
		{
			if(x < 0){
				write('-');
				x = -x;
			}
			x += Math.pow(10, -precision)/2;
			//		if(x < 0){ x = 0; }
			write((long)x).write(".");
			x -= (long)x;
			for(int i = 0;i < precision;i++){
				x *= 10;
				write((char)('0'+(int)x));
				x -= (int)x;
			}
			return this;
		}

		public FastWriter writeln(char c){
			return write(c).writeln();
		}

		public FastWriter writeln(int x){
			return write(x).writeln();
		}

		public FastWriter writeln(long x){
			return write(x).writeln();
		}

		public FastWriter writeln(double x, int precision){
			return write(x, precision).writeln();
		}

		public FastWriter write(int... xs)
		{
			boolean first = true;
			for(int x : xs) {
				if (!first) write(' ');
				first = false;
				write(x);
			}
			return this;
		}

		public FastWriter write(long... xs)
		{
			boolean first = true;
			for(long x : xs) {
				if (!first) write(' ');
				first = false;
				write(x);
			}
			return this;
		}

		public FastWriter writeln()
		{
			return write((byte)'\n');
		}

		public FastWriter writeln(int... xs)
		{
			return write(xs).writeln();
		}

		public FastWriter writeln(long... xs)
		{
			return write(xs).writeln();
		}

		public FastWriter writeln(char[] line)
		{
			return write(line).writeln();
		}

		public FastWriter writeln(char[]... map)
		{
			for(char[] line : map)write(line).writeln();
			return this;
		}

		public FastWriter writeln(String s)
		{
			return write(s).writeln();
		}

		private void innerflush()
		{
			try {
				out.write(buf, 0, ptr);
				ptr = 0;
			} catch (IOException e) {
				throw new RuntimeException("innerflush");
			}
		}

		public void flush()
		{
			innerflush();
			try {
				out.flush();
			} catch (IOException e) {
				throw new RuntimeException("flush");
			}
		}

		public FastWriter print(byte b) { return write(b); }
		public FastWriter print(char c) { return write(c); }
		public FastWriter print(char[] s) { return write(s); }
		public FastWriter print(String s) { return write(s); }
		public FastWriter print(int x) { return write(x); }
		public FastWriter print(long x) { return write(x); }
		public FastWriter print(double x, int precision) { return write(x, precision); }
		public FastWriter println(char c){ return writeln(c); }
		public FastWriter println(int x){ return writeln(x); }
		public FastWriter println(long x){ return writeln(x); }
		public FastWriter println(double x, int precision){ return writeln(x, precision); }
		public FastWriter print(int... xs) { return write(xs); }
		public FastWriter print(long... xs) { return write(xs); }
		public FastWriter println(int... xs) { return writeln(xs); }
		public FastWriter println(long... xs) { return writeln(xs); }
		public FastWriter println(char[] line) { return writeln(line); }
		public FastWriter println(char[]... map) { return writeln(map); }
		public FastWriter println(String s) { return writeln(s); }
		public FastWriter println() { return writeln(); }
	}

	public static void trnz(int... o)
	{
		for(int i = 0;i < o.length;i++)if(o[i] != 0)System.out.print(i+":"+o[i]+" ");
		System.out.println();
	}

	// print ids which are 1
	public static void trt(long... o)
	{
		Queue<Integer> stands = new ArrayDeque<>();
		for(int i = 0;i < o.length;i++){
			for(long x = o[i];x != 0;x &= x-1)stands.add(i<<6|Long.numberOfTrailingZeros(x));
		}
		System.out.println(stands);
	}

	public static void tf(boolean... r)
	{
		for(boolean x : r)System.out.print(x?'#':'.');
		System.out.println();
	}

	public static void tf(boolean[]... b)
	{
		for(boolean[] r : b) {
			for(boolean x : r)System.out.print(x?'#':'.');
			System.out.println();
		}
		System.out.println();
	}

	public void tf(long[]... b)
	{
		if(INPUT.length() != 0) {
			for (long[] r : b) {
				for (long x : r) {
					for (int i = 0; i < 64; i++) {
						System.out.print(x << ~i < 0 ? '#' : '.');
					}
				}
				System.out.println();
			}
			System.out.println();
		}
	}

	public void tf(long... b)
	{
		if(INPUT.length() != 0) {
			for (long x : b) {
				for (int i = 0; i < 64; i++) {
					System.out.print(x << ~i < 0 ? '#' : '.');
				}
			}
			System.out.println();
		}
	}

	private void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
0