hefeijack
- 浏览: 35699 次
-
最新评论
文章列表
Command Network
Time Limit: 1000MS
Memory Limit: 131072K
Total Submissions: 10253
Accepted: 2976
Description
After a long lasting war on words, a war on arms finally breaks out between littleken’s and KnuthOcean’s kingdoms. A sudden and violent assault by KnuthOcean’s for ...
Desert King
Time Limit: 3000MS
Memory Limit: 65536K
Total Submissions: 18116
Accepted: 5087
Description
David the Great has just become the king of a desert country. To win the respect of his people, he decided to build channels all over his country to bring water to every ...
The Unique MST
Time Limit: 1000MS
Memory Limit: 10000K
Total Submissions: 17062
Accepted: 5920
Description
Given a connected undirected graph, tell if its minimum spanning tree is unique. Definition 1 (Spanning Tree): Consider a connected, undirected graph G = (V, E). A spa ...
Picnic Planning
Time Limit: 5000MS
Memory Limit: 10000K
Total Submissions: 8395
Accepted: 2971
Description
The Contortion Brothers are a famous set of circus clowns, known worldwide for their incredible ability to cram an unlimited number of themselves into even the s ...
Full Tank?
Time Limit: 1000MS
Memory Limit: 65536K
Total Submissions: 5673
Accepted: 1853
Description
After going through the receipts from your car trip through Europe this summer, you realised that the gas prices varied between the cities you visited. Maybe you ...
Sightseeing Cows
Time Limit: 1000MS
Memory Limit: 65536K
Total Submissions: 6758
Accepted: 2234
Description
Farmer John has decided to reward his cows for their hard work by taking them on a tour of the big city! The cows must decide how best to spend their free time.
F ...
Cow Relays
Time Limit: 1000MS
Memory Limit: 65536K
Total Submissions: 4471
Accepted: 1778
Description
For their physical fitness program, N (2 ≤ N ≤ 1,000,000) cows have decided to run a relay race using the T (2 ≤ T ≤ 100) cow trails throughout the pasture.
Each trail c ...
Sightseeing
Time Limit: 2000MS
Memory Limit: 65536K
Total Submissions: 6312
Accepted: 2228
Description
Tour operator Your Personal Holiday organises guided bus trips across the Benelux. Every day the bus moves from one city S to another city F. On this way, the tour ...
Big Christmas Tree
Time Limit: 3000MS
Memory Limit: 131072K
Total Submissions: 18507
Accepted: 3947
Description
Christmas is coming to KCM city. Suby the loyal civilian in KCM city is preparing a big neat Christmas tree. The simple structure of the tree is shown in right ...
Remmarguts' Date
Time Limit: 4000MS
Memory Limit: 65536K
Total Submissions: 17634
Accepted: 4826
Description
"Good man never makes girls wait or breaks an appointment!" said the mandarin duck father. Softly touching his little ducks' head, he told them a story. & ...
Power Network
Time Limit: 2000MS
Memory Limit: 32768K
Total Submissions: 20351
Accepted: 10698
Description
A power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node u may be supplied with an amount s(u) >= 0 ...
Constructing Roads
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10358 Accepted Submission(s): 3854
Problem Description
There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages ...
HDU 3657 Game (SAP）
- 博客分类：
- ACM
Game
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 691 Accepted Submission(s): 277
Problem Description
onmylove has invented a game on n × m grids. There is one positive integer on each grid. Now you can take the numbers from the grids ...
Thieves
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1014 Accepted Submission(s): 456
Problem Description
In the kingdom of Henryy, there are N (2 <= N <= 100) cities, with M (M <= 10000) two-direct ways connecting them.A grou ...
方格取数(1)
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3086 Accepted Submission(s): 1182
Problem Description
给你一个n*n的格子的棋盘，每个格子里面有一个非负数。从中取出若干个数，使得任意的两个数所在的格子没有公共边，就是说所取的数所在的2个格子不能相邻，并且取出的数的和最大。
Input
包括多个测试实例，每个测试实例包括一个整数n 和n*n ...