uva 12168 - Cat vs. Dog (最大匹配 ——最大独立集)
来源:互联网 发布:中兴算法部 编辑:程序博客网 时间:2024/06/05 11:40
Problem C - Cat vs. Dog
Time limit: 2 seconds
The latest reality show has hit the TV: ``Cat vs. Dog''. In this show, a bunch of cats and dogs compete for the very prestigiousBest Pet Ever title. In each episode, the cats and dogs get to show themselves off, after which the viewers vote on which pets should stay and which should be forced to leave the show.
Each viewer gets to cast a vote on two things: one pet which should be kept on the show, and one pet which should be thrown out. Also, based on the universal fact that everyone is either a cat lover (i.e. a dog hater) or a dog lover (i.e. a cat hater), it has been decided that each vote must name exactly one cat and exactly one dog.
Ingenious as they are, the producers have decided to use an advancement procedure which guarantees that as many viewers as possible will continue watching the show: the pets that get to stay will be chosen so as to maximize the number of viewers who get both their opinions satisfied. Write a program to calculate this maximum number of viewers.
Input
On the first line one positive number: the number of testcases, at most 100. After that per testcase:
- One line with three integers c, d, v (1 ≤ c,d ≤ 100 and 0 ≤ v ≤ 500): the number of cats, dogs, and voters.
- v lines with two pet identifiers each. The first is the pet that this voter wants to keep, the second is the pet that this voter wants to throw out. A pet identifier starts with one of the characters `C' or `D', indicating whether the pet is a cat or dog, respectively. The remaining part of the identifier is an integer giving the number of the pet (between 1 andc for cats, and between 1 and d for dogs). So for instance, ``D42'' indicates dog number 42.
Output
Per testcase:- One line with the maximum possible number of satisfied voters for the show.
Sample Input
21 1 2C1 D1D1 C11 2 4C1 D1C1 D1C1 D2D2 C1
Sample Output
13
#include <cstdio>#include <cstring>#include <algorithm>#include <vector>using namespace std;int const maxn = 500 + 5;struct BPM{ int n,m; vector<int> G[maxn]; int left[maxn]; bool T[maxn]; void init(int n,int m){ this -> n = n; this -> m = m; for(int i = 0;i < n;i++) G[i].clear(); } void AddEdge(int u,int v){ G[u].push_back(v); } bool match(int u){ for(int i = 0;i < G[u].size();i++){ int v = G[u][i]; if(!T[v]){ T[v] = true; if(left[v] == -1 || match(left[v])){ left[v] = u; return true; } } } return false; } int solve(){ memset(left,-1,sizeof(left)); int ans = 0; for(int u = 0;u < n;u++){ memset(T,0,sizeof(T)); if(match(u)) ans++; } return ans; }};BPM solver;char like[505][10];char disl[505][10];int main(){ int t,c,d,v; char str[20]; scanf("%d",&t); while(t--){ scanf("%d%d%d",&c,&d,&v); solver.init(v,v); for(int i = 0;i < v;i++){ scanf("%s",like[i]); scanf("%s",disl[i]); } for(int i = 0;i < v;i++) for(int j = 0;j < v;j++) if(!strcmp(like[i],disl[j]) || !strcmp(disl[i],like[j])){ solver.AddEdge(i,j); } printf("%d\n",v - solver.solve() / 2); } return 0;}
- uva 12168 - Cat vs. Dog (最大匹配 ——最大独立集)
- UVA 12168 - Cat vs. Dog(二分图匹配+最大独立集)
- UVA 12168 Cat vs. Dog(二分图匹配+匈牙利算法+最大独立集+数据转化)
- hdu Cat vs. Dog (最大匹配 ——最大独立集)
- hdu3829-Cat VS Dog(最大独立集,匹配问题)
- hdu3829——Cat VS Dog(最大独立集)
- UVA 12168 Cat vs. Dog(最大独立集)
- hdu 2768 Cat vs. Dog 最大独立集(最大匹配)
- HDU 3829 Cat VS Dog 最大独立集(最大匹配)
- HDU 3829 — Cat VS Dog 最大独立集
- (beginer) 二分图(最大独立集) UVA 12168 Cat vs. Dog
- HDU 3829 Cat VS Dog(最大独立集|二分图最大匹配)
- hdu2768 Cat vs. Dog (最大独立集)
- hdu_2768 Cat vs. Dog 最大独立集
- hdu2768 Cat vs. Dog【最大独立集】
- hdu 3829 Cat VS Dog (二分匹配 求 最大独立集)
- HDU 3829 Cat VS Dog(最大独立集)
- HDU 3829 Cat VS Dog (最大独立点集)
- layout_weight
- STL 函数初步
- 彻底了解指针数组,数组指针,以及函数指针,以及堆中的分配规则
- PCA
- 编译Zimbra
- uva 12168 - Cat vs. Dog (最大匹配 ——最大独立集)
- IM:手机客户端和服务端通信的资料
- 如何提高数据库查询速度
- ArcGIS Server 9.2实现基于web浏览器的在线编辑
- UVA 639 放车问题
- static全局变量与普通的全局变量有什么区别
- BSP开发包与SDK包的功能
- linux释放内存脚本,解决ubuntu老是死机问题
- android的ui设计