B站

## 2013.03.02 ACME Training Nine – ZOJ Monthly, November 2012[team]

#F AC 11 mins
Brute force
#A AC 23 mins
SG function
#I AC 86 mins 4 wrong tries
Brute force
#G AC 171 mins 3 wrong tries
Math
#J AC 208 mins
DP
#D AC 210 mins
AC by whd
#C AC 287 mins
System of difference constraints
Shortest path
After contest:
#H AC
Math,brute force,dfs
#B AC
Math

## ACME Training Six to Eight – SGU problems solving[long-term,individual]

100 A+B
101 Domino 欧拉回路
102 Coprimes 最大公约数
103 Traffic Lights 动态计算边权的最短路
104 Little Shop of Flowers 动态规划
105 Div 3 数学题
106 The Equation 扩展欧几里得算法解不定方程
107 987654321 problem 暴力打表
108 Self-numbers II 类似宽搜的算法
109 Magic of David Copperfield II 二分染色 构造
110 Dungeon 计算几何
111 Very simple problem 高精度开根号运算 牛顿迭代法
112 a^b – b^a 高精度
113 Nearly prime numbers 简单数论
114 Telecasting station 贪心
115 Calendar 时间处理
116 Index of super-prime 数论 动态规划
117 Counting 快速幂
118 Digital root 高精度
119 Magic pairs 数学
120 Arhipelago 计算几何
121 Bridges painting 构造法
122 The book 构造法 Ore定理
123 The sum 递推
124 Broken line 计算几何 射线法判断点是否在简单多边形内
125 Shtirlits 搜索
126 Boxes 2406 数学 二进制下的欧几里得算法
127 Telephone directory
130 Circle 动态规划
131 Hardwood floor 状态压缩的动态规划
132 Another Chocolate Maniac 状态压缩的动态规划 DFS预处理可行转移

133  Border 排序
134  Centroid 树形DP
135  Drawing Lines 数学题
136  Erasing Edges 计算几何
137  Funny Strings 数论 构造法
138  Games of Chess 构造法
139  Help Needed! 判断15数码是否有解

## 2012.12.16 ACME Training Five – The 7th(2012) ACM Programming Contest of HUST – Onsite Contest(Semilive)[team,live]

#I AC 61 mins
Brute force
#E AC 105 mins
Greedy
#A AC 113 mins 2 wrong tries by WHD
#C AC 126 mins 1 wrong try
AC automation
#H AC 153 mins 1 wrong try
Math
#F AC 224 mins 1 wrong try
Game theory
#B AC 259 mins 5 wrong tries
The solution for this problem is first written by WHD. I rewrote it and got AC after 1 wrong try.
#J AC 284 mins 4 wrong tries by WHD
WHD used a right algorithm to solve this problem, but made a small mistake. After I found it out, WHD corrected it and got AC.

## 2012.12.9 ACME Training Four – The 7th(2012) ACM Programming Contest of HUST – Preliminary Contest[team]

#B AC 31 min 1 wrong try by WHD
#A AC 50 min by WDP
#D AC 75 min 3 wrong tries by WHD
#G AC 79 min 5 wrong tries
It can be solved by brute force, but I used DP to solve it, so I wasted a lot of time.
#C AC 94 min 1 wrong try
For a query, if b>sqrt(n), we can response it by brute force.
After do some preparations in O(n^1.5), we can response qeuries whose b<=sqrt(n) in O(1).
#F AC 118 min 1 wrong try by WHD
#E AC 179 min by WDP

## 2012.12.5 ACME Training Three – Graph Theory Problems[individual]

URAL 1272 Non-Yekaterinburg Subway
Disjoint-set

URAL 1156 Two Rounds
Bipartite graph
Knapsack problem

URAL 1128 Partition into Groups
Bipartite graph
I got RE because I used a variable at a wrong place (it should be j, but I wrote i there) and wasted lots of time to debug it.

URAL 1400 Cellular Characters
BFS
I got WA because I used “\n” when output. When I changed it to “%n” I got AC.

URAL 1630 Talisman
It must be a straight line, a point, a triangle or a tetrahedron.