結果

問題 No.2869 yuusaan's Knapsacks
コンテスト
ユーザー tnakao0123
提出日時 2024-09-04 15:03:23
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 1,107 ms / 4,500 ms
コード長 2,003 bytes
コンパイル時間 568 ms
コンパイル使用メモリ 58,856 KB
最終ジャッジ日時 2025-02-24 03:52:42
ジャッジサーバーID
（参考情報） 		judge3 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 27
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:36:8: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   36 |   scanf("%d%d", &n, &m);
      |   ~~~~~^~~~~~~~~~~~~~~~
main.cpp:37:36: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   37 |   for (int i = 0; i < n; i++) scanf("%d", es + i);
      |                               ~~~~~^~~~~~~~~~~~~~
main.cpp:38:36: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   38 |   for (int i = 0; i < m; i++) scanf("%d%d", vs + i, ws + i);
      |                               ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

ソースコード

diff # 

/* -*- coding: utf-8 -*-
 *
 * 2869.cc:  No.2869 yuusaan&#39;s Knapsacks - yukicoder
 */

#include<cstdio>
#include<vector>
#include<algorithm>

using namespace std;

/* constant */

const int MAX_N = 16;
const int MAX_M = 16;
const int MBITS = 1 << MAX_M;

/* typedef */

using ll = long long;
using vi = vector<int>;

/* global variables */

int es[MAX_N], vs[MAX_M], ws[MAX_M];
int vss[MBITS], dp[MAX_N + 1][MBITS], ps[MAX_N + 1][MBITS];
ll wss[MBITS];
vi qs[MAX_N];

/* subroutines */

/* main */

int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; i++) scanf("%d", es + i);
  for (int i = 0; i < m; i++) scanf("%d%d", vs + i, ws + i);

  int mbits = 1 << m, mmsk = mbits - 1;
  for (int bits = 1, msb = 1, msi = 0; bits < mbits; bits++) {
    if ((msb << 1) <= bits) msb <<= 1, msi++;
    vss[bits] = vss[bits ^ msb] + vs[msi];
    wss[bits] = wss[bits ^ msb] + ws[msi];
  }

  fill(dp[0], dp[0] + mbits, -1);
  dp[0][0] = 0, ps[0][0] = -1;

  for (int i = 0; i < n; i++) {
    copy(dp[i], dp[i] + mbits, dp[i + 1]);
    for (int bits = 0; bits < mbits; bits++) ps[i + 1][bits] = bits;
    
    for (int bits = 0; bits < mbits; bits++)
      if (dp[i][bits] >= 0) {
	int msk1 = bits ^ mmsk;
	for (int bits1 = msk1;;) {
	  int d = dp[i][bits] + vss[bits1];
	  if (es[i] >= wss[bits1] && dp[i + 1][bits | bits1] < d) {
	    dp[i + 1][bits | bits1] = d;
	    ps[i + 1][bits | bits1] = bits;
	  }
	  if (bits1 == 0) break;
	  bits1 = (bits1 - 1) & msk1;
	}
      }
  }

  int maxv = -1, maxb = -1;
  for (int bits = 0; bits < mbits; bits++)
    if (maxv < dp[n][bits]) maxv = dp[n][bits], maxb = bits;

  for (int i = n, bits = maxb; i > 0; bits = ps[i][bits], i--) {
    int bs = bits ^ ps[i][bits];
    for (int j = 0, bj = 1; j < m; j++, bj <<= 1)
      if (bs & bj) qs[i - 1].push_back(j);
  }

  printf("%d\n", maxv);
  for (int i = 0; i < n; i++) {
    printf("%d", (int)qs[i].size());
    for (auto u: qs[i]) printf(" %d", u + 1);
    putchar('\n');
  }
  
  return 0;
}
0