제출 #911652

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
911652		anastasiskolio	Knapsack (NOI18_knapsack)	C++14	37 / 100	1027 ms	19544 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;

int main()
{
  int S, N;
  scanf("%d%d", &S, &N);
  int V[N + 1];
  int W[N + 1];
  int K[N + 1];
  int M = 0;
  for (int i = 1; i <= N; i++)
  {
    scanf("%d%d%d", &V[i], &W[i], &K[i]);
    M += K[i];
  }
  int Weight[M + 1];
  int Value[M + 1];
  int m = 0;
  for (int i = 1; i <= N; i++)
  {
    int j = K[i];
    while (j > 0)
    {
      m++;
      Weight[m] = W[i];
      Value[m] = V[i];
      j--;
    }
  }
  /*int dp[2][S + 1];
  dp[1][0] = 0;
  for (int s = 0; s <= S; s++)
    dp[0][s] = 0;
  for (int i = 1; i <= M; i++)
  {
    for (int s = 1; s <= S; s++)
    {
      if (s - Weight[i] < 0)
        dp[i%2][s] = dp[(i - 1)%2][s];
      else 
        dp[i%2][s] = max(dp[(i - 1)%2][s], dp[(i - 1)%2][s - Weight[i]] + Value[i]);
    }
  }
  printf("%d\n", dp[M%2][S]);*/
  int dp[2][S + 1];
  dp[1][0] = 0;
  for (int s = 0; s <= S; s++)
    dp[0][s] = 0;
  for (int i = 1; i <= M; i++)
  {
    for (int s = 1; s <= S; s++)
    {
      dp[i%2][s] = dp[(i - 1)%2][s];
      if (s - Weight[i] >= 0)
        dp[i%2][s] = max(dp[i%2][s], dp[(i - 1)%2][s - Weight[i]] + Value[i]);
    }
  }
  printf("%d\n", dp[M%2][S]);
  return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

knapsack.cpp: In function 'int main()':
knapsack.cpp:7:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    7 |   scanf("%d%d", &S, &N);
      |   ~~~~~^~~~~~~~~~~~~~~~
knapsack.cpp:14:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |     scanf("%d%d%d", &V[i], &W[i], &K[i]);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 12
• Subtask 2: 17 / 17
• Subtask 3: 20 / 20
• Subtask 4: 0 / 24
• Subtask 5: 0 / 27