_阿阿阿阿欢

CoursesTime Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4146    Accepted Submission(s): 1975Problem DescriptionConsider a group of

Treasure ExplorationTime Limit: 6000MS Memory Limit: 65536KTotal Submissions: 7343 Accepted: 3002DescriptionHave you ever read any book about treasure explorati

Marriage Match IITime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2794    Accepted Submission(s): 938Problem DescriptionPresumably, y

The Perfect StallTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20795 Accepted: 9386DescriptionFarmer John completed his new barn just last week, com

Selecting CoursesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9363 Accepted: 4164DescriptionIt is well known that it is not easy to select courses

Game with PearlsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1916    Accepted Submission(s): 672Problem DescriptionTom and Jerr

Battle shipsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 898    Accepted Submission(s): 315Problem DescriptionDear contestant, no

The King’s ProblemTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2137    Accepted Submission(s): 763Problem DescriptionIn the Kingd

1149 - Factors and MultiplesPDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBYou will be given two sets of integers. Let's call the

AsteroidsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17861 Accepted: 9729DescriptionBessie wants to navigate her spaceship through a dangerous ast

Girls and BoysTime Limit: 5000MS Memory Limit: 10000KTotal Submissions: 11134 Accepted: 4981DescriptionIn the second year of the university somebody started a s

过山车Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12727    Accepted Submission(s): 5585Problem DescriptionRPG girls今天和大家一起去游乐场玩，终于可

Ollivanders: Makers of Fine Wands since 382 BC.Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 1031    Accepted Submission(s): 567Pro

棋盘游戏Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2742    Accepted Submission(s): 1604Problem Description小希和Gardon在玩一个游戏：对一个N*M的棋盘

Place the RobotsTime Limit: 5 Seconds      Memory Limit: 32768 KB Robert is a famous engineer. One day he was given a task by his boss. The background of the task was the following:Giv

由题意可知，本意要求的是二分图的最小点覆盖集问题，即最小的顶点集合，“覆盖”所有的边，可以转化成二分图的最大匹配问题。 二分图的最小点覆盖数 == 最大匹配数。

COURSESTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 19581 Accepted: 7709DescriptionConsider a group of N students and P courses. Each student visit

Uncle Tom's Inherited LandTime Limit: 2 Seconds      Memory Limit: 65536 KB Your old uncle Tom inherited a piece of land from his great-great-uncle. Originally, the property had been in th

Air RaidTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7451 Accepted: 4434DescriptionConsider a town where all the streets are one-way and each stree

题意：给你一个N*M的矩阵，矩阵里面有一些位置是1。每次操作可以划去同一行或者同一列的1，问你最少需要几次操作。解析：最小点数覆盖的水题，没啥好说的。根据矩阵建好关系图，直接匈牙利就行了。