結果

問題 No.545 ママの大事な二人の子供
ユーザー GrenacheGrenache
提出日時 2017-07-14 23:04:27
言語 Java21
(openjdk 21)
結果
AC  
実行時間 344 ms / 2,000 ms
コード長 5,277 bytes
コンパイル時間 6,017 ms
コンパイル使用メモリ 81,216 KB
実行使用メモリ 48,032 KB
最終ジャッジ日時 2024-10-08 00:16:36
合計ジャッジ時間 10,769 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
36,832 KB
testcase_01 AC 53 ms
37,328 KB
testcase_02 AC 54 ms
37,296 KB
testcase_03 AC 54 ms
37,276 KB
testcase_04 AC 59 ms
37,308 KB
testcase_05 AC 57 ms
37,308 KB
testcase_06 AC 56 ms
37,336 KB
testcase_07 AC 56 ms
36,876 KB
testcase_08 AC 56 ms
37,344 KB
testcase_09 AC 57 ms
37,344 KB
testcase_10 AC 58 ms
37,072 KB
testcase_11 AC 58 ms
36,872 KB
testcase_12 AC 83 ms
38,368 KB
testcase_13 AC 118 ms
40,056 KB
testcase_14 AC 138 ms
41,852 KB
testcase_15 AC 64 ms
37,320 KB
testcase_16 AC 184 ms
43,716 KB
testcase_17 AC 188 ms
43,428 KB
testcase_18 AC 194 ms
43,256 KB
testcase_19 AC 201 ms
43,640 KB
testcase_20 AC 176 ms
43,724 KB
testcase_21 AC 58 ms
36,988 KB
testcase_22 AC 231 ms
47,244 KB
testcase_23 AC 301 ms
47,724 KB
testcase_24 AC 223 ms
47,340 KB
testcase_25 AC 329 ms
47,928 KB
testcase_26 AC 335 ms
47,764 KB
testcase_27 AC 304 ms
47,784 KB
testcase_28 AC 313 ms
47,904 KB
testcase_29 AC 295 ms
47,836 KB
testcase_30 AC 344 ms
47,720 KB
testcase_31 AC 327 ms
48,032 KB
権限があれば一括ダウンロードができます

ソースコード

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);
			}

			if (idx >= 0 && idx < d1.size()) {
				min = Math.min(min, Math.abs(d1.get(idx) + e));
			}
			if (idx + 1 >= 0 && idx + 1 < d1.size()) {
				min = Math.min(min, Math.abs(d1.get(idx + 1) + e));
			}
			if (idx - 1 >= 0 && idx - 1 < d1.size()) {
				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