HDU 3211—— Washing Clothes【分组背包 & 平衡划分 & 分组01背包】

最新推荐文章于 2022-09-09 22:07:37 发布

nirvana · rebirth

最新推荐文章于 2022-09-09 22:07:37 发布

阅读量222

点赞数

分类专栏： DP 文章标签：分组背包平衡划分分组01背包 HDU

本文链接：https://blog.csdn.net/Q_1849805767/article/details/102835934

版权

DP 专栏收录该内容

72 篇文章 1 订阅

订阅专栏

这道题目描述了一对情侣如何通过分组洗衣策略，以最小的时间完成不同颜色衣物的洗涤工作。输入包含颜色数量和衣物数量，以及每件衣物的洗涤时间和颜色。输出是最短的洗涤总时间。解决方法是将每种颜色视为一组，进行01背包处理，并应用平衡划分策略找到最佳分配方式。

摘要由CSDN通过智能技术生成

题目传送门

Description

Dearboy was so busy recently that now he has piles of clothes to wash. Luckily, he has a beautiful and hard-working girlfriend to help him. The clothes are in varieties of colors but each piece of them can be seen as of only one color. In order to prevent the clothes from getting dyed in mixed colors, Dearboy and his girlfriend have to finish washing all clothes of one color before going on to those of another color.

From experience Dearboy knows how long each piece of clothes takes one person to wash. Each piece will be washed by either Dearboy or his girlfriend but not both of them. The couple can wash two pieces simultaneously. What is the shortest possible time they need to finish the job?

Input

The input contains several test cases. Each test case begins with a line of two positive integers M and N (M < 10, N < 100), which are the numbers of colors and of clothes. The next line contains M strings which are not longer than 10 characters and do not contain spaces, which the names of the colors. Then follow N lines describing the clothes. Each of these lines contains the time to wash some piece of the clothes (less than 1,000) and its color. Two zeroes follow the last test case.

Output

For each test case output on a separate line the time the couple needs for washing.

Sample Input

3 4
red blue yellow
2 red
3 blue
4 blue
6 red
0 0

Sample Output

10

题意：

有一堆不同颜色的衣服需要洗，为了防止不同颜色的衣服互相染色，必须洗完一种颜色的衣服再洗另一种颜色。共有两个人洗衣服，求洗完衣服所需最少的时间。

分析：

不同颜色不可一起洗，各种颜色衣服最大值相加就是答案
每种颜色分一组，组内进行01背包
平衡划分问题，在所有时间中找出和最接近 sum / 2 的最大值；

AC代码：

#include <iostream>
#include <vector>
#include <utility>
#include <cstring>
#include <string>
#include <algorithm>
#include <map>
#include <queue>
#include <stack>
#include <cstdio>
#include <fstream>
#include <set>
using namespace std;
typedef long long ll;

const int INF = 0x3f3f3f;
const int MAXN = 1e5 + 100;

int max(int a, int b, int c) {
	int t = a > b ? a : b;
	return t > c ? t : c;
}
map<string, int>mp;
vector<int>vec[MAXN];
int dp[15][MAXN];
int sum[15];
int main() {
	int kk, n;
	string str;
	int x;
	while (cin >> kk >> n, kk || n) {
		memset(dp, 0, sizeof dp);
		memset(sum, 0, sizeof sum);
		for (int i = 0; i <= kk; i++) {
			vec[i].clear();
		}
		mp.clear();
		for (int i = 1; i <= kk; i++) {
			cin >> str;
			mp[str] = i;
		}
		for (int i = 1; i <= n; i++) {
			cin >> x >> str;
			vec[mp[str]].push_back(x);
			sum[mp[str]] += x;
		}
		int ans = 0;
		for (int k = 1; k <= kk; k++) {
			for (int i = 0; i < vec[k].size(); i++) {
				for (int j = sum[k]+1 / 2; j >= vec[k][i]; j--) {
					dp[k][j] = max(dp[k][j], dp[k][j - vec[k][i]] + vec[k][i]);
				}
			}
			ans += max(sum[k] / 2, sum[k] - dp[k][sum[k] / 2]);
		}
		cout << ans << endl;
	}
	return 0;
}