# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
631027 | thienbao1602 | Knapsack (NOI18_knapsack) | C++17 | 97 ms | 36028 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 ll long long
using namespace std;
const int N = 2005;
const ll inf = -1e15;
int S, n;
void solve()
{
cin >> S >> n;
map<ll, vector<pair<ll, ll>>> weight;
for(int i=0; i<n; i++)
{
ll w, val, sl;
cin >> val >> w >> sl;
weight[w].push_back({val, sl});
}
int id = 1;
vector<vector<ll>> ans((int)weight.size()+1, vector<ll>(S+1, inf));
ans[0][0] = 0;
for(auto [w, items] : weight)
{
sort(items.begin(), items.end(), greater<pair<ll, ll>>());
for(int i=0; i<=S; i++)
{
ans[id][i] = ans[id-1][i];
ll sl = 0, profit = 0, type_at = 0, used = 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... |