Reast1nPeace的博客

题目： Frogger Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 51723   Accepted: 16420 Description Freddy Frog is sitting on a stone in the middle of a lake.

题目： 最短路 Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 75154    Accepted Submission(s): 32660 Problem Description 在每年的校赛里，所有进入决赛的同学

题目： Invitation Cards Time Limit: 8000MS   Memory Limit: 262144K Total Submissions: 30192   Accepted: 10077 Description In the age of television, not many people attend

题目： Input An edge-weighted graph G (V, E). |V| |E| s0 t0 d0 s1 t1 d1 : s|E|-1 t|E|-1 d|E|-1 |V| is the number of vertices and |E| is the number of edges in G. The graph vertices are named w

题目： Til the Cows Come Home Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 61857   Accepted: 20985 Description Bessie is out in the field and wants to get

题目： Single Source Shortest Path II For a given weighted graph G=(V,E) , find the shortest path from a source to each vertex. For each vertex u, print the total weight of edges on the shor

题目：RoadblocksTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 18020 Accepted: 6338DescriptionBessie has moved to a small farm and sometimes enjoys returning to visit one of her best friends. ...

题意：你是某个岛国（ACM-ICPC Japan）上的一个苦逼程序员，你有一个当邮递员的好基友利腾桑遇到麻烦了：全岛有一些镇子通过水路和旱路相连，走水路必须要用船，在X处下船了船就停在X处。而且岛上只有一条船，下次想走水路还是得回到X处才行；两个镇子之间可能有两条以上的水路或旱路；邮递员必须按照清单上的镇子顺序送快递（镇子可能重复，并且对于重复的镇子不允许一次性处理，比如ABCB的话B一定要按顺序...

题目：Telephone LinesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8178 Accepted: 2948DescriptionFarmer John wants to set up a telephone line at his farm. Unfortunately, the phone company is ...