根据rival关系可以构造一个图。对于任意一个连通分量C,如果将其中的x in DSP换到DDP,那么C中DDP的member必须放到DSP中,那么原先在DSP中x以外的member必须放到DDP中。所以每个连通分量只有两种状态,change or not change,change的cost就是连通分量中每个member的price之和,value就是DSP or PPP中人数的改变量(可能<0)。之后再用01背包求解。
#include<iostream>
#include<cstring>
#include<stdio.h>
#include<stdlib.h>
#include<queue>
using namespace std;
//UVA 13008 - Exposing corruption
const int maxn=210;
int D;
int P;
int R;
int B;
int price[maxn];
vector<int>mp[maxn];
vector<int>connected[maxn];
bool vis[maxn];
int connectcnt;
int cost[maxn];
int reward[maxn];
int ans;
void calconnectedpart(int st,int idx)
{
queue<int>que;
while(!que.empty()) que.pop();
vector<int>ret;
ret.clear();
que.push(st);
vis[st]=true;
while(!que.empty())
{
int now=que.front();
que.pop();
ret.push_back(now);
for(int i=0;i<mp[now].size();i++)
{
int next=mp[now][i];
if(vis[next]==true) continue;
que.push(next);
vis[next]=true;
}
}
connected[idx]=ret;
}
void knapsack()
{
int f[10010];
memset(f,0,sizeof(f));
for(int i=0;i<connectcnt;i++)
{
for(int v=B;v>=0;v--)
{
if(cost[i]<=v)
{
f[v]=max(f[v],f[v-cost[i]]+reward[i]);
}
}
}
ans=f[B];
}
void calDSP()
{
memset(cost,0,sizeof(cost));
memset(reward,0,sizeof(reward));
for(int i=0;i<connectcnt;i++)
{
for(int j=0;j<connected[i].size();j++)
{
int people=connected[i][j];
cost[i]+=price[people];
if(people>=1&&people<=D) reward[i]--;
else if(people>=D+1&&people<=D+P) reward[i]++;
}
}
}
void calPPP()
{
memset(cost,0,sizeof(cost));
memset(reward,0,sizeof(reward));
for(int i=0;i<connectcnt;i++)
{
for(int j=0;j<connected[i].size();j++)
{
int people=connected[i][j];
cost[i]+=price[people];
if(people>=1&&people<=D) reward[i]++;
else if(people>=D+1&&people<=D+P) reward[i]--;
}
}
}
int main()
{
freopen("input.txt","r",stdin);
// freopen("myall.out","w",stdout);
while(scanf("%d %d %d %d",&D,&P,&R,&B)!=EOF)
{
memset(vis,false,sizeof(vis));
memset(mp,0,sizeof(mp));
memset(connected,0,sizeof(connected));
memset(price,0,sizeof(price));
connectcnt=0;
ans=0;
for(int i=1;i<=D;i++)
{
scanf("%d",&price[i]);
}
for(int i=1;i<=P;i++)
{
scanf("%d",&price[D+i]);
}
for(int i=0;i<R;i++)
{
int r1=0;
int r2=0;
scanf("%d %d",&r1,&r2);
r2+=D;
mp[r1].push_back(r2);
mp[r2].push_back(r1);
}
for(int i=1;i<=D+P;i++)
{
if(vis[i]==true) continue;
calconnectedpart(i,connectcnt);
connectcnt++;
}
calDSP();
knapsack();
printf("%d ",D+ans);
ans=0;
calPPP();
knapsack();
printf("%d\n",P+ans);
}
}