hch丶

Problem 2271 XAccept: 166    Submit: 584Time Limit: 1500 mSec    Memory Limit : 32768 KB Problem DescriptionX is a fully prosperous country, especially known for its complicated transp

EinbahnstrasseTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3735    Accepted Submission(s): 1184Problem DescriptionEinbahnstra

Invitation CardsTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 4417    Accepted Submission(s): 2013Problem DescriptionIn the a

N (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participating in a programming contest. As we all know, some cows code better than others. Each cow has a certain constant skill rating that is un

题目链接：http://poj.org/problem?id=1847大意：给你N个交叉路口，每个路口都对应几个路口，第一个不用开关，其余要扳动开关，S到T，问你需要扳动几次开关思路：把第一个赋值为0，其余为1，进行最短路径算法上代码

给你n个点，m条无向边，每条边都有长度d和花费p，给你起点s终点t，要求输出起点到终点的最短距离及其花费，如果最短距离有多条路线，则输出花费最少的。Input输入n,m，点的编号是1~n,然后是m行，每行4个数 a,b,d,p，表示a和b之间有一条边，且其长度为d，花费为p。最后一行是两个数 s,t;起点s，终点。n和m为0时输入结束。 (1Output输出 一行有两个数， 最短距