結果

問題 No.771 しおり
ユーザー hiromi_ayasehiromi_ayase
提出日時 2018-12-25 00:08:17
言語 Java19
(openjdk 21)
結果
AC  
実行時間 399 ms / 2,000 ms
コード長 3,148 bytes
コンパイル時間 2,596 ms
コンパイル使用メモリ 85,084 KB
実行使用メモリ 77,344 KB
最終ジャッジ日時 2023-09-29 12:49:44
合計ジャッジ時間 10,000 ms
ジャッジサーバーID
(参考情報)
judge12 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 397 ms
77,228 KB
testcase_01 AC 95 ms
54,772 KB
testcase_02 AC 58 ms
50,792 KB
testcase_03 AC 60 ms
50,880 KB
testcase_04 AC 57 ms
51,352 KB
testcase_05 AC 56 ms
50,972 KB
testcase_06 AC 55 ms
50,760 KB
testcase_07 AC 56 ms
50,888 KB
testcase_08 AC 58 ms
50,756 KB
testcase_09 AC 60 ms
51,188 KB
testcase_10 AC 60 ms
51,088 KB
testcase_11 AC 64 ms
51,332 KB
testcase_12 AC 60 ms
51,124 KB
testcase_13 AC 62 ms
50,872 KB
testcase_14 AC 69 ms
53,084 KB
testcase_15 AC 56 ms
50,888 KB
testcase_16 AC 57 ms
50,808 KB
testcase_17 AC 61 ms
50,988 KB
testcase_18 AC 58 ms
51,316 KB
testcase_19 AC 55 ms
50,888 KB
testcase_20 AC 56 ms
50,828 KB
testcase_21 AC 56 ms
50,908 KB
testcase_22 AC 70 ms
50,932 KB
testcase_23 AC 56 ms
50,984 KB
testcase_24 AC 59 ms
51,172 KB
testcase_25 AC 219 ms
63,404 KB
testcase_26 AC 81 ms
52,768 KB
testcase_27 AC 98 ms
54,728 KB
testcase_28 AC 135 ms
57,956 KB
testcase_29 AC 93 ms
54,824 KB
testcase_30 AC 399 ms
76,816 KB
testcase_31 AC 381 ms
76,892 KB
testcase_32 AC 75 ms
53,012 KB
testcase_33 AC 386 ms
77,124 KB
testcase_34 AC 384 ms
76,708 KB
testcase_35 AC 74 ms
52,924 KB
testcase_36 AC 69 ms
52,700 KB
testcase_37 AC 69 ms
53,140 KB
testcase_38 AC 75 ms
52,576 KB
testcase_39 AC 70 ms
52,540 KB
testcase_40 AC 227 ms
65,864 KB
testcase_41 AC 391 ms
76,744 KB
testcase_42 AC 385 ms
77,272 KB
testcase_43 AC 97 ms
54,624 KB
testcase_44 AC 388 ms
77,344 KB
testcase_45 AC 386 ms
77,228 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

import java.util.Arrays;

public class Main {


  private static void solve() {
    int n = ni();
    int[][] p = ntable(n, 2);
    for (int i = 0; i < n; i ++) {
      p[i][1] -= p[i][0];
    }
    

    int[][] dp = new int[1 << n][n];
    for (int[] v : dp) Arrays.fill(v, Integer.MAX_VALUE);
    for (int i = 0; i < n; i ++) {
      dp[1 << i][i] = 0;
    }

    for (int i = 0; i < (1 << n); i ++) {
      for (int j = 0; j < n; j ++) {
        for (int k = 0; k < n; k ++) {
          if (((i >> k) & 1) != 0) continue;
          dp[i | (1 << k)][k] = Math.min(dp[i | (1 << k)][k], Math.max(dp[i][j], p[j][1] + p[k][0]));
        }
      }
    }
    int ret = Integer.MAX_VALUE;
    for (int i = 0; i < n; i ++) {
      ret = Math.min(ret, dp[(1 << n) - 1][i]);
    }
    System.out.println(ret);
  }

  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}
0