結果

問題 No.949 飲酒プログラミングコンテスト
ユーザー OlandOland
提出日時 2019-12-13 01:41:31
言語 Java21
(openjdk 21)
結果
AC  
実行時間 676 ms / 2,500 ms
コード長 7,431 bytes
コンパイル時間 3,501 ms
コンパイル使用メモリ 80,980 KB
実行使用メモリ 67,320 KB
最終ジャッジ日時 2024-06-26 03:21:43
合計ジャッジ時間 14,914 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
37,104 KB
testcase_01 AC 57 ms
37,368 KB
testcase_02 AC 57 ms
37,136 KB
testcase_03 AC 57 ms
37,152 KB
testcase_04 AC 58 ms
37,152 KB
testcase_05 AC 61 ms
37,320 KB
testcase_06 AC 56 ms
37,308 KB
testcase_07 AC 69 ms
37,632 KB
testcase_08 AC 95 ms
38,808 KB
testcase_09 AC 77 ms
37,832 KB
testcase_10 AC 82 ms
38,736 KB
testcase_11 AC 456 ms
56,692 KB
testcase_12 AC 535 ms
61,044 KB
testcase_13 AC 448 ms
59,276 KB
testcase_14 AC 154 ms
44,100 KB
testcase_15 AC 352 ms
55,292 KB
testcase_16 AC 579 ms
57,052 KB
testcase_17 AC 202 ms
43,952 KB
testcase_18 AC 649 ms
57,148 KB
testcase_19 AC 374 ms
55,900 KB
testcase_20 AC 178 ms
45,728 KB
testcase_21 AC 125 ms
43,464 KB
testcase_22 AC 156 ms
44,576 KB
testcase_23 AC 66 ms
38,412 KB
testcase_24 AC 430 ms
57,124 KB
testcase_25 AC 606 ms
66,124 KB
testcase_26 AC 658 ms
67,208 KB
testcase_27 AC 578 ms
66,004 KB
testcase_28 AC 671 ms
67,280 KB
testcase_29 AC 542 ms
67,320 KB
testcase_30 AC 354 ms
66,996 KB
testcase_31 AC 283 ms
67,048 KB
testcase_32 AC 676 ms
66,060 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

@SuppressWarnings("unused")
public class Main {
    FastScanner in;
    PrintWriter out;
    int MOD = (int)1e9+7;
    long ceil(long a, long b){return (a + b - 1) / b;}
    long gcd(long a, long b){return b == 0 ? a : gcd(b, a % b);}
    long lcm(long a, long b){return a / gcd(a, b) * b;}
    
    void solve() {
        int N = in.nextInt();
        int[] A = in.nextIntArray(N+1);
        int[] B = in.nextIntArray(N+1);
        
        ArrayList<Integer> D = new ArrayList<>();
        for(int i = 0; i < N; i++) D.add(in.nextInt());
        Collections.sort(D, Collections.reverseOrder());
        
        boolean[][] dp;
        int ok = N, ng = -1;
        while(Math.abs(ok - ng) > 1){
            int mid = (ok + ng) / 2;
            boolean isOk = false;
            dp = new boolean[N+1][N+1];
            dp[0][0] = true;
            for(int i = mid; i < N; i++){
                int j = i - mid + 1;
                for(int k = 0; k <= j; k++){
                    int m = j - k;
                    boolean p = false;
                    if(k > 0) p |= dp[j-1][k-1];
                    if(m > 0) p |= dp[j-1][k];
                    dp[j][k] = p && (A[k] + B[m] >= D.get(i));
                    if(i == N-1) isOk |= dp[j][k];
                }
            }
            if(isOk) ok = mid;
            else ng = mid;
        }
        out.println(N-ok);
    }
    
    public static void main(String[] args) {
        new Main().m();
    }
    
    private void m() {
        in = new FastScanner(System.in);
        out = new PrintWriter(System.out);
        /*
        try {
            String path = "output.txt";
            out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));
        }catch (IOException e){
            e.printStackTrace();
        }
        */
        solve();
        out.flush();
        in.close();
        out.close();
    }
    
    static class FastScanner {
        private Reader input;
        
        public FastScanner() {this(System.in);}
        public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
        public void close() {
            try {
                this.input.close();
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        
        public int nextInt() {return (int) nextLong();}
        
        public long nextLong() {
            try {
                int sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                long ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) return ret * sign;
                    ret *= 10;
                    ret += b - '0';
                }
            } catch (IOException e) {
                e.printStackTrace();
                return -1;
            }
        }
        
        public double nextDouble() {
            try {
                double sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                double ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) break;
                    ret *= 10;
                    ret += b - '0';
                }
                if (b != '.') return sign * ret;
                double div = 1;
                b = input.read();
                while ('0' <= b && b <= '9') {
                    ret *= 10;
                    ret += b - '0';
                    div *= 10;
                    b = input.read();
                }
                return sign * ret / div;
            } catch (IOException e) {
                e.printStackTrace();
                return Double.NaN;
            }
        }
        
        public char nextChar() {
            try {
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                return (char) b;
            } catch (IOException e) {
                e.printStackTrace();
                return 0;
            }
        }
        
        public String nextStr() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                while (b != -1 && !Character.isWhitespace(b)) {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }
        
        public String nextLine() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (b != -1 && b != '\n') {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }
        
        public int[] nextIntArray(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt();
            }
            return res;
        }
        
        public int[] nextIntArrayDec(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt() - 1;
            }
            return res;
        }
        
        public int[] nextIntArray1Index(int n) {
            int[] res = new int[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextInt();
            }
            return res;
        }
        
        public long[] nextLongArray(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong();
            }
            return res;
        }
        
        public long[] nextLongArrayDec(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong() - 1;
            }
            return res;
        }
        
        public long[] nextLongArray1Index(int n) {
            long[] res = new long[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextLong();
            }
            return res;
        }
        
        public double[] nextDoubleArray(int n) {
            double[] res = new double[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextDouble();
            }
            return res;
        }
    }
}
0