This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
int f(int n, int s, vector<int> &val, vector<int> &w, vector<int> &freq)
{
if(s==0)return 0;
if(n<0)return 0;
int ans = 0;
if(w[n]<=s and freq[n]>0){
freq[n]--;
ans = max( ans , val[n]+f(n,s-w[n],val,w,freq));
freq[n]++;
ans = max( ans , f(n-1,s,val,w,freq));
}
else{
ans = max( ans , f(n-1,s,val,w,freq));
}
return ans;
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int s, n;
cin >> s >> n;
vector<int> val(n), w(n), freq(n);
for (int i = 0; i < n; i++)
{
cin >> val[i] >> w[i] >> freq[i];
}
cout<< f(n-1,s,val,w,freq);
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |