HDU-1845-Jimmy's Assignment

【HDU-1845-Jimmy's Assignment】的更多相关文章

HDU 1845 Jimmy’s Assignment（二分匹配）

Jimmy’s Assignment Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 464 Accepted Submission(s): 224 Problem Description Jimmy is studying Advanced Graph Algorithms at his university. His most…

HDU - 1845 Jimmy’s Assignment （二分匹配）

Description Jimmy is studying Advanced Graph Algorithms at his university. His most recent assignment is to find a maximum matching in a special kind of graph. This graph is undirected, has N vertices and each vertex has degree 3. Furthermore, the gr…

HDU 4014 Jimmy’s travel plan(图计数)

Jimmy’s travel plan Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 341 Accepted Submission(s): 58 Problem Description Jimmy lives in a huge kingdom which contains lots of beautiful cities.…

hdu 1845

一看题意就是二分匹配问题,建边是双向的,两个集合都是n个点这题的图很特殊,每个点都要与三个点相连,在纸上画了六个点的图就感觉此图最大匹配肯定是六,除以2就是原图的匹配了,就感觉这样的图肯定会达到满匹配一看数据5000个点,就用链表写了,还是超时,本来想在网上找份解题报告,看一下怎么优化的,却搜不到就用自己的猜想,直接输出n/2,结果A了,,这尼玛什么题啊,,, #include<stdio.h> int main() { int t,n,i,a,b; scanf("%d&quo…

【HDU 6006】Engineer Assignment（状压DP）

Problem Description In Google, there are many experts of different areas. For example, MapReduce experts, Bigtable experts, SQL experts, etc. Directors need to properly assign experts to various projects in order to make the projects going smoothly.…