hdu1179Ollivanders: Makers of Fine Wands since 382 BC.(二分匹配)
来源:互联网 发布:淘宝网上有卖烟的吗 编辑:程序博客网 时间:2024/05/16 12:00
Ollivanders: Makers of Fine Wands since 382 BC.
Problem Description
In Diagon Alley ,there is only one Wand-seller,peeling gold letters over the door read Ollivanders: Makers of Fine Wands since 382 BC.A single wand lay on a faded purple cushion in the dusty window.
A tinkling bell rang somewhere in the depths of the shop as they stepped inside.It was a tiny place,empty execpt for a single spindly chair which Hagrid sat on to wait.Harry felt strangely as though he had entered a very strict library;he swallowd a log of new questions which had just occurred to him and looked instead at the thousands of narrow boxes piled neatly right up to the ceiling.For some reason,the back of his neck prickled.The very dust and silence in here seemed to tingle with some secret magic.
‘Good afternoon,’said a soft voice.Harry jumped.Hagrid must have jumped,too,because there was a loud crunching noise and he got quickly off the spindly chair.
An old man was standing before them, his wide pale eyes shining like moons through the gloom of the shop.
‘Hello,’ said Harry awkwardly.
‘Ah yes,’ said the man. ‘Yes,yes. I thought I’d be seeing you soon,Harry Potter.’It wasn’t a question.You have your mother’s eyes. It seems only yesterday she was in here herself,buying her first wand. Ten and a quarter inches long, swishy, made of willow. Nice wand for charm work.’
Mor Ollivander moved closer to Harry.Harry wished he would blink.Those sivery eyes were a bit creepy.
‘Your father, on the other hand, favoured a mahogany wand.Eleven inches.Pliable.A little more power and excellent for transfiguration.Well ,I say your father favoured it - it’s really the wand that choosed the wizard, of cource.’
Yes, some wands fit some wizards ,as we all know.But what Harry doesn’t know is Ollivander have met a big trouble.That’s more than twenty years ago,When Harry’s father James Potter was still a student in Hogwarts.He went Diagon Alley to buy new books,passing by Ollivander’s shop.Ollivander was crazy for a problem:He was too busy to choose most suitable wand for every wizard.Even more,there are too many customer that day.Though Ollivader knew every wand’s favourite,he could not choose as many wizards as possible to get the wands. So James Potter,a very clever man ,gave him a magic disk with your program ,to help him sell wands as many as possible.
Please notice: one wand can only be sold to one wizard, and one wizard can only buy one wand,too.
Input
There are several cases. For each case, there is two integers N and M in the first line,which mean there is N wizards and M wands(0 < N <= M <= 100).
Then M lines contain the choices of each wand.The first integer in i+1th line is Ki,and after these there are Ki integers Bi,j which are the wizards who fit that wand. (0<=Ki<=N,1<=Bi,j<=N)
Output
Only one integer,shows how many wands Ollivander can sell.
Sample Input
3 4
3 1 2 3
1 1
1 1
0
Sample Output
2
Hint
Hint
Wand 1 fits everyone, Wand 2,3 only fit the first wizard,and Wand 4 does not fit anyone.So Ollivanders can sell two wands:
sell Wand 1 to Wizard 2 and Wand 2 to Wizard 1,or sell Wand 1 to Wizard 3 and Wand 3 to Wizard 1 ,or some other cases. But
he cannot sell 3 wands because no 3 wands just fit 3 wizards.
蛋疼的题意 可以练练阅读理解 就是讲有m个魔法棒, n个魔法师,每一个魔杖有一些适合的魔法师,
简单的二分匹配 左边魔法师 右边魔法棒
#include <stdio.h>#include <string.h>#include <algorithm>#include <iostream>using namespace std;void getmap();int hungarian();bool dfs(int u);int n, m;int used[200];int matching[200];int plan[150][150];int main(){ getmap(); //}void getmap(){ while(scanf("%d%d", &n, &m) != EOF) { memset(plan, 0, sizeof(plan)); for(int i = 1; i <= m; i++) { int k; scanf("%d", &k); for(int j = 0; j < k; j++) { int y; scanf("%d", &y); plan[y][i] = 1; } } printf("%d\n", hungarian()); }}int hungarian(){ int ans = 0; memset(matching, -1, sizeof(matching)); for(int i = 1; i <= n; i++) { memset(used, 0, sizeof(used)); if(dfs(i)) ans++; } return ans;}bool dfs(int u){ for(int i = 1; i <= m; i++) { if(plan[u][i] && !used[i]) { used[i] = true; if(matching[i] == -1 || dfs(matching[i])) { matching[i] = u; return true; } } } return false;}
- hdu1179Ollivanders: Makers of Fine Wands since 382 BC.(二分匹配)
- hdu1179Ollivanders: Makers of Fine Wands since 382 BC.(二分匹配)
- hdu1179Ollivanders: Makers of Fine Wands since 382 BC. (二分最大匹配)
- HDU1179Ollivanders: Makers of Fine Wands since 382 BC.(最大匹配)
- hdu 1179 Ollivanders: Makers of Fine Wands since 382 BC. (二分匹配)
- HDU 1179 Ollivanders: Makers of Fine Wands since 382 BC. 二分匹配(简单)
- HDOj 题目1179 Ollivanders: Makers of Fine Wands since 382 BC.(二分图最大匹配)
- HDU 1179 Ollivanders: Makers of Fine Wands since 382 BC.(二分图匹配--匈牙利算法)
- HDU 1179 Ollivanders: Makers of Fine Wands since 382 BC.(二分图匹配+匈牙利算法)
- hdu_1179 Ollivanders: Makers of Fine Wands since 382 BC. 二分图匹配
- HDU 1179 Ollivanders: Makers of Fine Wands since 382 BC. 二分图匹配
- HDU1179_Ollivanders: Makers of Fine Wands since 382 BC.(二分图/最大匹配)
- Hdoj 1179 Ollivanders: Makers of Fine Wands since 382 BC. 【二分匹配】
- HDU 1179--Ollivanders Makers of Fine Wands since 382 BC【二分图的最大匹配】
- HPU1179 Ollivanders: Makers of Fine Wands since 382 BC.【二分图最大匹配】
- hdoj 1179 Ollivanders: Makers of Fine Wands since 382 BC. (二分图--最大匹配)
- HDU Problem 1179 Ollivanders: Makers of Fine Wands since 382 BC.【二分图匹配】
- HDU-1179-Ollivanders: Makers of Fine Wands since 382 BC.【二分匹配】【匈牙利算法】
- libpcap编程:Sniffer
- Oracle 11g新特性:多列统计信息(MultiColumn Statistics)
- 慢查询日志的数据结构与API
- linux偶发性崩溃的程序该怎么调试 coredump gdb
- calculate a point in triangle
- hdu1179Ollivanders: Makers of Fine Wands since 382 BC.(二分匹配)
- 使用cocoapods 中的use_frameworks! 和.h文件冲突
- Oracle 11g新特性:SQL Query Result Cache
- Android中Spinner控件关于二次点击同一item无响应事件解析及处理方法
- XposedHook:hook敏感函数
- 基数、选择性、直方图
- 二叉树的二叉链表存储结构构建以及先序遍历
- Linux Core Dump
- Linux core dump详解