Fatedayt

摘要： POJ1770 Special ExperimentTime Limit:1000MSMemory Limit:30000KTotal Submissions:1325Accepted:429DescriptionAs we know, an atom can be in different energy states (or "energy levels"). Usually, when it transits from a higher energy state to a lower one, it will emit a photon, whose energy is 阅读全文

摘要： POJ3659 Cell Phone NetworkTime Limit:1000MSMemory Limit:65536KTotal Submissions:3782Accepted:1305DescriptionFarmer John has decided to give each of his cows a cell phone in hopes to encourage their social interaction. This, however, requires him to set up cell phone towers on hisN(1 ≤N≤ 10,000) past 阅读全文

摘要： POJ3513Let's Go to the MoviesTime Limit:1000MSMemory Limit:65536KTotal Submissions:1736Accepted:429DescriptionA favorite pastime for big families in Acmestan is going to the movies. It is quite common to see a number of these multi-generation families going together to watch a movie. Movie theat 阅读全文

摘要： POJ1155 TELETime Limit:1000MSMemory Limit:65536KTotal Submissions:1872Accepted:865DescriptionA TV-network plans to broadcast an important football match. Their network of transmitters and users can be represented as a tree. The root of the tree is a transmitter that emits the football match, the lea 阅读全文

摘要： POJ1935 JourneyTime Limit:1000MSMemory Limit:30000KTotal Submissions:1239Accepted:445DescriptionThere are n cities in Byteland (numbered from 1 to n), connected by bidirectional roads. The king of Byteland is not very generous, so there are only n-1 roads, but they connect the cities in such a way t 阅读全文

摘要： HDU4008 Parent and sonTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 1035Accepted Submission(s): 249Problem DescriptionGive you a tree with N vertices and N‐ 1 edges, and then ask you Q queries on “which vertex is Y's son that has the smallest 阅读全文

摘要： HDU1269 迷宫城堡Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2092Accepted Submission(s): 886Problem Description为了训练小希的方向感，Gardon建立了一座大城堡，里面有N个房间(N<=10000)和M条通道(M<=100000)，每个通道都是单向的，就是说若称某通道连通了A房间和B房间，只说明可以通过这个通道由A房间到达B房间，但并不说明通过它可以由B房间到达A房间。Ga 阅读全文

摘要： POJ2942 Knights of the Round TableTime Limit:7000MSMemory Limit:65536KTotal Submissions:4968Accepted:1543DescriptionBeing a knight is a very attractive career: searching for the Holy Grail, saving damsels in distress, and drinking with the other knights are fun things to do. Therefore, it is not ver 阅读全文

摘要： POJ1523 SPFTime Limit:1000MSMemory Limit:10000KTotal Submissions:2869Accepted:1284DescriptionConsider the two networks shown below. Assuming that data moves around these networks only between directly connected nodes on a peer-to-peer basis, a failure of a single node, 3, in the network on the left 阅读全文

摘要： HDU4005 The warTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 775 Accepted Submission(s): 128Problem DescriptionIn the war, the intelligence about the enemy is very important. Now, our troop has mastered the situation of the enemy's war zones 阅读全文