Submission #1301183

#TimeUsernameProblemLanguageResultExecution timeMemory
1301183yus1f_mKnapsack (NOI18_knapsack)C++20
17 / 100
1 ms580 KiB
#pragma GCC optimize("O3") #include <bits/stdc++.h> #define ll long long #define str string #define pb push_back #define pf push_front #define in insert #define all(v) v.begin(),v.end() #define fastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); const int sz=1000000,INF=1000000000; using namespace std; void solve() { ll n,m,num1,num2,num3,ans=-INF; cin>>n>>m; vector<ll>dp(n+1,0); for(int i=0;i<m;i++) { cin>>num1>>num2>>num3; for(int j=n;j>=num2;j--) { dp[j]=max(dp[j],dp[j-num2]+num1); } } for(int i=0;i<=n;i++) { ans=max(ans,dp[i]); } cout<<ans; } int main() { fastIO; ll t=1; //cin>>t; while(t--) { solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...