結果

提出番号 2148
提出者 uwi_
言語 Java
提出日時 2018-08-05 07:10:10
問題名 (66)Cut onion
結果 AC
点数 100%

テストケース

テストケース 結果 得点 実行時間 メモリ使用量
1 AC 100% 64ms 93616KB
2 AC 100% 60ms 92032KB
3 AC 100% 59ms 93168KB
4 AC 100% 60ms 93616KB
5 AC 100% 60ms 92720KB
6 AC 100% 60ms 93680KB
7 AC 100% 99ms 101664KB
8 AC 100% 70ms 95184KB
9 AC 100% 62ms 94384KB
10 AC 100% 87ms 98784KB
11 AC 100% 189ms 112272KB
12 AC 100% 192ms 113888KB
13 AC 100% 199ms 109536KB
14 AC 100% 174ms 117056KB
15 AC 100% 195ms 110688KB
16 AC 100% 200ms 114976KB
17 AC 100% 182ms 114944KB
18 AC 100% 198ms 112560KB
19 AC 100% 174ms 110608KB
20 AC 100% 190ms 113392KB

ソースコード

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 {
	static InputStream is;
	static PrintWriter out;
	static String INPUT = "";

	static void solve() {
		int n = ni(), K = ni(), B = ni();
		int[] a = na(n);
		int[] d = new int[1<<n];
		for(int i = 1;i < 1<<n;i++){
			d[i] = d[i&i-1] + a[Integer.numberOfTrailingZeros(i)];
		}
		int[][] dp = new int[K+1][1<<n];
		for(int i = 0;i <= K;i++){
			Arrays.fill(dp[i], 999999999);
		}
		dp[0][0] = 0;
		
		for(int i = 0;i <= K;i++){
			for(int j = 0;j < 1<<n;j++){
				if(dp[i][j] >= 900000000)continue;
				int mask = (1<<n)-1^j;
				int un = Integer.numberOfTrailingZeros(mask);
				
				mask ^= 1<<un;
				for(int t = mask;t >= 0;t--){ t &= mask; 
					int k = t|1<<un;
					int plus = (d[k]+B-1)/B;
					if(i+plus <= K){
						dp[i+plus][j|k] = Math.min(dp[i+plus][j|k], dp[i][j] + Integer.bitCount(k) - 1);
					}
				} // include k=0
			}
		}
		int min = 999999999;
		for(int i = 0;i <= K;i++){
			min = Math.min(dp[i][(1<<n)-1], min);
		}
		out.println(min);
	}
	
	

	public static void main(String[] args) throws Exception {
//		int n = 16, m = 99999;
//		Random gen = new Random();
//		StringBuilder sb = new StringBuilder();
//		sb.append(n + " ");
//		sb.append(n + " ");//gen.nextInt(n)+1 + " ");
//		sb.append(100000 + " ");
//		for (int i = 0; i < n; i++) {
//			sb.append(gen.nextInt(100000-1)+1 + " ");
//		}
//		INPUT = sb.toString();

		
		long S = System.currentTimeMillis();
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);

		solve();
		out.flush();
		long G = System.currentTimeMillis();
		tr(G - S + "ms");
	}

	private static 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 static byte[] inbuf = new byte[1024];
	public static int lenbuf = 0, ptrbuf = 0;

	private static 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 static boolean isSpaceChar(int c) {
		return !(c >= 33 && c <= 126);
	}

	private static int skip() {
		int b;
		while ((b = readByte()) != -1 && isSpaceChar(b))
			;
		return b;
	}

	private static double nd() {
		return Double.parseDouble(ns());
	}

	private static char nc() {
		return (char) skip();
	}

	private static 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 static 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 static 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 static int[] na(int n) {
		int[] a = new int[n];
		for (int i = 0; i < n; i++)
			a[i] = ni();
		return a;
	}

	private static 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 static 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) {
		if (INPUT.length() != 0)
			System.out.println(Arrays.deepToString(o));
	}
}