/* * * * * * * * * *
* ID: Haidara *
* LANG: C++17 *
* PROB: *
* * * * * * * * * */
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long
#define rep(i,x,n) for(int i=x;i<n;i++)
#define FOR(i,n) rep(i,0,n)
#define per(i,x,n) for(int i=x;i>n;i--)
#define ROF(i,x) for(int i=x;i>=0;i--)
#define v(i) vector< i >
#define p(i,j) pair< i , j >
#define pii pair<int,int>
#define m(i,j) map< i , j >
#define pq(i) priority_queue< i >
#define ff first
#define all(x) x.begin(),x.end()
#define ss second
#define pp push_back
using namespace std;
void SIO(string name="")
{
if(name!="")
{
freopen((name+".in").c_str(),"r",stdin);
freopen((name+".out").c_str(),"w",stdout);
}
}
const int inf=1LL<<62LL;
const int mod=1e9+7;
const int maxn=100001;
int s,n,v[maxn],w[maxn],k[maxn],dp[maxn][2001];
int solve(int inx=0,int curr=0)
{
if(dp[inx][curr])
return dp[inx][curr];
if(inx==n)
return 0;
FOR(i,k[inx]+1)
{
if(curr+i*w[inx]<=s)
dp[inx][curr]=max(dp[inx][curr],solve(inx+1,curr+i*w[inx])+i*v[inx]);
else
break;
}
return dp[inx][curr];
}
signed main()
{
SIO("");
cin>>s>>n;
FOR(i,n)
{
cin>>v[i]>>w[i]>>k[i];
k[i]=min(k[i],s);
}
cout<<solve();
}
Compilation message
knapsack.cpp: In function 'void SIO(std::string)':
knapsack.cpp:27:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
27 | freopen((name+".in").c_str(),"r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
knapsack.cpp:28:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
28 | freopen((name+".out").c_str(),"w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
716 KB |
Output is correct |
2 |
Correct |
1 ms |
716 KB |
Output is correct |
3 |
Correct |
1 ms |
716 KB |
Output is correct |
4 |
Correct |
1 ms |
716 KB |
Output is correct |
5 |
Correct |
1 ms |
716 KB |
Output is correct |
6 |
Correct |
7 ms |
1740 KB |
Output is correct |
7 |
Correct |
7 ms |
1728 KB |
Output is correct |
8 |
Correct |
6 ms |
1780 KB |
Output is correct |
9 |
Correct |
12 ms |
1740 KB |
Output is correct |
10 |
Correct |
7 ms |
1748 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
716 KB |
Output is correct |
2 |
Correct |
1 ms |
716 KB |
Output is correct |
3 |
Correct |
1 ms |
716 KB |
Output is correct |
4 |
Correct |
1 ms |
716 KB |
Output is correct |
5 |
Correct |
1 ms |
716 KB |
Output is correct |
6 |
Correct |
7 ms |
1740 KB |
Output is correct |
7 |
Correct |
7 ms |
1728 KB |
Output is correct |
8 |
Correct |
6 ms |
1780 KB |
Output is correct |
9 |
Correct |
12 ms |
1740 KB |
Output is correct |
10 |
Correct |
7 ms |
1748 KB |
Output is correct |
11 |
Correct |
1 ms |
716 KB |
Output is correct |
12 |
Correct |
7 ms |
972 KB |
Output is correct |
13 |
Correct |
1 ms |
716 KB |
Output is correct |
14 |
Correct |
1 ms |
716 KB |
Output is correct |
15 |
Correct |
1 ms |
716 KB |
Output is correct |
16 |
Correct |
6 ms |
1756 KB |
Output is correct |
17 |
Correct |
8 ms |
1740 KB |
Output is correct |
18 |
Correct |
11 ms |
1796 KB |
Output is correct |
19 |
Correct |
8 ms |
1752 KB |
Output is correct |
20 |
Correct |
10 ms |
1792 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
716 KB |
Output is correct |
6 |
Correct |
1 ms |
716 KB |
Output is correct |
7 |
Correct |
1 ms |
716 KB |
Output is correct |
8 |
Correct |
1 ms |
716 KB |
Output is correct |
9 |
Correct |
1 ms |
716 KB |
Output is correct |
10 |
Correct |
7 ms |
1740 KB |
Output is correct |
11 |
Correct |
7 ms |
1728 KB |
Output is correct |
12 |
Correct |
6 ms |
1780 KB |
Output is correct |
13 |
Correct |
12 ms |
1740 KB |
Output is correct |
14 |
Correct |
7 ms |
1748 KB |
Output is correct |
15 |
Correct |
1 ms |
716 KB |
Output is correct |
16 |
Correct |
7 ms |
972 KB |
Output is correct |
17 |
Correct |
1 ms |
716 KB |
Output is correct |
18 |
Correct |
1 ms |
716 KB |
Output is correct |
19 |
Correct |
1 ms |
716 KB |
Output is correct |
20 |
Correct |
6 ms |
1756 KB |
Output is correct |
21 |
Correct |
8 ms |
1740 KB |
Output is correct |
22 |
Correct |
11 ms |
1796 KB |
Output is correct |
23 |
Correct |
8 ms |
1752 KB |
Output is correct |
24 |
Correct |
10 ms |
1792 KB |
Output is correct |
25 |
Correct |
2 ms |
716 KB |
Output is correct |
26 |
Execution timed out |
1012 ms |
1812 KB |
Time limit exceeded |
27 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
716 KB |
Output is correct |
6 |
Correct |
1 ms |
716 KB |
Output is correct |
7 |
Correct |
1 ms |
716 KB |
Output is correct |
8 |
Correct |
1 ms |
716 KB |
Output is correct |
9 |
Correct |
1 ms |
716 KB |
Output is correct |
10 |
Correct |
7 ms |
1740 KB |
Output is correct |
11 |
Correct |
7 ms |
1728 KB |
Output is correct |
12 |
Correct |
6 ms |
1780 KB |
Output is correct |
13 |
Correct |
12 ms |
1740 KB |
Output is correct |
14 |
Correct |
7 ms |
1748 KB |
Output is correct |
15 |
Correct |
1 ms |
716 KB |
Output is correct |
16 |
Correct |
7 ms |
972 KB |
Output is correct |
17 |
Correct |
1 ms |
716 KB |
Output is correct |
18 |
Correct |
1 ms |
716 KB |
Output is correct |
19 |
Correct |
1 ms |
716 KB |
Output is correct |
20 |
Correct |
6 ms |
1756 KB |
Output is correct |
21 |
Correct |
8 ms |
1740 KB |
Output is correct |
22 |
Correct |
11 ms |
1796 KB |
Output is correct |
23 |
Correct |
8 ms |
1752 KB |
Output is correct |
24 |
Correct |
10 ms |
1792 KB |
Output is correct |
25 |
Correct |
2 ms |
716 KB |
Output is correct |
26 |
Execution timed out |
1012 ms |
1812 KB |
Time limit exceeded |
27 |
Halted |
0 ms |
0 KB |
- |