oj.uz

Submission #484279

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

int main() {
  int s, n;
  cin >> s >> n;

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

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

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

Subtask #1
0 / 12.0

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

Subtask #2
0 / 17.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 24.0

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

Subtask #5
0 / 27.0

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