結果
問題 | No.545 ママの大事な二人の子供 |
ユーザー | yuya178 |
提出日時 | 2017-09-27 13:02:55 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 222 ms / 2,000 ms |
コード長 | 5,374 bytes |
コンパイル時間 | 2,842 ms |
コンパイル使用メモリ | 86,996 KB |
実行使用メモリ | 54,540 KB |
最終ジャッジ日時 | 2024-04-27 14:46:03 |
合計ジャッジ時間 | 7,400 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 70 ms
51,048 KB |
testcase_01 | AC | 72 ms
51,104 KB |
testcase_02 | AC | 69 ms
50,932 KB |
testcase_03 | AC | 69 ms
51,080 KB |
testcase_04 | AC | 68 ms
51,068 KB |
testcase_05 | AC | 70 ms
50,988 KB |
testcase_06 | AC | 70 ms
51,252 KB |
testcase_07 | AC | 74 ms
51,156 KB |
testcase_08 | AC | 69 ms
51,016 KB |
testcase_09 | AC | 71 ms
51,192 KB |
testcase_10 | AC | 70 ms
50,864 KB |
testcase_11 | AC | 68 ms
51,072 KB |
testcase_12 | AC | 78 ms
51,272 KB |
testcase_13 | AC | 69 ms
51,080 KB |
testcase_14 | AC | 69 ms
51,188 KB |
testcase_15 | AC | 70 ms
51,188 KB |
testcase_16 | AC | 69 ms
51,052 KB |
testcase_17 | AC | 68 ms
51,168 KB |
testcase_18 | AC | 79 ms
50,892 KB |
testcase_19 | AC | 80 ms
51,116 KB |
testcase_20 | AC | 102 ms
52,124 KB |
testcase_21 | AC | 69 ms
51,284 KB |
testcase_22 | AC | 187 ms
53,576 KB |
testcase_23 | AC | 216 ms
54,084 KB |
testcase_24 | AC | 145 ms
53,264 KB |
testcase_25 | AC | 218 ms
54,128 KB |
testcase_26 | AC | 185 ms
54,204 KB |
testcase_27 | AC | 209 ms
53,772 KB |
testcase_28 | AC | 222 ms
54,540 KB |
testcase_29 | AC | 220 ms
53,964 KB |
testcase_30 | AC | 192 ms
53,684 KB |
testcase_31 | AC | 191 ms
53,332 KB |
ソースコード
import java.io.*; import java.util.*; public class Main { static InputStream is; static PrintWriter out; static String INPUT = ""; static 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[] res = 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]; } res[i] = s; } Arrays.sort(res); 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[j+h]; } else s -= b[j+h]; } int id = Arrays.binarySearch(res, -s); if(id >= 0){ out.println(0); return; } if(-id-2 >= 0){ ans = Math.min(ans, Math.abs(res[-id-2]+s)); } if(-id-1 < res.length){ ans = Math.min(ans, Math.abs(res[-id-1]+s)); } } out.println(ans); } public static void main(String[] args) throws Exception { long S = System.currentTimeMillis(); is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); solve(); out.flush(); long G = System.currentTimeMillis(); tr(G-S+"ms"); } private static boolean eof() { if(lenbuf == -1)return true; int lptr = ptrbuf; while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false; try { is.mark(1000); while(true){ int b = is.read(); if(b == -1){ is.reset(); return true; }else if(!isSpaceChar(b)){ is.reset(); return false; } } } catch (IOException e) { return true; } } private static byte[] inbuf = new byte[1024]; static int lenbuf = 0, ptrbuf = 0; private static 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 static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } // private static boolean isSpaceChar(int c) { return !(c >= 32 && c <= 126); } private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private static double nd() { return Double.parseDouble(ns()); } private static char nc() { return (char)skip(); } private static String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private static 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 static 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 static int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private static 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 static 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) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); } private static int[] nsi(){ char[] s = ns().toCharArray(); int[] a = new int[s.length]; for(int j = 0; j < s.length; j++){ a[j] = s[j] - '0'; } return a; } }