codeforces
文章平均质量分 82
nndxy
永不丧失对生活的热情,人生就是要不停地战斗!
展开
-
Codeforces Round #262 (Div. 2)
B. Little Dima and Equation time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Little Dima misbehaved during a math lesso原创 2014-08-21 11:33:50 · 870 阅读 · 0 评论 -
Codeforces Round #316 (Div. 2)
A. Elections time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output The country of Byalechinsk is running elections involving原创 2015-08-14 03:25:56 · 1134 阅读 · 0 评论 -
Codeforces Round #311 (Div. 2) C. Arthur and Table
C. Arthur and Table time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Arthur has bought a beautiful big table into his n原创 2015-07-25 16:49:15 · 1598 阅读 · 0 评论 -
Codeforces Round #304 (Div. 2)
A. Soldier and Bananas time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output A soldier wants to buy w bananas in the shop. H原创 2015-05-25 11:12:12 · 1267 阅读 · 5 评论 -
Codeforces Round #305 (Div. 2)
A. Mike and Fax time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output While Mike was walking in the subway, all the stuff in原创 2015-05-27 14:41:59 · 1060 阅读 · 0 评论 -
Codeforces Round #299 (Div. 2)
A. Tavas and Nafas time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Today Tavas got his test result as an integer score原创 2015-05-06 20:12:31 · 1197 阅读 · 0 评论 -
Codeforces Round #301 (Div. 2)
A. Combination Lock time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Scrooge McDuck keeps his most treasured savings i原创 2015-05-05 08:35:51 · 1238 阅读 · 0 评论 -
Codeforces Round #280 (Div. 2)
A. Vanya and Cubes time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Vanya got n cubes. He decided to build a pyramid原创 2014-12-02 23:42:07 · 1000 阅读 · 2 评论 -
Codeforces Round #279 (Div. 2)
A. Team Olympiad time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output The School №0 of the capital of Berland has n childre原创 2014-11-25 17:15:00 · 973 阅读 · 3 评论 -
Codeforces Round #335 (Div. 2) D. Lazy Student
题意:有一个 n 个点、m 条边的无环无重边图,现在告诉你这m 条边的权值,并且指出了该图的最小生成树上的 n-1 条边(标号为1),现在要你还原整个图。当然有多组解,只要输出一种可行解就行,若不能还原则输出 -1。 分析:我的想法是,指定最小生成树上的边都是与 点1 直接连接的边,即 1 与 2、3、4、……、n 相连;根据kruskal算法,首先对所有的边按照升序排序,对于标号为 1 的点,按照顺序构成与 1 相连的边,并且沿途存好新增的点,这里我用队列存;对于标号为 0 的边,它只可能由之前得到的除原创 2015-12-11 23:34:02 · 796 阅读 · 0 评论