제출 #1289334

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1289334		muhammad-mutahir	Knapsack (NOI18_knapsack)	C++20	37 / 100	1097 ms	49824 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;

#define print(l) for(auto i:l) cout<<i<<" ";cout<<endl;
#define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i];
#define int long long
#define pb push_back
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
#define all(l) l.begin(),l.end()
#define pii pair<int,int>
#define fi first
#define se second

const int M = 1e9+7;
const int inf = 1e18;


int bp(int x, int y, int p){
    int res = 1;
    x = x % p;
    while (y > 0) {
 
        if (y & 1)
            res = (res * x) % p;
        y = y >> 1;
        x = (x * x) % p;
    }
    return res;
}
 
int MI(int n, int p){
    return bp(n, p - 2, p);
}
int mul(int x,int y, int p){
    return x * 1ull * y % p;
}
int di(int x,int y, int p){
    return mul(x, MI(y, p), p);
}


int n , m , k , q;



map<pair<int,int>,int>ob;

void solve(int testcase_number){
    cin>>k>>n;
    for(int i = 0;i<n;i++){
    	int V,W,k;
    	cin>>V>>W>>k;
    	ob[{V,W}]+=k; 	 
    }
    // for(int jk =0 ;jk<=20;jk++)
    // for(auto i:ob){
    	// if(i.se > 1){
    		// ob[i.fi] = 1 + ((i.se-1 %2) == 1);
    		// ob[{i.fi.fi*2 , i.fi.se*2}]+= (i.se-1)/2;
    	// }
    // }
    
    
    vector<int>wt,val;

	for(auto i:ob){
		for(int j =0 ;j< i.se;j++){
			wt.pb(i.fi.se);
			val.pb(i.fi.fi);
		}
		
	}
    // print(wt);
    // print(val);
    vector<int> dp(k + 1, 0);
    
    for (int i = 1; i <= wt.size(); i++) {
        for (int j = k; j >= wt[i - 1]; j--) {
            dp[j] = max(dp[j], dp[j - wt[i - 1]] + val[i - 1]);
        }
    }

    cout<< dp[k] <<endl;
    




}


signed main(){
    ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
    cin.tie(0), cout.tie(0);
    cout << fixed<<setprecision(9);

    int t = 1;
    // cin>>t;
    for(int i = 1;i<=t;i++){
        solve(i);
    }

}

• Subtask 1: 0 / 12
• Subtask 2: 17 / 17
• Subtask 3: 20 / 20
• Subtask 4: 0 / 24
• Subtask 5: 0 / 27