結果

問題 No.626 Randomized 01 Knapsack
ユーザー hiromi_ayasehiromi_ayase
提出日時 2017-12-16 20:57:28
言語 Java21
(openjdk 21)
結果
MLE  
(最新)
TLE  
(最初)
実行時間 -
コード長 4,617 bytes
コンパイル時間 2,646 ms
コンパイル使用メモリ 85,872 KB
実行使用メモリ 1,047,276 KB
最終ジャッジ日時 2024-12-15 22:17:00
合計ジャッジ時間 88,246 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 73 ms
57,860 KB
testcase_01 AC 86 ms
58,764 KB
testcase_02 MLE -
testcase_03 AC 178 ms
64,196 KB
testcase_04 MLE -
testcase_05 AC 119 ms
61,500 KB
testcase_06 MLE -
testcase_07 MLE -
testcase_08 TLE -
testcase_09 MLE -
testcase_10 TLE -
testcase_11 MLE -
testcase_12 TLE -
testcase_13 TLE -
testcase_14 MLE -
testcase_15 MLE -
testcase_16 MLE -
testcase_17 MLE -
testcase_18 MLE -
testcase_19 MLE -
testcase_20 MLE -
testcase_21 TLE -
testcase_22 MLE -
testcase_23 TLE -
testcase_24 MLE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;

class Xor128 {
  public static final int RAND_INF = 10000000;
  private int x = 123456789, y = 362436069, z = 521288629, w = 88675123;

  public int next(int max) {
    return next() % max;
  }

  public int next() {
    int t = (x ^ (x << 11));
    x = y;
    y = z;
    z = w;
    return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
  }

  public void shuffle(int[] array) {
    int n = array.length;
    for (int i = n - 1; i >= 1; i--) {
      int j = next() % i;
      int tmp = array[i];
      array[i] = array[j];
      array[j] = tmp;
    }
  }
}


public class Main {
  private static final long TIME = 15000;
  private static final double START_TEMP = 200000000L;
  private static final double END_TEMP = 10;

  private static void solve() {
    Xor128 rand = new Xor128();

    int N = ni();
    long W = nl();
    long[][] item = new long[N][3];
    double[] r = new double[N];
    for (int i = 0; i < N; i ++) {
      item[i][0] = i;
      item[i][1] = nl(); //v
      item[i][2] = nl(); //w
      r[i] = item[i][1] / item[i][2];
    }
    Arrays.sort(item, (o1, o2) -> Double.compare(r[(int)o2[0]], r[(int)o1[0]]));
    
    Map<Long, Long> from = new HashMap<>();
    Map<Long, Long> to = new HashMap<>();
    from.put(0L, 0L);
    for (int i = 0; i < N; i ++) {
      for (Map.Entry<Long, Long> entry : from.entrySet()) {
        long key1 = entry.getKey();
        long key2 = entry.getKey() + item[i][2];

        boolean b1 = to.containsKey(key1);
        boolean b2 = to.containsKey(key2);

        if (b1) {
          to.put(key1, Math.max(to.get(key1), entry.getValue()));
        } else {
          to.put(key1, entry.getValue());
        }
        if (key2 <= W) {
          if (b2) {
            to.put(key2, Math.max(to.get(key2), entry.getValue() + item[i][1]));
          } else {
            to.put(key2, entry.getValue() + item[i][1]);
          }
        }
      }
      from.clear();
      Map<Long, Long> tmp = from;
      from = to;
      to = tmp;
    }
    
    long max = 0;
    for (Map.Entry<Long, Long> entry : from.entrySet()) {
      max = Math.max(max, entry.getValue());
    }
    
    //System.err.println(now - start + "ms");
    System.out.println(max);
  }

  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