volz.kz.g

狗题，其实就是很简单的最短路问题的扩展，一开始不明就理的TLE，MLE，WA，蛋碎了一地，后来发现题目说没有路径就输出0，突然醒悟了！ /* *Name:Traffic Lights *LANG:C++ *source:sgu103 */ #include #include #include #define MAXN 350 #define MAXM 15000 #define I

题目数据范围比较高，用map记录城市，再用dijkstra+heap既可以了AC了 /* *NAME:SHPATH *LANG:C++ *Source:spoj15 */ #include #include #include #include #include #include #include #include #define INF 0x7FFFFFFF using

122. The book time limit per test: 0.5 sec. memory limit per test: 4096 KB There is a group of N (2<=N<=1000) people which are numbered 1 through N, and everyone of them has not less than [ (N