oj.uz

Submission #484430

# Submission time Handle Problem Language Result Execution time Memory
484430 2021-11-03T10:44:30 Z maxshev Knapsack (NOI18_knapsack) C++14
0 / 100
 1000 ms 204 KB 
#include <bits/stdc++.h>
using namespace std;

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

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

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

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

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1081 ms 204 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1081 ms 204 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1081 ms 204 KB Time limit exceeded
2 Halted 0 ms 0 KB -