# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1096570 | dosts | Knapsack (NOI18_knapsack) | C++17 | 1088 ms | 5436 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.
//SİGUSMUS SEFEROĞLU
#include <bits/stdc++.h>
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
using namespace std;
#define int long long
#define pii pair<int,int>
#define ff first
#define ss second
#define sp << " " <<
#define all(cont) cont.begin(),cont.end()
#define vi vector<int>
const int MOD = 1e9+7,inf = 2e18;
const int N = 2e5+50,Q = 2e5+50;
int conv(int x) {
if (x <= -inf/2) return -1;
return x;
}
deque<int> dqs[2001];
void solve() {
int n,w;
cin >> w >> n;
vi v(n+1),c(n+1),k(n+1);
for (int i=1;i<=n;i++) cin >> v[i] >> c[i] >> k[i];
vi sack(w+1),sack2(w+1,-inf);
sack2[0] = 0;
for (int i=1;i<=n;i++) {
for (int j = 0;j<=w;j++) {
int bin = j%c[i];
# | 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... |