随笔分类 -  并查集

上一页 1 2
POJ1703Find them, Catch them[种类并查集]
摘要：Find them, Catch them Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 42416 Accepted: 13045 Description The police office in Tadu City deci 阅读全文
posted @ 2016-10-31 12:57 Candy? 阅读(180) 评论(0) 推荐(0) 编辑
UVA - 11987 Almost Union-Find[并查集 删除]
摘要：UVA - 11987 Almost Union-Find I hope you know the beautiful Union-Find structure. In this problem, you’re to implement something similar, but not iden 阅读全文
posted @ 2016-10-13 00:12 Candy? 阅读(484) 评论(0) 推荐(0) 编辑
POJ1962Corporative Network[带权并查集]
摘要：Corporative Network Time Limit: 3000MS Memory Limit: 30000K Total Submissions: 3945 Accepted: 1416 Description A very big corporation is developing it 阅读全文
posted @ 2016-10-11 23:59 Candy? 阅读(237) 评论(0) 推荐(0) 编辑
CF722C. Destroying Array[并查集 离线]
摘要：链接：Destroying Array C. Destroying Array time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output 链 阅读全文
posted @ 2016-10-02 14:08 Candy? 阅读(3245) 评论(0) 推荐(0) 编辑
BZOJ1015[JSOI2008]星球大战starwar[并查集]
摘要：1015: [JSOI2008]星球大战starwar Description 很久以前，在一个遥远的星系，一个黑暗的帝国靠着它的超级武器统治者整个星系。某一天，凭着一个偶然的机遇，一支反抗军摧毁了帝国的超级武器，并攻下了星系中几乎所有的星球。这些星球通过特殊的以太隧道互相直接或间接地连接。 但好景 阅读全文
posted @ 2016-09-18 23:12 Candy? 阅读(262) 评论(0) 推荐(0) 编辑
Codeforces 500B. New Year Permutation[连通性]
摘要：B. New Year Permutation time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output B. New Year Perm 阅读全文
posted @ 2016-09-17 00:00 Candy? 阅读(265) 评论(0) 推荐(0) 编辑

上一页 1 2