摘要：
Problem Description 给你n个点，m条无向边，每条边都有长度d和花费p，给你起点s终点t，要求输出起点到终点的最短距离及其花费，如果最短距离有多条路线，则输出花费最少的。 Input输入n,m，点的编号是1~n,然后是m行，每行4个数 a,b,d,p，表示a和b之间有一条边，且其长 阅读全文
posted @ 2018-11-18 19:09
芹菜叶子
阅读(237)
评论(0)
推荐(0)
摘要：
题目描述： One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party to be held at farm #X (1 ≤ X ≤ N). A 阅读全文
posted @ 2018-11-18 17:00
芹菜叶子
阅读(146)
评论(0)
推荐(0)
摘要：
Description Bessie 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 阅读全文
posted @ 2018-11-18 13:50
芹菜叶子
阅读(114)
评论(0)
推荐(0)
浙公网安备 33010602011771号