Submission #924453

#	Time	Username	Problem	Language	Result	Execution time	Memory
924453		Baizho	Knapsack (NOI18_knapsack)	C++14	100 / 100	38 ms	3816 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
 
 #pragma GCC optimize("Ofast,unroll-loops,fast-math")
 #pragma GCC target("popcnt")
 
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
 
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
 
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353;  // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(5e5)+100;
const int M = ll(2e5) + 100;
const long long inf = 5e18;
const long double eps = 1e-15L;
 
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
 
ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
 
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
 
int s, n;
long long dp[2005];
vector<pair<int, int> > vec[2005];
  
void Baizho() {
	cin>>s>>n;
	for(int i = 1; i <= n; i ++) {
		int v, w, k; cin>>v>>w>>k;
		vec[w].pb({v, k});
	}
	for(int i = 1; i <= s; i ++) {
		sort(all(vec[i]), greater<pair<int, int> >());
		int cnt = s / i, cur = 0;
		for(int j = 0; j < vec[i].size(); j ++) {
			if(cur + vec[i][j].ss <= cnt) {
				cur += vec[i][j].ss;
				int left = vec[i][j].ss;
				while(left --) {
					for(int g = s; g >= i; g --) dp[g] = max(dp[g], dp[g - i] + vec[i][j].ff);
				}
			} else {
				int left = cnt - cur;
				cur = cnt;
				while(left --) {
					for(int g = s; g >= i; g --) dp[g] = max(dp[g], dp[g - i] + vec[i][j].ff);
				}
			}
		}
	}
	long long ans = 0;
	for(int i = 0; i <= s; i ++) ans = max(ans, dp[i]);
	cout<<ans;
}
 
signed main() {		
// 	Freopen("nondec");
    ios_base::sync_with_stdio(false);   
    cin.tie(0);cout.tie(0); 
//   	precalc();
   	
    int ttt = 1;
//    cin>>ttt;
 
    for(int i=1; i<=ttt; i++) {Baizho(); }
}

Compilation message (stderr)

knapsack.cpp: In function 'void Baizho()':
knapsack.cpp:50:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |   for(int j = 0; j < vec[i].size(); j ++) {
      |                  ~~^~~~~~~~~~~~~~~
knapsack.cpp: In function 'void Freopen(std::string)':
knapsack.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
knapsack.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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