結果

問題 No.733 分身並列コーディング
ユーザー hiromi_ayasehiromi_ayase
提出日時 2018-09-08 06:39:11
言語 Java21
(openjdk 21)
結果
AC  
実行時間 567 ms / 1,500 ms
コード長 4,421 bytes
コンパイル時間 3,345 ms
コンパイル使用メモリ 83,124 KB
実行使用メモリ 52,316 KB
最終ジャッジ日時 2024-12-14 14:14:03
合計ジャッジ時間 16,539 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 81 ms
51,116 KB
testcase_01 AC 82 ms
51,208 KB
testcase_02 AC 81 ms
51,340 KB
testcase_03 AC 327 ms
52,316 KB
testcase_04 AC 329 ms
52,056 KB
testcase_05 AC 510 ms
51,960 KB
testcase_06 AC 82 ms
50,968 KB
testcase_07 AC 553 ms
52,040 KB
testcase_08 AC 402 ms
51,900 KB
testcase_09 AC 186 ms
51,768 KB
testcase_10 AC 97 ms
51,724 KB
testcase_11 AC 98 ms
51,864 KB
testcase_12 AC 81 ms
51,204 KB
testcase_13 AC 81 ms
51,044 KB
testcase_14 AC 129 ms
52,048 KB
testcase_15 AC 89 ms
51,580 KB
testcase_16 AC 82 ms
51,320 KB
testcase_17 AC 81 ms
51,292 KB
testcase_18 AC 98 ms
51,664 KB
testcase_19 AC 183 ms
51,708 KB
testcase_20 AC 195 ms
51,836 KB
testcase_21 AC 130 ms
51,712 KB
testcase_22 AC 381 ms
51,884 KB
testcase_23 AC 133 ms
52,072 KB
testcase_24 AC 137 ms
51,784 KB
testcase_25 AC 84 ms
51,100 KB
testcase_26 AC 82 ms
51,376 KB
testcase_27 AC 91 ms
51,584 KB
testcase_28 AC 567 ms
52,188 KB
testcase_29 AC 445 ms
52,208 KB
testcase_30 AC 437 ms
52,188 KB
testcase_31 AC 457 ms
51,960 KB
testcase_32 AC 111 ms
51,948 KB
testcase_33 AC 109 ms
51,860 KB
testcase_34 AC 109 ms
51,780 KB
testcase_35 AC 109 ms
51,588 KB
testcase_36 AC 108 ms
51,620 KB
testcase_37 AC 109 ms
51,960 KB
testcase_38 AC 485 ms
52,040 KB
testcase_39 AC 493 ms
52,168 KB
testcase_40 AC 488 ms
52,108 KB
testcase_41 AC 108 ms
51,952 KB
testcase_42 AC 110 ms
51,888 KB
testcase_43 AC 107 ms
51,808 KB
testcase_44 AC 488 ms
51,976 KB
testcase_45 AC 493 ms
51,920 KB
testcase_46 AC 492 ms
51,856 KB
testcase_47 AC 518 ms
52,072 KB
testcase_48 AC 499 ms
51,956 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.Arrays;

public class Main {
 
  private static void solve() {
    int T = ni();
    int n = ni();
    int[] t = na(n);

    int[] w = new int[1 << n];
    for (int i = 0; i < (1 << n); i ++) {
      for (int j = 0; j < n; j ++) {
        if (((i >> j) & 1) == 1) {
          w[i] += t[j];
        }
      }
    }

    int[] dp = new int[1 << n];
    Arrays.fill(dp, Integer.MAX_VALUE / 3);
    dp[0] = 0;
    for (int i = 0; i < (1 << n); i ++) {
      int y = ~i & ((1 << n) - 1);
      int x = y;
      while (x > 0) {
        if (w[x] <= T) {
          dp[i | x] = Math.min(dp[i | x], dp[i] + 1);
        }
        x = (x - 1) & y;
      }
    }
    System.out.println(dp[(1 << n) - 1]);
  }



  public static int[] sieveEratosthenes(int n)
  {
    if(n <= 32){
      int[] primes = {2,3,5,7,11,13,17,19,23,29,31};
      for(int i = 0;i < primes.length;i++){
        if(n < primes[i]){
          return Arrays.copyOf(primes, i);
        }
      }
      return primes;
    }

    int u = n+32;
    double lu = Math.log(u);
    int[] ret = new int[(int)(u/lu+u/lu/lu*1.5)];
    ret[0] = 2;
    int pos = 1;

    int[] isnp = new int[(n+1)/32/2+1];
    int sup = (n+1)/32/2+1;

    int[] tprimes = {3,5,7,11,13,17,19,23,29,31};
    for(int tp : tprimes){
      ret[pos++] = tp;
      int[] ptn = new int[tp];
      for(int i = (tp-3)/2;i < tp<<5;i+=tp)ptn[i>>5] |= 1<<i;
      for(int j = 0;j < sup;j += tp){
        for(int i = 0;i < tp && i+j < sup;i++){
          isnp[j+i] |= ptn[i];
        }
      }
    }

    // 3,5,7
    // 2x+3=n
    int[] magic = {0, 1, 23, 2, 29, 24, 19, 3, 30, 27, 25, 11, 20, 8, 4, 13, 31, 22, 28, 18, 26, 10, 7, 12, 21, 17, 9, 6, 16, 5, 15, 14};
    int h = n/2;
    for(int i = 0;i < sup;i++){
      for(int j = ~isnp[i];j != 0;j &= j-1){
        int pp = i<<5|magic[(j&-j)*0x076be629>>>27];
        int p = 2*pp+3;
        if(p > n)break;
        ret[pos++] = p;
        if((long)p*p > n)continue;
        for(int q = (p*p-3)/2;q <= h;q += p)isnp[q>>5] |= 1<<q;
      }
    }

    return Arrays.copyOf(ret, pos);
  }

  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