{"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":"\u003cscript type\u003d\u0027text/x-mathjax-config\u0027\u003eMathJax.Hub.Config({tex2jax: { inlineMath: [[\u0027$\u0027,\u0027$\u0027]] } }); \u003c/script\u003e\n\u003cscript type\u003d\u0027text/javascript\u0027 src\u003d\u0027https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\u0027\u003e\u003c/script\u003e\n\u003cscript type\u003d\u0027text/javascript\u0027\u003esetTimeout(function(){MathJax.Hub.Queue([\u0027Typeset\u0027, MathJax.Hub, \u0027left_view\u0027]);}, 2000);\u003c/script\u003e\n\u003cdiv class\u003d\"panel_content\"\u003e\n炎热的8月,每天早晨从宿舍到耳机楼对于544来说都是一段艰难的过程。为了让自己每天到达耳机楼时保持愉悦的心情,他决定通过策划一条最优的路径来到达耳机楼。\n\u003cbr\u003e\n\u003cbr\u003e\n现在544已经把地图转化为了有n个点,m条边的无向图,每条边都有一个长度d和不愉悦度p,544的宿舍在s,耳机楼入口在t,544要求出s到t的最短距离及其不愉悦度之和。如果最短距离有多条路线,544会选择不愉悦度之和最小的那一条。\n\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"输入n,m,点的编号是1~n,然后是m行,每行4个数 a,b,d,p,表示a和b之间有一条边,且其长度为d,不愉悦度为p。最后一行是两个数 s,t;代表544的宿舍所在之处s,耳机楼的入口所在之处t。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"}}]}