oj.uz

Submission #490614

# Submission time Handle Problem Language Result Execution time Memory
490614 2021-11-28T10:51:20 Z lolipop Knapsack (NOI18_knapsack) C++17
37 / 100
 1000 ms 1920 KB 
//looking for 49 points(subtasks 1 - 3)

#include<bits/stdc++.h>

using namespace std;

#define int long long

using ll = long long;
using ii = pair <int, int>;

const int maxn = 105, maxk = 15, maxs = 2005;

int n, s;
int V[maxn], W[maxn], K[maxs];
int dp[maxn][maxs];

main () {
  ios::sync_with_stdio(0); cin.tie(0);
#ifdef LOCAL
  freopen("in.txt", "r", stdin);
#endif
  cin >> s >> n;
  for (int i = 1; i <= n; ++i) {
    cin >> V[i] >> W[i] >> K[i];
  }
  int ans = 0;
  for (int i = 1; i <= n; ++i) {
    for (int j = 0; j <= s; ++j) {
      for (int k = 0; k <= K[i]; ++k) {
        int tot = k * W[i];
        if (j - tot >= 0) dp[i][j] = max(dp[i][j], dp[i - 1][j - tot] + k * V[i]);
        dp[i][j] = max(dp[i][j], dp[i - 1][j]);
        ans = max(ans, dp[i][j]);
      }
    }
  }
  cout << ans;
  return 0;
}
/*
array bound?
overflow?
print newline after every cases
idea correct?
*/

Compilation message

knapsack.cpp:18:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   18 | main () {
      | ^~~~

Subtask #1
0 / 12.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 720 KB Output is correct
2 Correct 5 ms 1876 KB Output is correct
3 Correct 2 ms 1744 KB Output is correct
4 Correct 2 ms 1876 KB Output is correct
5 Correct 2 ms 1872 KB Output is correct
6 Correct 2 ms 1876 KB Output is correct
7 Correct 2 ms 1872 KB Output is correct
8 Correct 3 ms 1748 KB Output is correct
9 Correct 2 ms 1744 KB Output is correct
10 Correct 3 ms 1856 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 720 KB Output is correct
2 Correct 5 ms 1876 KB Output is correct
3 Correct 2 ms 1744 KB Output is correct
4 Correct 2 ms 1876 KB Output is correct
5 Correct 2 ms 1872 KB Output is correct
6 Correct 2 ms 1876 KB Output is correct
7 Correct 2 ms 1872 KB Output is correct
8 Correct 3 ms 1748 KB Output is correct
9 Correct 2 ms 1744 KB Output is correct
10 Correct 3 ms 1856 KB Output is correct
11 Correct 1 ms 592 KB Output is correct
12 Correct 9 ms 1748 KB Output is correct
13 Correct 3 ms 1740 KB Output is correct
14 Correct 3 ms 1872 KB Output is correct
15 Correct 3 ms 1920 KB Output is correct
16 Correct 4 ms 1856 KB Output is correct
17 Correct 2 ms 1736 KB Output is correct
18 Correct 2 ms 1740 KB Output is correct
19 Correct 3 ms 1740 KB Output is correct
20 Correct 3 ms 1868 KB Output is correct

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1083 ms 340 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 1083 ms 340 KB Time limit exceeded
2 Halted 0 ms 0 KB -