結果
問題 | No.771 しおり |
ユーザー |
|
提出日時 | 2018-12-19 00:04:50 |
言語 | Java (openjdk 23) |
結果 |
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 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 43 |
ソースコード
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)); }}