{"trustable":false,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\n 给你n个点,m条无向边,每条边都有长度d和花费p,给你起点s终点t,要求输出起点到终点的最短距离及其花费,如果最短距离有多条路线,则输出花费最少的。 \n"}},{"title":"Input","value":{"format":"HTML","content":"输入n,m,点的编号是1~n,然后是m行,每行4个数 a,b,d,p,表示a和b之间有一条边,且其长度为d,花费为p。最后一行是两个数 s,t;起点s,终点。n和m为0时输入结束。 \n\u003cbr\u003e(1\u0026lt;n\u0026lt;\u003d1000, 0\u0026lt;m\u0026lt;100000, s !\u003d t)"}},{"title":"Output","value":{"format":"HTML","content":"输出 一行有两个数, 最短距离及其花费。"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre\u003e3 2\n1 2 5 6\n2 3 4 5\n1 3\n0 0\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre\u003e9 11\u003c/pre\u003e"}},{"title":"Hint","value":{"format":"HTML","content":"注意处理重边!"}}]}