# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
209517 | model_code | Knapsack (NOI18_knapsack) | C++17 | 272 ms | 3960 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.
//#pragma GCC optimize(3)
#define NDEBUG
#include <bits/stdc++.h>
using namespace std;
struct item{
long long value;
int weight;
long long copies;
};
pair<long long,int> pseudoitems[3000000];
pair<long long,int> *pi_end; // value, weight
item items[100000];
item *items_end;
long long gcd(long long a, long long b){
if(a==0)return b;
if(b==0)return a;
return gcd(b,a%b);
}
int main(){
ios_base::sync_with_stdio(false);
//cin.tie(nullptr);
//cout.tie(nullptr);
int s,n;
while(cin>>s>>n&&s){
assert(s>=1&&s<=2000);
assert(n>=1&&n<=100000);
pi_end=pseudoitems;
for(int i=0;i<n;++i){
cin>>items[i].value>>items[i].weight>>items[i].copies;
assert(items[i].value>=1&&items[i].value<=1000000);
# | 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... |