题目链接
总体思路:二分加贪心
贪心思路:
1)先把3用完
先把3用在血量大于等于3且血量为奇数的怪物上,使其变成一个偶数且不浪费
再把3用再血量大于等于6的怪物上(一次要用2个),保证这个怪物的血量还是偶数,且不浪费
再把3用再血量最多的怪物上
2)再把2用完
把2用再血量大于等于2的怪物身上,保证不浪费
再把2用再血量为1的怪物身上(只剩下1了)
3)最后把1用完
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
int a[N], b[N], n, m, t, cnt[4], c[N][4], cp[N];
bool check(ll p) {
memcpy(cp, b, sizeof b);
ll k = p / n;
ll s = p % n;
ll x = (ll) cnt[1] * k + c[s][1];
ll y = (ll) cnt[2] * k + c[s][2];
ll z = (ll) cnt[3] * k + c[s][3];
// 把3用完
for (int i = 1; z > 0 && i <= m; i++) {
if (cp[i] >= 3 && (cp[i] & 1)) {
cp[i] -= 3;
z--;
}
}
for (int i = 1; z > 1 && i <= m; i++) {
if (cp[i] < 6)continue;
ll x = cp[i] / 6;
if (2 * x <= z) {
cp[i] -= 6 * x;
z -= 2 * x;
} else {
cp[i] -= 3 * (z - (z & 1));
z &= 1;
}
}
sort(cp + 1, cp + 1 + m, greater<int>());
for (int i = 1; z > 0 && i <= m; i++) {
if (!cp[i])continue;
cp[i] = max(0, cp[i] - 3);
z--;
}
for (int i = 1; z > 0 && i <= m; i++) {
if (!cp[i])continue;
cp[i] = max(0, cp[i] - 3);
z--;
}
// 把2用完
for (int i = 1; y > 0 && i <= m; i++) {
if (cp[i] >= 2) {
ll x = cp[i] / 2;
if (y >= x) {
y -= x;
cp[i] -= 2 * x;
} else {
cp[i] -= 2 * y;
y = 0;
}
}
}
for (int i = 1; y > 0 && i <= m; i++) {
if (cp[i]) {
y--;
cp[i] = 0;
}
}
ll res = 0;
// 判断剩下的怪物血量和能不能用1打死
for (int i = 1; i <= m; i++)res += cp[i];
if (res <= x)return 1;
return 0;
}
int main() {
scanf("%d", &t);
while (t--) {
scanf("%d", &n);
cnt[1] = cnt[2] = cnt[3] = 0;
c[0][1] = c[0][2] = c[0][3] = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
cnt[a[i]]++;
for (int j = 1; j <= 3; j++)c[i][j] = c[i - 1][j];
c[i][a[i]]++;
}
scanf("%d", &m);
ll l = m, r = 0;
for (int i = 1; i <= m; i++)scanf("%d", &b[i]), r += b[i];
while (l < r) {
ll mid = l + r >> 1;
if (check(mid))r = mid;
else l = mid + 1;
}
printf("%lld\n", l);
}
return 0;
}