随笔分类 -  ACM解题报告（POJ）

摘要：A Bug's LifeTime Limit:10000MSMemory Limit:65536KTotal Submissions:23380Accepted:7603DescriptionBackgroundProfessor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they feature two different genders and that they only interact with bugs of the opposite gender 阅读全文

摘要：Wireless NetworkTime Limit:10000MSMemory Limit:65536KTotal Submissions:13323Accepted:5638DescriptionAn earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless network with the lap computers, but an unexpected aftershock attacked, all computers in the n 阅读全文

摘要：Cube StackingTime Limit:2000MSMemory Limit:30000KTotal Submissions:15900Accepted:5419Case Time Limit:1000MSDescriptionFarmer John and Betsy are playing a game with N (1 <= N <= 30,000)identical cubes labeled 1 through N. They start with N stacks, each containing a single cube. Farmer John asks 阅读全文

摘要：Navigation NightmareTime Limit:2000MSMemory Limit:30000KTotal Submissions:3167Accepted:1317Case Time Limit:1000MSDescriptionFarmer John's pastoral neighborhood has N farms (2 <= N <= 40,000), usually numbered/labeled 1..N. A series of M (1 <= M < 40,000) vertical and horizontal roads 阅读全文

摘要：Find them, Catch themTime Limit:1000MSMemory Limit:10000KTotal Submissions:23816Accepted:7130DescriptionThe police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs in the city, Gang Dragon and Gang Snake. However, the police first needs to identify whi 阅读全文

摘要：The SuspectsTime Limit:1000MSMemory Limit:20000KTotal Submissions:17128Accepted:8254DescriptionSevere acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize transmission to others, the best strategy is to separa 阅读全文

摘要：Is It A Tree?Time Limit:1000MSMemory Limit:10000KTotal Submissions:17328Accepted:5934DescriptionA tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes connected by directed edges between nodes satisfying the following properties.There is exa 阅读全文

摘要：食物链Time Limit:1000MSMemory Limit:10000KTotal Submissions:33631Accepted:9770Description动物王国中有三类动物A,B,C，这三类动物的食物链构成了有趣的环形。A吃B， B吃C，C吃A。现有N个动物，以1－N编号。每个动物都是A,B,C中的一种，但是我们并不知道它到底是哪一种。有人用两种说法对这N个动物所构成的食物链关系进行描述：第一种说法是"1 X Y"，表示X和Y是同类。第二种说法是"2 X Y"，表示X吃Y。此人对N个动物，用上述两种说法，一句接一句地说出K句话，这K句 阅读全文

摘要：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, 阅读全文

摘要：Katu PuzzleTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 5749Accepted: 2077DescriptionKatu Puzzle is presented as a directed graph G(V, E) with each edge e(a, b) labeled by a boolean operator op (one of AND, OR, XOR) and an integer c (0 ≤ c ≤ 1). One Katu is solvable if one can find each 阅读全文

摘要：WeddingTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 5880Accepted: 1802Special JudgeDescriptionUp to thirty couples will attend a wedding feast, at which they will be seated on either side of a long table. The bride and groom sit at one end, opposite each other, and the bride wears an ela 阅读全文

摘要：Map LabelerTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 1023Accepted: 337DescriptionMap generation is a difficult task in cartography. A vital part of such task is automatic labeling of the cities in a map; where for each city there is text label to be attached to its location, so that n 阅读全文

摘要：Ikki's Story IV - Panda's TrickTime Limit: 1000MSMemory Limit: 131072KTotal Submissions: 6065Accepted: 2234Descriptionliympanda, one of Ikki’s friend, likes playing games with Ikki. Today after minesweeping with Ikki and winning so many times, he is tired of such easy games and wants to play 阅读全文

摘要：FootballTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 1934Accepted: 958DescriptionConsider a single-elimination football tournament involving 2n teams, denoted 1, 2, …, 2n. In each round of the tournament, all teams still in the tournament are placed in a list in order of increasing index 阅读全文

摘要：Check the difficulty of problemsTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 3191Accepted: 1416DescriptionOrganizing a programming contest is not an easy job. To avoid making the problems too difficult, the organizer usually expect the contest result satisfy the following two terms: 1. A 阅读全文

摘要：Collecting BugsTime Limit: 10000MSMemory Limit: 64000KTotal Submissions: 1244Accepted: 523Case Time Limit: 2000MSSpecial JudgeDescriptionIvan is fond of collecting. Unlike other people who collect post stamps, coins or other material stuff, he collects software bugs. When Ivan gets a new program, he 阅读全文

摘要：Scout YYF ITime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 3723Accepted: 928DescriptionYYF is a couragous scout. Now he is on a dangerous mission which is to penetrate into the enemy's base. After overcoming a series difficulties, YYF is now at the start of enemy's famous "mine 阅读全文

摘要：Manhattan WiringTime Limit: 5000MSMemory Limit: 65536KTotal Submissions: 1112Accepted: 636DescriptionThere is a rectangular area containing n × m cells. Two cells are marked with “2”, and another two with “3”. Some cells are occupied by obstacles. You should connect the two “2”s and also the tw 阅读全文

摘要：Tony's TourTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 2648Accepted: 1197DescriptionA square township has been divided up into n*m(n rows and m columns) square plots (1<=N,M<=8),some of them are blocked, others are unblocked. The Farm is located in the lower left plot and the 阅读全文

摘要：Manhattan WiringTime Limit: 5000MSMemory Limit: 65536KTotal Submissions: 1110Accepted: 634DescriptionThere is a rectangular area containing n × m cells. Two cells are marked with “2”, and another two with “3”. Some cells are occupied by obstacles. You should connect the two “2”s and also the tw 阅读全文