I was solving Book Shop of CSES DP section.
- I am getting TLE even after multiple attempts, Can you tell me how to optimize my TOP-DOWN approach.
- I have also replace 2-d array with 2-d vector but that is also getting TLE.
my code
# | User | Rating |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 155 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | djm03178 | 152 |
CSES DP SECTION — Book Shop
#include "bits/stdc++.h"
using namespace std;
int dp[1001][100001];
vector <int >price, page;
int state(int index, int total)
{
if (index < 0) return 0;
if (dp[index][total] != -1) return dp[index][total];
int &ans = dp[index][total];
if (total >= price[index]) {
ans = page[index] + state(index - 1, total - price[index]);
}
ans = max(ans, state(index - 1, total));
return ans;
}
int main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
int n, req; cin >> n >> req;
price.resize(n); page.resize(n);
for (auto &x : price) cin >> x;
for (auto &x : page) cin >> x;
memset(dp, -1, sizeof(dp));
cout << state(n - 1, req);
Name |
---|