{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cstyle type\u003d\"text/css\"\u003e .sampledata { font-family: \"Courier New\", Courier, monospace; white-space: pre; }\u003c/style\u003e\u003cdiv\u003e\n 给你一个无向带权连通图,每条边是黑色或白色。让你求一棵最小权的恰好有need条白色边的生成树。\n\u003c/div\u003e \n\u003cdiv\u003e\n 题目保证有解。\n\u003c/div\u003e \n\u003cp\u003e\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cdiv\u003e\n 第一行V,E,need分别表示点数,边数和需要的白色边数。\n\u003c/div\u003e \n\u003cdiv\u003e\n 接下来E行,每行s,t,c,col表示这边的端点(点从0开始标号),边权,颜色(0白色1黑色)。\n\u003c/div\u003e \n\u003cp\u003e\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cdiv\u003e\n 一行表示所求生成树的边权和。\n\u003c/div\u003e \n\u003cdiv\u003e\n V\u0026lt;\u003d50000,E\u0026lt;\u003d100000,所有数据边权为[1,100]中的正整数。\n\u003c/div\u003e \n\u003cp\u003e\u003c/p\u003e \n\u003cp\u003e\u003c/p\u003e"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cspan class\u003dsampledata\u003e2 2 1\r\n0 1 1 1\r\n0 1 2 0\u003c/span\u003e\u003c/div\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cspan class\u003dsampledata\u003e2\u003c/span\u003e\u003c/div\u003e"}},{"title":"Hint","value":{"format":"HTML","content":"\u003cp\u003e\u003c/p\u003e\n\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\n\u003cp\u003e\u003c/p\u003e"}}]}