#824128 (Java21) No.2158 X日後に全完するhibit君

提出ソース
結果

問題	No.2158 X日後に全完するhibit君
ユーザー	uwi
提出日時	2022-12-09 22:12:05
言語	Java21 (openjdk 21)
結果	AC
実行時間	1,783 ms / 2,000 ms
コード長	14,844 bytes
コンパイル時間	6,072 ms
コンパイル使用メモリ	92,740 KB
実行使用メモリ	50,160 KB
最終ジャッジ日時	2024-10-14 22:10:19
合計ジャッジ時間	15,797 ms
ジャッジサーバーID （参考情報）	judge3 / judge5
このコードへのチャレンジ
（要ログイン）
テストケース

テストケース表示
入力	結果	実行時間実行使用メモリ
testcase_00	AC	94 ms 38,092 KB
testcase_01	AC	72 ms 37,584 KB
testcase_02	AC	1,285 ms 48,320 KB
testcase_03	AC	75 ms 37,756 KB
testcase_04	AC	94 ms 38,268 KB
testcase_05	AC	71 ms 37,668 KB
testcase_06	AC	1,316 ms 48,472 KB
testcase_07	AC	73 ms 37,824 KB
testcase_08	AC	222 ms 46,516 KB
testcase_09	AC	192 ms 46,088 KB
testcase_10	AC	69 ms 37,776 KB
testcase_11	AC	345 ms 47,408 KB
testcase_12	AC	92 ms 38,384 KB
testcase_13	AC	131 ms 42,276 KB
testcase_14	AC	304 ms 46,772 KB
testcase_15	AC	70 ms 37,908 KB
testcase_16	AC	69 ms 37,280 KB
testcase_17	AC	69 ms 37,332 KB
testcase_18	AC	90 ms 37,960 KB
testcase_19	AC	281 ms 50,160 KB
testcase_20	AC	89 ms 37,928 KB
testcase_21	AC	91 ms 39,892 KB
testcase_22	AC	100 ms 39,036 KB
testcase_23	AC	76 ms 37,300 KB
testcase_24	AC	1,783 ms 49,424 KB
testcase_25	AC	68 ms 37,588 KB
testcase_26	AC	1,560 ms 49,200 KB
testcase_27	AC	79 ms 37,768 KB
権限があれば一括ダウンロードができます
ソースコード

raw source code
package contest221209;

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

public class F {
	InputStream is;
	FastWriter out;

	String INPUT = "";

	public void solve()
	{
		int n = ni(), K = ni();
		int[][] pst = nmi(n, 3);

		// min
		{
			int first = 0;
			int second = 0;
			for(int i = 0;i < n;i++){
				first += pst[i][1];
				second += pst[i][2];
			}
			if(first <= 60){
				out.print(1 + " ");
			}else if(second <= 60){
				out.print(K+2 + " ");
			}else{
				out.println(-1);
				return;
			}
		}

		// max
		{
			int[] nums = new int[n+1];
			for(int i = 0;i < n;i++)nums[i] = pst[i][0] + 1;
			nums[n] = K+2;
			Denom denom = new Denom(nums);

			int[] dp = new int[denom.all()];
			for(int i = denom.all()-1;i >= 0;i--){
				int[] cur = denom.dec(i);
				dp[i] = 0;
				inner:
				for(int j = 0;j < 1<<n;j++){
					int[] nex = Arrays.copyOf(cur, n+1);
					int sum = 0;
					for(int k = 0;k < n;k++){
						if(j<<~k<0){
							nex[k]++;
							sum += pst[k][1];
							if(nex[k] >= nums[k]){
								continue inner;
							}
							if(nums[k] - cur[k] - 1 <= 0)continue inner;
						}else{
							sum += pst[k][2];
							if(cur[k] - Math.min(K, cur[n]) <= 0)continue inner;
						}
					}
					nex[n] = Math.min(nex[n]+1, K+1);
					if(sum <= 60) {
						dp[i] = Math.max(dp[i], 1);
					}else {
						dp[i] = Math.max(dp[i], dp[denom.ind(nex)] + 1);
					}
				}
			}
			out.print(dp[0] + " ");
		}

		int[] nums = new int[n+1];
		for(int i = 0;i < n;i++)nums[i] = pst[i][0] + 1;
		nums[n] = K+2;
		Denom denom = new Denom(nums);

		double[] E = new double[denom.all()];
		for(int i = denom.all()-1;i >= 0;i--){
			int[] cur = denom.dec(i);
			double L = 1;
			double R = 1;
			inner:
			for(int j = 0;j < 1<<n;j++){
				int[] nex = Arrays.copyOf(cur, n+1);
				double p = 1;
				int sum = 0;
				for(int k = 0;k < n;k++){
					int den = nums[k] - 1 - Math.min(K, cur[n]);
					if(j<<~k<0){
						nex[k]++;
						sum += pst[k][1];
						if(nex[k] >= nums[k]){
							continue inner;
						}
						p *= (double)(nums[k] - cur[k] - 1) / den;
					}else{
						sum += pst[k][2];
						p *= (double)(cur[k] - Math.min(K, cur[n])) / den;
					}
				}
//				tr(j, p);
				nex[n] = Math.min(nex[n]+1, K+1);
				if(sum <= 60){
				}else {
					if (Arrays.equals(cur, nex)) {
						L -= p;
					} else {
						R += E[denom.ind(nex)] * p;
					}
				}
			}
			// 0.5で(3,2,2), 0.5でOK
			// 1*0.5 + 1 = 1.5?
//			tr(cur, L, R, R/L);
			E[i] = R/L;
		}
		out.println(E[0], 14);
	}

	public static class Denom {
		int[] a;
		int[] ia;

		Denom(int... ia) {
			this.ia = ia;
			int n = ia.length;
			a = new int[n + 1];
			a[0] = 1;
			for (int i = 0; i < n; i++) {
				a[i + 1] = a[i] * ia[i];
			}
		}

		int[] dec(int code) {
			int[] ret = new int[a.length - 1];
			for (int i = 0; i < a.length - 1; i++) {
				ret[i] = code % a[i + 1] / a[i];
			}
			return ret;
		}

		int ind(int... x) {
			assert x.length == ia.length;
			int ret = 0;
			for (int i = 0; i < x.length; i++) {
				ret += x[i] * a[i];
			}
			return ret;
		}

		boolean in(int code, int which, int plus) {
			int v = v(code, which);
			return 0 <= v + plus && v + plus < ia[which];
		}

		int v(int code, int which) {
			return code / a[which] % ia[which];
		}

		int add(int code, int which, int plus) {
			return code + a[which] * plus;
		}

		int update(int code, int which, int val) {
			return code + (-code / a[which] % ia[which] + val) * a[which];
		}

		int all() {
			return a[a.length - 1];
		}
	}


		public static void main(String[] args) {
		new F().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[][] 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[] 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 write(IntUnaryOperator f, int... xs)
		{
			boolean first = true;
			for(int x : xs) {
				if (!first) write(' ');
				first = false;
				write(f.applyAsInt(x));
			}
			return this;
		}

		public FastWriter write(LongUnaryOperator f, long... xs)
		{
			boolean first = true;
			for(long x : xs) {
				if (!first) write(' ');
				first = false;
				write(f.applyAsLong(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(IntUnaryOperator f, int... xs) { return write(f, xs).writeln(); }
		public FastWriter writeln(LongUnaryOperator f, long... xs) { return write(f, 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 print(IntUnaryOperator f, int... xs) { return write(f, xs); }
		public FastWriter print(LongUnaryOperator f, long... xs) { return write(f, xs); }
		public FastWriter println(int... xs) { return writeln(xs); }
		public FastWriter println(long... xs) { return writeln(xs); }
		public FastWriter println(IntUnaryOperator f, int... xs) { return writeln(f, xs); }
		public FastWriter println(LongUnaryOperator f, long... xs) { return writeln(f, 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)); }
}
yukicoder

結果

テストケース

ソースコード
