Minimum Spanning Tree by yshl(bin)

[\x88<{[3{\x8e\x06%stdin\x8e\x01r\x92A\x92\xab\x92u\x928\x928\x923}\x92\x83]}\x92\x83]{2\x92K\x92>2\x92K\x92P}.sort{\x92\x02\x92u2\x92X\x92d2\x92X\x92d\x92={\x8e\x02F }{\x8e\x02T }\x92U\x92v2\x88\xff1{\x92X=only\x8e\x01 \x92v}\x92H=\x92d\x92>\x92d\x92\x1e{3\x92X\x92={1\x92X\x9230}\x92T\x92u}\x92I}\x92I

Note that non-ascii characters in the above source code will be escaped (such as \x9f).

download

return to the top page