{"trustable":false,"prependHtml":"\u003cstyle type\u003d\"text/css\"\u003e\n div.illustration {\n float: right;\n padding-left: 20px;\n }\n div.illustration .illustration {\n width: 100%;\n border-radius: 4px;\n }\n pre {\n display: block;\n margin: 0 0 10px;\n font-size: 13px;\n line-height: 1.42857143;\n color: #333;\n word-break: break-all;\n word-wrap: break-word;\n }\n\u003c/style\u003e\n\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027\\\\[\u0027, right: \u0027\\\\]\u0027, display: true}\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"","value":{"format":"PLAIN","content":"有一个n个点m条边的图,点带权,为t[i]。你需要给每个点上放一个N或者S,满足:\n1. 一共放了k个N,n-k个S\n2. 对于任意一条从1到n的点权最短路,一定经过相邻两个N或S\n构造一个方案或者输出impossible表示无解\nn 1e5\nm 2e5\nt[i] 1e4\nk\u003c\u003dn"}}]}