結果
問題 | No.949 飲酒プログラミングコンテスト |
ユーザー | uwi |
提出日時 | 2019-12-12 00:08:12 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,059 ms / 2,500 ms |
コード長 | 4,533 bytes |
コンパイル時間 | 5,718 ms |
コンパイル使用メモリ | 87,604 KB |
実行使用メモリ | 132,668 KB |
最終ジャッジ日時 | 2023-09-06 13:34:57 |
合計ジャッジ時間 | 19,849 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 45 ms
49,132 KB |
testcase_01 | AC | 45 ms
49,300 KB |
testcase_02 | AC | 45 ms
49,220 KB |
testcase_03 | AC | 45 ms
49,420 KB |
testcase_04 | AC | 46 ms
49,452 KB |
testcase_05 | AC | 48 ms
49,624 KB |
testcase_06 | AC | 47 ms
49,832 KB |
testcase_07 | AC | 57 ms
50,432 KB |
testcase_08 | AC | 77 ms
51,472 KB |
testcase_09 | AC | 58 ms
50,184 KB |
testcase_10 | AC | 64 ms
50,568 KB |
testcase_11 | AC | 794 ms
115,268 KB |
testcase_12 | AC | 736 ms
114,876 KB |
testcase_13 | AC | 624 ms
114,872 KB |
testcase_14 | AC | 136 ms
56,868 KB |
testcase_15 | AC | 475 ms
85,644 KB |
testcase_16 | AC | 829 ms
131,276 KB |
testcase_17 | AC | 188 ms
61,060 KB |
testcase_18 | AC | 981 ms
131,640 KB |
testcase_19 | AC | 542 ms
115,116 KB |
testcase_20 | AC | 198 ms
61,116 KB |
testcase_21 | AC | 122 ms
57,016 KB |
testcase_22 | AC | 190 ms
61,248 KB |
testcase_23 | AC | 79 ms
52,424 KB |
testcase_24 | AC | 533 ms
88,116 KB |
testcase_25 | AC | 1,041 ms
131,956 KB |
testcase_26 | AC | 1,059 ms
132,592 KB |
testcase_27 | AC | 938 ms
132,400 KB |
testcase_28 | AC | 1,026 ms
132,392 KB |
testcase_29 | AC | 838 ms
132,248 KB |
testcase_30 | AC | 867 ms
132,668 KB |
testcase_31 | AC | 531 ms
132,356 KB |
testcase_32 | AC | 966 ms
132,504 KB |
ソースコード
package adv2019; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class D12 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(); int[] a = na(n+1); int[] b = na(n+1); int[] d = na(n); Arrays.sort(d); int[][] dp = new int[n+1][n+1]; int[][] ep = new int[n+1][n+1]; for(int i = 0;i <= n;i++) { Arrays.fill(dp[i], -9999999); } dp[0][0] = 0; ep[0][0] = 0; int max = 0; for(int i = 0;i <= n;i++) { for(int j = 0;j <= n;j++) { max = Math.max(max, dp[i][j]); if(i+1 <= n) { int ind = Math.max(ep[i][j], n-lowerBound(d, a[i+1]+b[j]+1)); if(ind < n) { int nd = dp[i][j] + 1; int ne = ind; if(nd > dp[i+1][j] || nd == dp[i+1][j] && ne+1 < ep[i+1][j]) { dp[i+1][j] = nd; ep[i+1][j] = ne+1; } } } if(j+1 <= n) { int ind = Math.max(ep[i][j], n-lowerBound(d, a[i]+b[j+1]+1)); if(ind < n) { int nd = dp[i][j] + 1; int ne = ind; if(nd > dp[i][j+1] || nd == dp[i][j+1] && ne+1 < ep[i][j+1]) { dp[i][j+1] = nd; ep[i][j+1] = ne+1; } } } } } out.println(max); } public static int lowerBound(int[] a, int v){ return lowerBound(a, 0, a.length, v); } public static int lowerBound(int[] a, int l, int r, int v) { if(l > r || l < 0 || r > a.length)throw new IllegalArgumentException(); int low = l-1, high = r; while(high-low > 1){ int h = high+low>>>1; if(a[h] >= v){ high = h; }else{ low = h; } } return high; } public static int[] rev(int[] a) { int[] b = new int[a.length]; for(int i = 0;i < a.length;i++)b[a.length-1-i] = a[i]; return b; } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new D12().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private 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 boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private 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 int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private 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 int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private 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) { System.out.println(Arrays.deepToString(o)); } }