結果
問題 | No.949 飲酒プログラミングコンテスト |
ユーザー | Oland |
提出日時 | 2019-12-13 01:41:31 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 709 ms / 2,500 ms |
コード長 | 7,431 bytes |
コンパイル時間 | 2,462 ms |
コンパイル使用メモリ | 89,952 KB |
実行使用メモリ | 70,008 KB |
最終ジャッジ日時 | 2023-09-08 10:03:10 |
合計ジャッジ時間 | 13,889 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
49,772 KB |
testcase_01 | AC | 42 ms
49,760 KB |
testcase_02 | AC | 43 ms
49,664 KB |
testcase_03 | AC | 42 ms
49,900 KB |
testcase_04 | AC | 44 ms
49,796 KB |
testcase_05 | AC | 47 ms
49,876 KB |
testcase_06 | AC | 44 ms
49,748 KB |
testcase_07 | AC | 54 ms
49,764 KB |
testcase_08 | AC | 78 ms
52,676 KB |
testcase_09 | AC | 57 ms
49,952 KB |
testcase_10 | AC | 70 ms
51,300 KB |
testcase_11 | AC | 443 ms
67,700 KB |
testcase_12 | AC | 467 ms
70,008 KB |
testcase_13 | AC | 393 ms
69,272 KB |
testcase_14 | AC | 137 ms
55,728 KB |
testcase_15 | AC | 324 ms
66,224 KB |
testcase_16 | AC | 485 ms
67,404 KB |
testcase_17 | AC | 183 ms
56,384 KB |
testcase_18 | AC | 709 ms
68,780 KB |
testcase_19 | AC | 393 ms
67,684 KB |
testcase_20 | AC | 171 ms
56,364 KB |
testcase_21 | AC | 123 ms
55,016 KB |
testcase_22 | AC | 136 ms
55,544 KB |
testcase_23 | AC | 64 ms
51,192 KB |
testcase_24 | AC | 424 ms
68,148 KB |
testcase_25 | AC | 562 ms
68,500 KB |
testcase_26 | AC | 643 ms
68,060 KB |
testcase_27 | AC | 530 ms
67,668 KB |
testcase_28 | AC | 665 ms
67,872 KB |
testcase_29 | AC | 445 ms
68,212 KB |
testcase_30 | AC | 279 ms
68,052 KB |
testcase_31 | AC | 223 ms
68,020 KB |
testcase_32 | AC | 578 ms
68,664 KB |
ソースコード
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; } } }