BZOJ 4771 - 七彩树

2017-03-11
题目地址 描述 给定一棵 n ( n ≤ 1 0 5 ) n(n\le {10}^5) n ( n ≤ 1 0 ​ 5 ​ ​ ) 个点的有根树,编号依次为 1 1 1 到 n n n ......

Codeforces 757F - Team Rocket Rises Again

2017-01-13
题目地址 描述 给定一个 n ( n ≤ 2 × 1 0 5 ) n(n\le 2\times {10}^5) n ( n ≤ 2 × 1 0 ​ 5 ​ ​ ) 个点, m ( m ≤ 3 × 1 0 5 ) m(m......

BZOJ 2668 - [cqoi2012]交换棋子

2017-01-11
题目地址 描述 有一个 n ( n ≤ 2 0 ) n(n\le 20) n ( n ≤ 2 0 ) 行 m ( m ≤ 2 0 ) m(m\le 20) m ( m ≤ 2 0 ) 列的黑白棋盘,你每次可以交换两个相邻格子(相邻是指有公共边或公共......

Codeforces 741D - Arpa’s letter-marked tree and Mehrdad’s Dokhtar-kosh paths

2016-12-07
题目地址 描述 给定一棵 n ( 1 ≤ n ≤ 5 ⋅ 1 0 5 ) n(1\le n\le 5 \cdot {10}^5) n ( 1 ≤ n ≤ 5 ⋅ 1 0 ​ 5 ​ ​ ) 的有根树,根结点为 1 1 ......

Codeforces 723E - One Way Reform

2016-11-15
题目地址 描述 给定一个 n ( n ≤ 2 0 0 ) n(n\le 200) n ( n ≤ 2 0 0 ) 个点 m ( m ≤ n ( n − 1 ) 2 ) m(m\le \frac{n(n - 1)}{2}) m ( m ≤......

Codeforces 732F - Tourist Reform

2016-11-12
题目地址 描述 给定一个 n ( n ≤ 4 ⋅ 1 0 5 ) n(n\le 4\cdot {10}^5) n ( n ≤ 4 ⋅ 1 0 ​ 5 ​ ​ ) 个点, m ( m ≤ 4 ⋅ 1 0 5 ) m(m\......

「NOIP 2009」最优贸易

2016-11-07
描述 给定一个 n ( n ≤ 1 0 5 ) n(n\le {10}^5) n ( n ≤ 1 0 ​ 5 ​ ​ ) 个点, m ( m ≤ 1 0 6 ) m(m\le {10}^6) m ( m ≤ ......

BZOJ 1999 - [Noip2007]Core树网的核

2016-11-04
题目地址 描述 给定一棵具有 n ( n ≤ 5 ⋅ 1 0 5 ) n(n\le 5\cdot{10}^5) n ( n ≤ 5 ⋅ 1 0 ​ 5 ​ ​ ) 个节点的树,每条边 i i i 带有权值 ......

BZOJ 1135 - [POI2009]Lyz

2016-09-28
题目地址 描述 初始时滑冰俱乐部有 1 1 1 到 n ( n ≤ 2 0 0 0 0 0 ) n(n\le 200000) n ( n ≤ 2 0 0 0 0 0 ) 号的溜冰鞋各 k k k 双。已知 ......

Codeforces 715B - Complete The Graph

2016-09-18
题目地址 描述 给定一个 n ( 2 ≤ n ≤ 1 0 0 0 ) n(2\le n\le 1000) n ( 2 ≤ n ≤ 1 0 0 0 ) 个点 m ( 1 ≤ m ≤ 1 0 0 0 0 ) m(1\le m\le 10000) ......