ACM - 数据结构
quailty
这个作者很懒,什么都没留下…
展开
-
Codeforces 558D Guess Your Way Out! II (区间覆盖+扫描线)
D. Guess Your Way Out! II time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Amr bought a new video game "Gues原创 2015-07-16 00:03:47 · 1057 阅读 · 0 评论 -
Codeforces 551E GukiZ and GukiZiana (分块)
E. GukiZ and GukiZiana time limit per test 10 seconds memory limit per test 256 megabytes input standard input output standard output Professor GukiZ was playing with ar原创 2015-06-14 00:12:59 · 1771 阅读 · 7 评论 -
Codeforces 12D Ball (线段树)
D. Ball time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output N ladies attend the ball in the King's palace. Ever原创 2015-06-12 20:30:58 · 2026 阅读 · 2 评论 -
Codeforces 558E A Simple Task (计数排序+线段树优化)
E. A Simple Task time limit per test 5 seconds memory limit per test 512 megabytes input standard input output standard output This task is very simple. Given a string S原创 2015-07-15 11:20:01 · 1967 阅读 · 0 评论 -
Codeforces 501D Misha and Permutations Summation (康托展开+平衡树优化)
D. Misha and Permutations Summation time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Let's define the sum of原创 2015-07-16 00:31:28 · 2041 阅读 · 0 评论 -
HDU 5299 Circles Game (圆的扫描线+树上SG)
题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=5299 题意: 平面上有n个两两不交的圆,现在有两个人轮流选取圆,每选到一个圆就要把这个圆及其内部的所有圆都删去,最后不能操作的人输,问谁有必胜策略。 分析: 由于圆两两不交,如果根据圆的包含关系建个图,可以得到一个森林,问题转化为树上的SG博弈,复杂度O(nlogn),原创 2015-08-19 15:24:03 · 1941 阅读 · 0 评论