{"trustable":true,"prependHtml":"\u003cstyle type\u003d\"text/css\"\u003edd \u003e pre {\n display: block;\n padding: 9.5px;\n margin: 0 0 10px;\n font-size: 13px;\n line-height: 1.42857143;\n word-break: break-all;\n word-wrap: break-word;\n color: #333;\n background-color: #f5f5f5;\n border: 1px solid #ccc;\n border-radius: 4px;\n}\u003c/style\u003e","sections":[{"title":"Description","value":{"format":"HTML","content":"\u003cdiv\u003e给你一个无向带权连通图,每条边是黑色或白色。让你求一棵最小权的恰好有need条白色边的生成树。\u003c/div\u003e\r\n\u003cdiv\u003e题目保证有解。\u003c/div\u003e\r\n\u003cp\u003e\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cdiv\u003e第一行V,E,need分别表示点数,边数和需要的白色边数。\u003c/div\u003e\r\n\u003cdiv\u003e接下来E行,每行s,t,c,col表示这边的端点(点从0开始标号),边权,颜色(0白色1黑色)。\u003c/div\u003e\r\n\u003cp\u003e\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cdiv\u003e一行表示所求生成树的边权和。\u003c/div\u003e\r\n\u003cdiv\u003eV\u0026lt;\u003d50000,E\u0026lt;\u003d100000,所有数据边权为[1,100]中的正整数。\u003c/div\u003e\r\n\u003cp\u003e\u003c/p\u003e\r\n\u003cp\u003e\u003c/p\u003e"}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\"vjudge_sample\"\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e2 2 1\r\n0 1 1 1\r\n0 1 2 0\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e2\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Hint","value":{"format":"HTML","content":"\u003cp\u003e\u003cfont size\u003d\"3\"\u003e原数据出错,现已更新 by\u0026nbsp;\u003c/font\u003e\u003cspan style\u003d\"font-family: Helvetica, \u0027Microsoft Yahei\u0027, verdana; font-size: 14px; line-height: 15.549334526062px;\"\u003eliutian\u003c/span\u003e\u003cspan style\u003d\"font-size: medium;\"\u003e,但未重测---2016.6.24\u003c/span\u003e\u003c/p\u003e"}}]}