結果

問題 No.545 ママの大事な二人の子供
ユーザー yuya178yuya178
提出日時 2017-09-27 13:02:55
言語 Java21
(openjdk 21)
結果
AC  
実行時間 220 ms / 2,000 ms
コード長 5,374 bytes
コンパイル時間 2,533 ms
コンパイル使用メモリ 81,224 KB
実行使用メモリ 41,752 KB
最終ジャッジ日時 2024-11-15 17:33:57
合計ジャッジ時間 7,078 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 65 ms
37,944 KB
testcase_01 AC 68 ms
38,344 KB
testcase_02 AC 65 ms
38,008 KB
testcase_03 AC 67 ms
37,856 KB
testcase_04 AC 69 ms
38,004 KB
testcase_05 AC 67 ms
38,176 KB
testcase_06 AC 69 ms
38,136 KB
testcase_07 AC 69 ms
37,928 KB
testcase_08 AC 66 ms
37,840 KB
testcase_09 AC 66 ms
37,956 KB
testcase_10 AC 68 ms
38,004 KB
testcase_11 AC 77 ms
37,712 KB
testcase_12 AC 69 ms
38,036 KB
testcase_13 AC 67 ms
37,668 KB
testcase_14 AC 65 ms
38,160 KB
testcase_15 AC 68 ms
38,288 KB
testcase_16 AC 68 ms
37,988 KB
testcase_17 AC 68 ms
37,796 KB
testcase_18 AC 76 ms
38,180 KB
testcase_19 AC 84 ms
38,188 KB
testcase_20 AC 92 ms
38,556 KB
testcase_21 AC 68 ms
37,964 KB
testcase_22 AC 175 ms
40,512 KB
testcase_23 AC 217 ms
41,404 KB
testcase_24 AC 145 ms
40,340 KB
testcase_25 AC 213 ms
41,592 KB
testcase_26 AC 212 ms
41,752 KB
testcase_27 AC 219 ms
41,320 KB
testcase_28 AC 209 ms
41,236 KB
testcase_29 AC 220 ms
41,544 KB
testcase_30 AC 199 ms
41,452 KB
testcase_31 AC 179 ms
41,588 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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