結果

問題 No.545 ママの大事な二人の子供
ユーザー uwiuwi
提出日時 2017-07-14 22:31:25
言語 Java21
(openjdk 21)
結果
AC  
実行時間 218 ms / 2,000 ms
コード長 3,858 bytes
コンパイル時間 4,939 ms
コンパイル使用メモリ 81,224 KB
実行使用メモリ 41,356 KB
最終ジャッジ日時 2024-10-07 23:38:39
合計ジャッジ時間 8,126 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 55 ms
37,008 KB
testcase_01 AC 55 ms
37,296 KB
testcase_02 AC 56 ms
37,296 KB
testcase_03 AC 55 ms
37,272 KB
testcase_04 AC 56 ms
36,956 KB
testcase_05 AC 55 ms
37,296 KB
testcase_06 AC 55 ms
36,956 KB
testcase_07 AC 54 ms
36,880 KB
testcase_08 AC 54 ms
36,768 KB
testcase_09 AC 54 ms
36,896 KB
testcase_10 AC 54 ms
37,008 KB
testcase_11 AC 53 ms
37,004 KB
testcase_12 AC 54 ms
37,012 KB
testcase_13 AC 53 ms
37,148 KB
testcase_14 AC 54 ms
37,212 KB
testcase_15 AC 54 ms
37,040 KB
testcase_16 AC 54 ms
36,828 KB
testcase_17 AC 58 ms
36,620 KB
testcase_18 AC 58 ms
37,012 KB
testcase_19 AC 65 ms
37,220 KB
testcase_20 AC 92 ms
38,364 KB
testcase_21 AC 54 ms
36,988 KB
testcase_22 AC 146 ms
40,536 KB
testcase_23 AC 196 ms
40,876 KB
testcase_24 AC 119 ms
39,080 KB
testcase_25 AC 218 ms
41,356 KB
testcase_26 AC 190 ms
40,892 KB
testcase_27 AC 205 ms
41,144 KB
testcase_28 AC 197 ms
41,132 KB
testcase_29 AC 189 ms
40,840 KB
testcase_30 AC 215 ms
41,000 KB
testcase_31 AC 190 ms
41,148 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest170714;
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 D {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		long[] a = new long[n];
		long[] b = new long[n];
		for(int i = 0;i < n;i++){
			a[i] = nl();
			b[i] = nl();
		}
		int h = n/2;
		long[] first = new long[1<<h];
		for(int i = 0;i < 1<<h;i++){
			long s = 0;
			for(int j = 0;j < h;j++){
				if(i<<~j<0){
					s += a[j];
				}else{
					s -= b[j];
				}
			}
			first[i] = s;
		}
		Arrays.sort(first);
		
		long ans = Long.MAX_VALUE;
		for(int i = 0;i < 1<<n-h;i++){
			long s = 0;
			for(int j = 0;j < n-h;j++){
				if(i<<~j<0){
					s += a[h+j];
				}else{
					s -= b[h+j];
				}
			}
			int id = Arrays.binarySearch(first, -s);
			if(id >= 0){
				out.println(0);
				return;
			}
			if(-id-2 >= 0){
				ans = Math.min(ans, Math.abs(first[-id-2] + s));
			}
			if(-id-1 < first.length){
				ans = Math.min(ans, Math.abs(first[-id-1] + s));
			}
		}
		out.println(ans);
		
	}
	
	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 D().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