結果

問題 No.545 ママの大事な二人の子供
コンテスト
ユーザー Grenache
提出日時 2017-07-14 22:59:57
言語 Java
(openjdk 23)
結果
RE  
実行時間 -
コード長 5,194 bytes
コンパイル時間 3,948 ms
コンパイル使用メモリ 84,936 KB
実行使用メモリ 59,824 KB
最終ジャッジ日時 2024-10-07 23:47:30
合計ジャッジ時間 9,883 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 27 RE * 5
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;


public class Main_yukicoder545 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		int n = sc.nextInt();

		long[] a = new long[n];
		long[] b = new long[n];
		for (int i = 0; i < n; i++) {
			a[i] = sc.nextLong();
			b[i] = sc.nextLong();
		}

		List<Long> d1 = new ArrayList<>();
		List<Long> d2 = new ArrayList<>();
		int m = Math.min(16, n);
		for (int i = 0; i < 0x1 << m; i++) {
			long sa = 0;
			long sb = 0;
			for (int j = 0; j < m; j++) {
				if ((i & 0x1 << j) != 0) {
					sa += a[j];
				} else {
					sb += b[j];
				}
			}
			d1.add(sb - sa);
		}
		Collections.sort(d1);

		m = Math.max(0, n - 16);

		if (m == 0) {
			long min = Long.MAX_VALUE;
			for (long e : d1) {
				min = Math.min(min, Math.abs(e));
			}

			pr.println(min);
			return;
		}

		for (int i = 0; i < 0x1 << m; i++) {
			long sa = 0;
			long sb = 0;
			for (int j = 0; j < m; j++) {
				if ((i & 0x1 << j) != 0) {
					sa += a[j + 16];
				} else {
					sb += b[j + 16];
				}
			}
			d2.add(sb - sa);
		}
		Collections.sort(d2);

		long min = Long.MAX_VALUE;
		for (long e : d2) {
			int idx = Collections.binarySearch(d1, -e);
			if (idx < 0) {
				idx = -(idx + 1);
			}

			min = Math.min(min, Math.abs(d1.get(idx) + e));
			if (idx + 1 < d1.size()) {
				min = Math.min(min, Math.abs(d1.get(idx + 1) + e));
			}
			if (idx - 1 >= 0) {
				min = Math.min(min, Math.abs(d1.get(idx - 1) + e));
			}
		}

		pr.println(min);
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		pr = new Printer(System.out);

		solve();

		pr.close();
		sc.close();
	}

	@SuppressWarnings("unused")
	private static class Scanner {
		BufferedReader br;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new NoSuchElementException();
			}
		}
	}

	private static class Printer extends PrintWriter {
		Printer(PrintStream out) {
			super(out);
		}
	}
}
0