結果

問題 No.2364 Knapsack Problem
ユーザー 👑 hos.lyric
提出日時 2023-06-30 22:48:31
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 2 ms / 3,000 ms
コード長 2,482 bytes
コンパイル時間 2,431 ms
コンパイル使用メモリ 119,104 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-07-07 10:40:46
合計ジャッジ時間 2,986 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 20
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons
    ;
import core.bitop;
class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens
    .popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }
int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; 
    (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }
void main() {
  try {
    for (; ; ) {
      const N0 = readInt;
      const N1 = readInt;
      const N = N0 + N1;
      const W = readLong;
      auto A = new long[N];
      auto B = new long[N];
      foreach (i; 0 .. N0) A[i] = readLong;
      foreach (i; 0 .. N0) B[i] = readLong;
      foreach (i; N0 .. N) A[i] = -readLong;
      foreach (i; N0 .. N) B[i] = -readLong;
      debug {
        writeln("W = ", W);
        writeln("A = ", A);
        writeln("B = ", B);
      }
      
      auto ASum = new long[1 << N];
      auto BSum = new long[1 << N];
      foreach (i; 0 .. N) {
        foreach (p; 0 .. 1 << i) {
          ASum[p | 1 << i] = ASum[p] + A[i];
          BSum[p | 1 << i] = BSum[p] + B[i];
        }
      }
      debug {
        writeln("ASum = ", ASum);
        writeln("BSum = ", BSum);
      }
      
      auto can = new bool[1 << N];
      can[0] = true;
      foreach (p; 0 .. 1 << N) if (can[p]) {
        if (!(0 <= ASum[p] && ASum[p] <= W)) {
          can[p] = false;
          continue;
        }
        foreach (i; 0 .. N) if (!(p & 1 << i)) {
          can[p | 1 << i] = true;
        }
      }
      debug {
        writeln("can = ", can);
      }
      
      long ans;
      foreach (p; 0 .. 1 << N) if (can[p]) {
        chmax(ans, BSum[p]);
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0