摘要：Divide GroupsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 423Accepted Submission(s): 161Problem DescriptionThis year is the 60th anniversary of NJUST, and to make the celebration more colorful, Tom200 is going to invite distinguished alumnus bac
阅读全文
摘要：Prince and PrincessTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 150Accepted Submission(s): 46Problem DescriptionThere are n princes and m princesses. Princess can marry any prince. But prince can only marry the princess they DO love.For all prin
阅读全文
摘要：奔小康赚大钱Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2129Accepted Submission(s): 923Problem Description传说在遥远的地方有一个非常富裕的村落,有一天,村长决定进行制度改革：重新分配房子。这可是一件大事,关系到人民的住房问题啊。村里共有n间房间,刚好有n家老百姓,考虑到每家都要有房住（如果有老百姓没房子住的话，容易引起不安定因素），每家必须分配到一间房子且只能得到一间房子。另一方面,村长和另
阅读全文
摘要：Rain on your ParadeTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 655350/165535 K (Java/Others)Total Submission(s): 2154Accepted Submission(s): 662Problem DescriptionYou’re giving a party in the garden of your villa by the sea. The party is a huge success, and everyone is here. It’s a warm, sun
阅读全文
摘要：National TreasuresTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 871Accepted Submission(s): 291Problem DescriptionThe great hall of the national museum has been robbed few times recently. Everyone is now worried about the security of the treasures
阅读全文
摘要：Jimmy’s AssignmentTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 464Accepted Submission(s): 224Problem DescriptionJimmy is studying Advanced Graph Algorithms at his university. His most recent assignment is to find a maximum matching in a special
阅读全文
摘要：Uncle Tom's Inherited Land*Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1247Accepted Submission(s): 542Special JudgeProblem DescriptionYour old uncle Tom inherited a piece of land from his great-great-uncle. Originally, the property had been
阅读全文
摘要：Warm up 2Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 28Accepted Submission(s): 8Problem Description Some 1×2 dominoes are placed on a plane. Each dominoe is placed either horizontally or vertically. It's guaranteed the dominoes in the
阅读全文
摘要：ChessboardTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 10743Accepted: 3338DescriptionAlice and Bob often play games on chessboard. One day, Alice draws a board with size M * N. She wants Bob to use a lot of cards with size 1 * 2 to cover the board. However, she thinks it too easy to bob,
阅读全文
摘要：MissileTime Limit: 2 Seconds Memory Limit: 65536 KBYou control N missile launching towers. Every tower has enough missiles, but for each tower only one missile can be launch at the same time. Before the launching, every missile need T1 seconds to leave the tower. Assume that all the missiles have t.
阅读全文
摘要：Cat VS DogTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 1770Accepted Submission(s): 600Problem DescriptionThe zoo have N cats and M dogs, today there are P children visiting the zoo, each child has a like-animal and a dislike-animal, if the chil
阅读全文
摘要：二分图匹配（匈牙利算法）1。一个二分图中的最大匹配数等于这个图中的最小点覆盖数König定理是一个二分图中很重要的定理，它的意思是，一个二分图中的最大匹配数等于这个图中的最小点覆盖数。如果你还不知道什么是最小点覆盖，我也在这里说一下：假如选了一个点就相当于覆盖了以它为端点的所有边，你需要选择最少的点来覆盖所有的边。2。最小路径覆盖=最小路径覆盖＝｜G｜－最大匹配数在一个N*N的有向图中，路径覆盖就是在图中找一些路经，使之覆盖了图中的所有顶点，且任何一个顶点有且只有一条路径与之关联；（如果把这些路径中的每条路径从它的起始点走到它的终点，那么恰好可以经过图中的每个顶点一次且仅一次）；如果
阅读全文
摘要：Treasure ExplorationTime Limit: 6000MSMemory Limit: 65536KTotal Submissions: 5480Accepted: 2154DescriptionHave you ever read any book about treasure exploration? Have you ever see any film about treasure exploration? Have you ever explored treasure? If you never have such experiences, you would neve
阅读全文
摘要：Guardian of DecencyTime Limit: 3000MSMemory Limit: 65536KTotal Submissions: 4071Accepted: 1702DescriptionFrank N. Stein is a very conservative high-sc...
阅读全文
摘要：Going HomeTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 13981Accepted: 7156DescriptionOn a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or vertically, to an adjacent point. For each little man, you need to p
阅读全文
摘要：Air RaidTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1904Accepted Submission(s): 1225Problem DescriptionConsider a town where all the streets are one-way and each street leads from one intersection to another. It is also known that starting from
阅读全文
摘要：Machine ScheduleTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3444Accepted Submission(s): 1669Problem DescriptionAs we all know, machine scheduling is a very classical problem in computer science and has been studied for a very long history. Sche
阅读全文
摘要：Strategic GameTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2916Accepted Submission(s): 1217Problem DescriptionBob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and then he is v
阅读全文
摘要：KindergartenTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 3866Accepted: 1832DescriptionIn a kindergarten, there are a lot of kids. All girls of the kids know each other and all boys also know each other. In addition to that, some girls and boys know each other. Now the teachers want to pi
阅读全文
摘要：The Perfect StallTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 14447Accepted: 6612DescriptionFarmer John completed his new barn just last week, complete with all the latest milking technology. Unfortunately, due to engineering problems, all the stalls in the new barn are different. For th
阅读全文
