結果
問題 | No.771 しおり |
ユーザー | uwi |
提出日時 | 2018-12-19 00:04:50 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 489 ms / 2,000 ms |
コード長 | 3,755 bytes |
コンパイル時間 | 4,443 ms |
コンパイル使用メモリ | 80,668 KB |
実行使用メモリ | 92,032 KB |
最終ジャッジ日時 | 2024-07-22 07:05:41 |
合計ジャッジ時間 | 13,482 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 449 ms
91,400 KB |
testcase_01 | AC | 128 ms
57,060 KB |
testcase_02 | AC | 56 ms
50,248 KB |
testcase_03 | AC | 55 ms
50,316 KB |
testcase_04 | AC | 55 ms
50,264 KB |
testcase_05 | AC | 54 ms
50,324 KB |
testcase_06 | AC | 55 ms
50,232 KB |
testcase_07 | AC | 56 ms
49,928 KB |
testcase_08 | AC | 55 ms
50,068 KB |
testcase_09 | AC | 54 ms
50,216 KB |
testcase_10 | AC | 54 ms
49,964 KB |
testcase_11 | AC | 53 ms
50,048 KB |
testcase_12 | AC | 53 ms
50,012 KB |
testcase_13 | AC | 53 ms
50,204 KB |
testcase_14 | AC | 58 ms
49,868 KB |
testcase_15 | AC | 53 ms
49,864 KB |
testcase_16 | AC | 53 ms
49,980 KB |
testcase_17 | AC | 54 ms
50,304 KB |
testcase_18 | AC | 56 ms
50,336 KB |
testcase_19 | AC | 53 ms
49,740 KB |
testcase_20 | AC | 53 ms
50,460 KB |
testcase_21 | AC | 54 ms
50,284 KB |
testcase_22 | AC | 54 ms
50,152 KB |
testcase_23 | AC | 55 ms
50,288 KB |
testcase_24 | AC | 55 ms
50,336 KB |
testcase_25 | AC | 332 ms
76,388 KB |
testcase_26 | AC | 70 ms
51,068 KB |
testcase_27 | AC | 127 ms
57,120 KB |
testcase_28 | AC | 187 ms
61,548 KB |
testcase_29 | AC | 134 ms
57,444 KB |
testcase_30 | AC | 483 ms
91,996 KB |
testcase_31 | AC | 489 ms
92,016 KB |
testcase_32 | AC | 96 ms
51,804 KB |
testcase_33 | AC | 485 ms
91,876 KB |
testcase_34 | AC | 476 ms
91,676 KB |
testcase_35 | AC | 98 ms
51,900 KB |
testcase_36 | AC | 69 ms
50,696 KB |
testcase_37 | AC | 67 ms
50,532 KB |
testcase_38 | AC | 96 ms
51,904 KB |
testcase_39 | AC | 67 ms
50,652 KB |
testcase_40 | AC | 331 ms
76,212 KB |
testcase_41 | AC | 478 ms
91,672 KB |
testcase_42 | AC | 481 ms
91,796 KB |
testcase_43 | AC | 138 ms
57,400 KB |
testcase_44 | AC | 489 ms
92,032 KB |
testcase_45 | AC | 456 ms
91,672 KB |
ソースコード
package adv2018; 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 Day19 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(); int[] a = new int[n]; int[] b = new int[n]; for(int i = 0;i < n;i++){ a[i] = ni(); b[i] = ni(); } long[][] dp = new long[1<<n][n]; for(int i = 0;i < 1<<n;i++){ Arrays.fill(dp[i], Long.MAX_VALUE/2); } for(int i = 1;i < 1<<n;i++){ if(Integer.bitCount(i) == 1){ dp[i][Integer.numberOfTrailingZeros(i)] = 0; }else{ for(int j = 0;j < n;j++){ if(i<<~j<0){ for(int k = 0;k < n;k++){ if(j != k && i<<~k<0){ dp[i][j] = Math.min(dp[i][j], Math.max(dp[i^1<<j][k], b[k]-a[k] + a[j]) ); } } } } } } long min = Long.MAX_VALUE; for(int i = 0;i < n;i++){ min = Math.min(min, dp[(1<<n)-1][i]); } out.println(min); } 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 Day19().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)); } }