View source for 2013-2014 ACM-ICPC, Asia Aizu Regional Contest

== Problem A ==

Solved by zerol. 00:11 (+)

== Problem B ==

Solved by ultmaster. 00:38 (+)

就是那个大家都会做的蚂蚁题，但又有点不大一样，反正模拟一下就好了。

== Problem C ==

Solved by kblack. 01:09 (+3)

== Problem D ==

Solved by zerol. 02:56 (+)

== Problem E ==

Solved by ultmaster. 02:14 (+)

题意：九宫格华容道。横竖代价不一样，要最短路。

题解：最短路。压位用经典的「康托压缩」就可以。看起来会跑得很慢，但实际上开了 O2 优化以后会「快 4-5 倍」，然后就过了。

== Problem F ==

Unsolved.

== Problem G ==

Solved by zerol. 03:18 (+)

== Problem H ==

Upsolved by ultmaster. (-3)

题意：有一个盒子，盒子边有一定高度，盒子里面有一些竖着的针。现在要求一个最大的球，使得它能够着地。

题解：二分答案，每根针禁止的区域都是一个圆形，盒子的限制是一个方形。最后只要看盒子的限制减去所有圆的并是否还有剩就好了。这个看起来有点简单的东西其实要用圆的离散化来实现，实现起来并不是特别容易，也因此犯了一些小错误，打出了 GG。

== Problem I ==

Unsolved.

== Problem J ==

Unsolved.