結果

問題 No.771 しおり
ユーザー uwiuwi
提出日時 2018-12-19 00:04:50
言語 Java21
(openjdk 21)
結果
AC  
実行時間 469 ms / 2,000 ms
コード長 3,755 bytes
コンパイル時間 5,406 ms
コンパイル使用メモリ 77,108 KB
実行使用メモリ 91,896 KB
最終ジャッジ日時 2023-09-29 12:46:32
合計ジャッジ時間 14,321 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 437 ms
91,648 KB
testcase_01 AC 116 ms
56,796 KB
testcase_02 AC 43 ms
49,392 KB
testcase_03 AC 43 ms
49,604 KB
testcase_04 AC 44 ms
49,696 KB
testcase_05 AC 43 ms
49,456 KB
testcase_06 AC 43 ms
49,320 KB
testcase_07 AC 43 ms
49,288 KB
testcase_08 AC 46 ms
49,344 KB
testcase_09 AC 42 ms
47,124 KB
testcase_10 AC 44 ms
49,348 KB
testcase_11 AC 43 ms
49,472 KB
testcase_12 AC 44 ms
49,260 KB
testcase_13 AC 45 ms
49,448 KB
testcase_14 AC 49 ms
49,312 KB
testcase_15 AC 43 ms
49,344 KB
testcase_16 AC 45 ms
49,404 KB
testcase_17 AC 44 ms
49,400 KB
testcase_18 AC 43 ms
49,584 KB
testcase_19 AC 44 ms
49,320 KB
testcase_20 AC 44 ms
49,128 KB
testcase_21 AC 44 ms
49,316 KB
testcase_22 AC 44 ms
49,316 KB
testcase_23 AC 44 ms
49,296 KB
testcase_24 AC 44 ms
49,144 KB
testcase_25 AC 334 ms
76,684 KB
testcase_26 AC 75 ms
52,036 KB
testcase_27 AC 112 ms
56,388 KB
testcase_28 AC 158 ms
60,848 KB
testcase_29 AC 112 ms
56,300 KB
testcase_30 AC 464 ms
91,552 KB
testcase_31 AC 469 ms
91,564 KB
testcase_32 AC 76 ms
52,416 KB
testcase_33 AC 469 ms
91,528 KB
testcase_34 AC 456 ms
91,860 KB
testcase_35 AC 78 ms
52,372 KB
testcase_36 AC 56 ms
50,160 KB
testcase_37 AC 56 ms
52,044 KB
testcase_38 AC 77 ms
52,256 KB
testcase_39 AC 55 ms
47,864 KB
testcase_40 AC 276 ms
77,088 KB
testcase_41 AC 463 ms
91,676 KB
testcase_42 AC 462 ms
91,700 KB
testcase_43 AC 110 ms
57,064 KB
testcase_44 AC 468 ms
91,896 KB
testcase_45 AC 447 ms
91,656 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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 Day19 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[] a = new int[n];
		int[] b = new int[n];
		for(int i = 0;i < n;i++){
			a[i] = ni();
			b[i] = ni();
		}
		
		long[][] dp = new long[1<<n][n];
		for(int i = 0;i < 1<<n;i++){
			Arrays.fill(dp[i], Long.MAX_VALUE/2);
		}
		for(int i = 1;i < 1<<n;i++){
			if(Integer.bitCount(i) == 1){
				dp[i][Integer.numberOfTrailingZeros(i)] = 0;
			}else{
				for(int j = 0;j < n;j++){
					if(i<<~j<0){
						for(int k = 0;k < n;k++){
							if(j != k && i<<~k<0){
								dp[i][j] = Math.min(dp[i][j], 
										Math.max(dp[i^1<<j][k], b[k]-a[k] + a[j])
								);
							}
						}
					}
				}
			}
		}
		long min = Long.MAX_VALUE;
		for(int i = 0;i < n;i++){
			min = Math.min(min, dp[(1<<n)-1][i]);
		}
		out.println(min);
	}
	
	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 Day19().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)); }
}
0