結果

問題 No.286 Modulo Discount Store
ユーザー uwiuwi
提出日時 2015-10-09 22:45:27
言語 Java21
(openjdk 21)
結果
AC  
実行時間 85 ms / 2,000 ms
コード長 3,179 bytes
コンパイル時間 4,233 ms
コンパイル使用メモリ 81,340 KB
実行使用メモリ 38,280 KB
最終ジャッジ日時 2024-07-20 04:23:16
合計ジャッジ時間 7,987 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 51 ms
36,908 KB
testcase_01 AC 52 ms
36,880 KB
testcase_02 AC 65 ms
37,076 KB
testcase_03 AC 54 ms
37,020 KB
testcase_04 AC 52 ms
36,988 KB
testcase_05 AC 53 ms
36,920 KB
testcase_06 AC 81 ms
38,036 KB
testcase_07 AC 52 ms
36,712 KB
testcase_08 AC 53 ms
37,100 KB
testcase_09 AC 54 ms
36,492 KB
testcase_10 AC 57 ms
37,000 KB
testcase_11 AC 51 ms
36,884 KB
testcase_12 AC 53 ms
36,636 KB
testcase_13 AC 66 ms
36,996 KB
testcase_14 AC 55 ms
36,884 KB
testcase_15 AC 51 ms
36,920 KB
testcase_16 AC 51 ms
36,856 KB
testcase_17 AC 80 ms
38,280 KB
testcase_18 AC 59 ms
36,484 KB
testcase_19 AC 55 ms
36,720 KB
testcase_20 AC 53 ms
36,688 KB
testcase_21 AC 55 ms
37,020 KB
testcase_22 AC 52 ms
36,904 KB
testcase_23 AC 63 ms
37,332 KB
testcase_24 AC 52 ms
36,972 KB
testcase_25 AC 54 ms
36,832 KB
testcase_26 AC 55 ms
36,856 KB
testcase_27 AC 57 ms
36,680 KB
testcase_28 AC 82 ms
37,984 KB
testcase_29 AC 55 ms
37,100 KB
testcase_30 AC 54 ms
36,636 KB
testcase_31 AC 54 ms
36,812 KB
testcase_32 AC 54 ms
36,888 KB
testcase_33 AC 58 ms
36,884 KB
testcase_34 AC 52 ms
36,508 KB
testcase_35 AC 55 ms
36,384 KB
testcase_36 AC 53 ms
37,100 KB
testcase_37 AC 54 ms
36,592 KB
testcase_38 AC 55 ms
36,968 KB
testcase_39 AC 85 ms
37,656 KB
testcase_40 AC 57 ms
36,756 KB
testcase_41 AC 58 ms
36,856 KB
testcase_42 AC 53 ms
37,004 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest;

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 Q528 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[] a = na(n);
		
		int[] dp = new int[1<<n];
		Arrays.fill(dp, 999999999);
		dp[0] = 0;
		for(int i = 1;i < 1<<n;i++){
			int s = 0;
			for(int j = 0;j < n;j++){
				if(i<<~j<0){
					s += a[j];
				}
			}
			for(int j = 0;j < n;j++){
				if(i<<~j<0){
					dp[i] = Math.min(dp[i], dp[i^1<<j] + Math.max(0, a[j] - (s - a[j]) % 1000));
				}
			}
		}
		out.println(dp[(1<<n)-1]);
	}
	
	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");
	}
	
	public static void main(String[] args) throws Exception { new Q528().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 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 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();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0