Submission #1187564

---

Source Code Expand

#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<iterator>
#include<climits>
#include<string>
#include<set>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i = ((int)(a));i<=((int)(b));i++)
#define irep(i,n) for(int i = ((int)(n)-1);i>=0;i--)
#define ireg(i,a,b) for(int i = ((int)(b));i>=((int)(a));i--)
typedef long long int lli;
typedef pair<int, int> mp;
#define fir first
#define sec second
#define IINF INT_MAX
#define LINF LLONG_MAX
#define eprintf(...) fprintf(stderr,__VA_ARGS__)
#define pque(type) priority_queue<type,vector<type>,greater<type> >
#define memst(a,b) memset(a,b,sizeof(a))

int x, y, z, n, m;
vector<pair<int, int>> t;
vector<vector<vector<int>>> dp;

int f(int i, int k, int j){
	if(dp[i][k][j]!=-1) return dp[i][k][j];
	if(i-t[j].fir < 0) return dp[i][k][j] = f(i, k, j-1);
	return dp[i][k][j] = max(f(i, k, j-1), f(i-t[j].fir, k-1, j-1) + t[j].sec);
}

int main(void){
	scanf("%d%d%d", &x, &y, &n); z = x + y; m = min(x, n);
	t.resize(n+1);
	reg(i, 1, n) scanf("%d%d", &t[i].fir, &t[i].sec);
	dp.assign(z+1, vector<vector<int>>(m+1, vector<int>(n+1, -1)));
	
	rep(i, m+1) rep(j, n+1) dp[0][i][j] = 0;
	rep(i, z+1) rep(j, n+1) dp[i][0][j] = 0;
	rep(i, z+1) rep(j, m+1) dp[i][j][0] = 0;
	
	int ans = 0;
	rep(k, m+1) rep(i, z+1)	ans = max(ans, f(i,k,n));

	cout << ans << endl;
	
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:40:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d", &x, &y, &n); z = x + y; m = min(x, n);
                             ^
./Main.cpp:42:50: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  reg(i, 1, n) scanf("%d%d", &t[i].fir, &t[i].sec);
                                                  ^

Judge Result