oj.uz

Submission #484271

# Submission time Handle Problem Language Result Execution time Memory
484271 2021-11-02T19:16:49 Z maxshev Knapsack (NOI18_knapsack) C++14
0 / 100
 2 ms 332 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
  /* ifstream fin("knapsack.in"); */

  int s, n;
  cin >> s >> n;

  long v[2001], w[2001], k[2001];
  for (int i = 1; i <= n; i++) {
    cin >> v[i] >> w[i] >> k[i];
  }

  long dp[2001];
  for (int i = 1; i <= s; i++) {
    dp[i] = dp[i - 1];

    for (int j = 1; j <= n; j++) {
      if (i >= w[j]) {
        dp[i] = max(dp[i], dp[i - w[j]] + v[j]);
      }
    }
  }

  cout << dp[s] << '\n';
  return 0;
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Incorrect 0 ms 332 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Incorrect 2 ms 332 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Incorrect 2 ms 332 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Incorrect 0 ms 332 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Incorrect 0 ms 332 KB Output isn't correct
4 Halted 0 ms 0 KB -