MatrixTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1011Accepted Submission(s): 348Problem DescriptionMachines have once again attacked the kingdom of Xions. The kingdom of Xions has N cities and N-1 bidirectional roads. The road network is such Read More
posted @ 2012-07-29 11:00 jiai Views(433) Comments(0) Diggs(0) Edit
HeroTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 860Accepted Submission(s): 427Problem DescriptionWhen playing DotA with god-like rivals and pig-like team members, you have to face an embarrassing situation: All your teammates are killed, and yo Read More
posted @ 2012-07-29 09:45 jiai Views(249) Comments(0) Diggs(0) Edit
Meeting point-2Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 550Accepted Submission(s): 322Problem DescriptionIt has been ten years since TJU-ACM established. And in this year all the retired TJU-ACMers want to get together to celebrate the tenth Read More
posted @ 2012-07-29 09:03 jiai Views(221) Comments(0) Diggs(0) Edit
Meeting point-1Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1546Accepted Submission(s): 464Problem DescriptionIt has been ten years since TJU-ACM established. And in this year all the retired TJU-ACMers want to get together to celebrate the tent Read More
posted @ 2012-07-28 18:56 jiai Views(218) Comments(0) Diggs(0) Edit
2081: 最优贸易Time Limit:1000 ms Memory Limit:131072 kBJudge type: Multi-cases(Detailed Mode - 10 cases)Total Submit :236(51 users)Accepted Submit :82(35 users)Page View : 3006 C 国有 n 个大城市和 m 条道路,每条道路连接这 n 个城市中的某两个城市。任意两个城市之间最多只有一条道路直接相连。这 m 条道路中有一部分为单向通行的道路,一部分为双向通行的道路,双向通行的道路在统计条数时也计为 1 条。 C 国幅员辽阔,各地的 Read More
posted @ 2012-07-28 17:04 jiai Views(319) Comments(0) Diggs(0) Edit
最短路径问题Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4537Accepted Submission(s): 1356Problem Description给你n个点,m条无向边,每条边都有长度d和花费p,给你起点s终点t,要求输出起点到终点的最短距离及其花费,如果最短距离有多条路线,则输出花费最少的。Input输入n,m,点的编号是1~n,然后是m行,每行4个数 a,b,d,p,表示a和b之间有一条边,且其长度为d,花费为p。最后一行是 Read More
posted @ 2012-07-27 21:56 jiai Views(134) Comments(0) Diggs(0) Edit
WormholesTime Limit:2000MSMemory Limit:65536KTotal Submissions:20003Accepted:7088DescriptionWhile exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that delivers you to its destination at a time that is BEFORE Read More
posted @ 2012-07-27 21:17 jiai Views(135) Comments(0) Diggs(0) Edit
Invitation CardsTime Limit:8000MSMemory Limit:262144KTotal Submissions:14080Accepted:4562DescriptionIn the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want to propagate theater and, most of all, Antique Comedies. They Read More
posted @ 2012-07-27 20:05 jiai Views(205) Comments(0) Diggs(0) Edit
Board GamesTime Limit:5 Seconds Memory Limit:32768 KBYou have been hired by the quality control division of a world famous board game company. Their creative and design division comes up, on a daily basis, with great ideas for board games, but sometimes the scoring of the proposed games does not mat Read More
posted @ 2012-07-27 15:55 jiai Views(172) Comments(0) Diggs(0) Edit
Til the Cows Come HomeTime Limit:1000MSMemory Limit:65536KTotal Submissions:20964Accepted:6985DescriptionBessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Bessie needs her beauty sleep, so she wants to Read More
posted @ 2012-07-27 14:19 jiai Views(187) Comments(0) Diggs(0) Edit