Submission #1613485

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7;
const int MAX_N=10000;
int n,u,c,C,w[100],v[100];
int dp[51][10010],tmp[10010];
vector<int> vec[51];

int main(){
	cin >> n >> u >> C;
	
	REP(i,0,n){
		cin >> w[i] >> v[i] >> c;
		vec[c-1].push_back(i);
	}
	
	REP(i,0,50) {
		RREP(co,C,0) {
			memmove(tmp,dp[co],sizeof(tmp));
				
			REP(j,0,vec[i].size()){
				int tar=vec[i][j];
				RREP(k,u,w[tar]) tmp[k]=max(tmp[k],tmp[k-w[tar]]+v[tar]);
			}
			
			RREP(j,u,0) dp[co+1][j]=max(dp[co+1][j],tmp[j]);
		}
	}
	
	int ma=0;
	REP(i,0,C+1) REP(j,0,u+1) ma=max(ma,dp[i][j]);
	
	cout << ma << endl;
	return 0;
}

Submission Info

Judge Result