hihoCoder #1270 : 建造基地 【dp】

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <stack>
#define PI acos(-1.0)
#define CLR(a, b) memset(a, (b), sizeof(a))
#define fi first
#define se second
#define ll o<<1
#define rr o<<1|1
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int MAXN = 1e4+10;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
void getmax(int &a, int b) {a = max(a, b); }
void getmin(int &a, int b) {a = min(a, b); }
void add(LL &x, LL y) { x += y; x %= MOD; }
pii a[110];
LL dp[MAXN];
int main()
{
int Q;
while(scanf("%d", &Q) != EOF)
{
while(Q--)
{
int N, M, K, T;
scanf("%d%d%d%d", &N, &M, &K, &T);
for(int i = 1; i <= M; i++) scanf("%d", &a[i].fi);
for(int i = 1; i <= M; i++) scanf("%d", &a[i].se);
bool flag = true; LL ans = 0;
for(int i = 1; i <= N; i++)
{
if(i > 1) {
for(int j = 1; j <= M; j++)
a[j].se /= T;
}
CLR(dp, -1); dp[0] = 0;
for(int j = 1; j <= M; j++) {
for(int k = 0; k <= K; k++) {
if(dp[k] != -1) {
int next = min(K, k + a[j].se);
if(dp[next] == -1 || dp[next] > dp[k] + a[j].fi)
dp[next] = dp[k] + a[j].fi;
}
}
}
if(dp[K] == -1)
{
flag = false;
break;
}
ans += dp[K];
}
if(!flag) {
printf("No Answer\n");
}
else
printf("%lld\n", ans);
}
}
return 0;
}