| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 906217 | trinhbaongoc3006 | Knapsack (NOI18_knapsack) | C++17 | 50 ms | 3920 KiB |
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>
#define INF int64_t(1e9)
#define pii pair <int, int>
#define pll pair <long long, long long>
#define file "test"
using namespace std;
const int nmax=2005;
const int MOD = 1e9 + 7;
int s, n;
vector <pii> adj[nmax];
long long dp[nmax];
int main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
//freopen(file".inp","r",stdin);
//freopen(file".out","w",stdout);
cin >> s >> n;
for (int i=1;i<=n;i++)
{
int w, v, k;
cin >> v >> w >> k;
adj[w].push_back({v,k});
}
for (int i=1;i<=s;i++)
{
if (adj[i].size() == 0) continue;
sort(adj[i].begin(), adj[i].end(), greater <pii> ()) ;
int id = 0;
for (int j=0;j*i<s;j++)
{
if (id >= adj[i].size()) break;
for (int k=s;k>=i;k--)
{
dp[k] = max(dp[k], dp[k-i] + adj[i][id].first);
}
adj[i][id].second--;
if (adj[i][id].second == 0) id++;
}
}
cout << dp[s] ;
return 0;
}
Compilation message (stderr)
| # | 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... | ||||
