uva 10817 Headmaster's Headache

最新推荐文章于 2023-01-20 20:12:50 发布

红鲤鱼遇绿鲤鱼

最新推荐文章于 2023-01-20 20:12:50 发布

阅读量457

点赞数

分类专栏：根本不会/就差一点/记得再看动态规划经典例题文章标签： uva 动态规划状态压缩

本文链接：https://blog.csdn.net/tengfei461807914/article/details/78783960

版权

动态规划同时被 3 个专栏收录

119 篇文章 2 订阅

订阅专栏

根本不会/就差一点/记得再看

73 篇文章 0 订阅

订阅专栏

经典例题

39 篇文章 0 订阅

订阅专栏

原题：
The headmaster of Spring Field School is considering employing some new teachers for certain subjects.
There are a number of teachers applying for the posts. Each teacher is able to teach one or more subjects. The headmaster wants to select applicants so that each subject is taught by at least two
teachers, and the overall cost is minimized.
Input
The input consists of several test cases. The format of each of them is explained below: The first line contains three positive integers S, M and N. S (≤ 8) is the number of subjects, M(≤ 20) is the number of serving teachers, and N (≤ 100) is the number of applicants. Each of the following M lines describes a serving teacher. It first gives the cost of employing him/her (10000 ≤ C ≤ 50000), followed by a list of subjects that he/she can teach. The subjects are numbered from 1 to S. You must keep on employing all of them. After that there are N lines, giving the details of the applicants in the same format.
Input is terminated by a null case where S = 0. This case should not be processed.
Output
For each test case, give the minimum cost to employ the teachers under the constraints.
Sample Input
2 2 2
10000 1
20000 2
30000 1 2
40000 1 2
0 0 0
Sample Output
60000

中文：
给你三个数s，m，n
分别表示有多少门课，有多少个在职教师，有多少个应聘教师
然后给你n+m行，每行有每个老师的工资和能教的课

现在要求每门课至少有两个老师教，每个老师可以教多门课，在职教师不能辞退，问你在满足每门课最少两个老师的情况下，需要花多少钱来雇佣老师

#include<bits/stdc++.h>
using namespace std;
const int maxn=1<<8;
int dp[150][maxn][maxn];
int n,m,s,st[150],c[150];
const int inf=121*50000;
int dfs(int i,int s0,int s1,int s2)
{
    if(i==m+n)
    {
        return s2==(1<<s)-1 ? 0 : inf;
    }
    int& ans=dp[i][s1][s2];
    if(ans>=0)
        return ans;
    ans=inf;
    if(i>=m)
        ans=dfs(i+1,s0,s1,s2);
    int m0=st[i]&s0,m1=st[i]&s1;
    s0^=m0;
    s1=(s1^m1)|m0;
    s2|=m1;
    ans=min(ans,c[i]+dfs(i+1,s0,s1,s2));
    return ans;
}

int main()
{
    ios::sync_with_stdio(false);
    string line;
    while(cin>>s>>m>>n)
    {
        cin.ignore();
        if(s==0)
            return 0;
        memset(dp,-1,sizeof(dp));
        memset(st,0,sizeof(st));
        for(int i=0;i<n+m;i++)
        {
            string tmp;
            int res;
            getline(cin,tmp);
            stringstream ss(tmp);
            ss>>c[i];
            while(ss>>res)
            {
                st[i]|=(1<<(res-1));
            }
            //cout<<st[i]<<endl;
        }

        int ans=dfs(0,(1<<s)-1,0,0);
        cout<<ans<<endl;
    }
    return 0;
}