Submission #507511

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
507511	2022-01-12T15:35:53 Z	PikaQ	Knapsack (NOI18_knapsack)	C++17	100 / 100	56 ms	5156 KB

knapsack

/* RE */
#include<bits/stdc++.h>
#define int ll
#define forn(i,n) for(int i=0;i<(n);i++)
#define Forn(i,n) for(int i=1;i<=(n);i++)
#define ll long long
#define pb push_back
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define rz resize
#define vi vector<int>
#define vl vector<long long>
#define vpi vector<pair<int,int> >
#define pii pair<int,int>
#define pll pair<long long,long long>
#define mp make_pair
#define all(p) p.begin(),p.end()
#define alr(p,q) p+1,p+q+1
#define ull unsigned long long
#define st0(p) memset((p),0,sizeof(p))
#define T(x) ((xb)%2 ? s[(x)/2] : '.')
#define lowb(x) x&-x
#define ls(x) (x)*2
#define rs(x) (x)*2+1
#define sz(x) (x).size()
using namespace std;
 
inline void USACO(const string &s){
  freopen((s+".in").c_str(),"r",stdin);
  freopen((s+".out").c_str(),"w",stdout);
}
 
void debug() {cout << endl;}
template <class T, class ...U> void debug(T a, U ... b) { cout << a << " "; debug(b...);}

#define fail() {cout << "-1\n";return;}
const int mod = 1e9+7;
const int N = 2e3+9;
int n,s;
vpi stuff;
vpi a[N];
int dp[N];

void solve(){
	cin >> s >> n;
	forn(i,n){
		int w,v,k;
		cin >> v >> w >> k;
		a[w].pb(mp(v,k));
	}
	Forn(i,s)	sort(all(a[i]),greater<pii>());
	Forn(i,s){
		int cnt = s/i ;
		for(auto &j : a[i]){
			int res = min(cnt,j.S);
			cnt -= res;
			while(res--){
				// debug(i,j.F);
				stuff.pb(mp(i,j.F));
			}
			if(cnt == 0) break;
		}
	}	
	for(pii p : stuff){
		int w = p.F,v = p.S;
		// debug(w,v);
		for(int i = s;i >= w;i--){
			if(i >= w){
				dp[i] = max(dp[i],dp[i-w] + v);
			}
		}
	}
	int ans = 0;
	cout << dp[s] << '\n';
}
   
 
 
 
signed main(){
  // USACO("feast");
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(0);

 
  // int t;
  // cin >> t;
  // while(t--)
    solve();
 
  return 0;
}

Compilation message

knapsack.cpp: In function 'void solve()':
knapsack.cpp:75:6: warning: unused variable 'ans' [-Wunused-variable]
   75 |  int ans = 0;
      |      ^~~

Subtask #1
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	0 ms	332 KB	Output is correct

Subtask #2
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	332 KB	Output is correct
2	Correct	1 ms	356 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	332 KB	Output is correct
2	Correct	1 ms	356 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	2 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	368 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	388 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct

Subtask #4
24.0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	0 ms	332 KB	Output is correct
5	Correct	0 ms	332 KB	Output is correct
6	Correct	1 ms	356 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	2 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	368 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	388 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	0 ms	360 KB	Output is correct
26	Correct	4 ms	332 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	1 ms	332 KB	Output is correct
29	Correct	1 ms	364 KB	Output is correct
30	Correct	2 ms	408 KB	Output is correct
31	Correct	0 ms	332 KB	Output is correct
32	Correct	1 ms	364 KB	Output is correct
33	Correct	1 ms	332 KB	Output is correct
34	Correct	1 ms	332 KB	Output is correct

Subtask #5
27.0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	0 ms	332 KB	Output is correct
5	Correct	0 ms	332 KB	Output is correct
6	Correct	1 ms	356 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	2 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	368 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	388 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	0 ms	360 KB	Output is correct
26	Correct	4 ms	332 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	1 ms	332 KB	Output is correct
29	Correct	1 ms	364 KB	Output is correct
30	Correct	2 ms	408 KB	Output is correct
31	Correct	0 ms	332 KB	Output is correct
32	Correct	1 ms	364 KB	Output is correct
33	Correct	1 ms	332 KB	Output is correct
34	Correct	1 ms	332 KB	Output is correct
35	Correct	29 ms	3420 KB	Output is correct
36	Correct	31 ms	3552 KB	Output is correct
37	Correct	31 ms	3388 KB	Output is correct
38	Correct	27 ms	3616 KB	Output is correct
39	Correct	36 ms	4296 KB	Output is correct
40	Correct	56 ms	5036 KB	Output is correct
41	Correct	36 ms	4292 KB	Output is correct
42	Correct	37 ms	4252 KB	Output is correct
43	Correct	49 ms	4388 KB	Output is correct
44	Correct	53 ms	4308 KB	Output is correct
45	Correct	35 ms	4748 KB	Output is correct
46	Correct	38 ms	4020 KB	Output is correct
47	Correct	36 ms	5156 KB	Output is correct
48	Correct	42 ms	4908 KB	Output is correct
49	Correct	29 ms	4456 KB	Output is correct
50	Correct	53 ms	4636 KB	Output is correct

Submission #507511

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 17.0 / 17.0

Subtask #3 20.0 / 20.0

Subtask #4 24.0 / 24.0

Subtask #5 27.0 / 27.0

Subtask #1
12.0 / 12.0

Subtask #2
17.0 / 17.0

Subtask #3
20.0 / 20.0

Subtask #4
24.0 / 24.0

Subtask #5
27.0 / 27.0