2014 ACM-ICPC Asia Beijing Regional Contest

From EOJ Wiki
Revision as of 10:32, 31 October 2018 by Xiejiadong (talk | contribs) (Created page with "=== Problem A === Solved by dreamcloud. 温暖的签到。 === Problem B === Unsolved. === Problem C === Unsolved. === Problem D === Solved by Xiejiadong. 题意:...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Problem A

Solved by dreamcloud.

温暖的签到。

Problem B

Unsolved.

Problem C

Unsolved.

Problem D

Solved by Xiejiadong.

题意:按照一定的顺序杀人,使得代价最小。

题解:区间dp,枚举区间$(l,r)$中最晚死的人$x$

那么这个代价显然为$dp[l,x-1]+dp[x+1,r]+a[x]+b[l-1]+b[r+1]$

直接记忆化搜索

Problem E

Unsolved.

Problem F

Unsolved.

Problem G

Unsolved.

Problem H

Solved by Xiejiadong.

题意:求异或和$\ge m$的方案数。

题解:用$f[i]$表示异或和为$i$的方案数,一共只有最多$40$个数,直接暴力转移。

Problem I

Solved by Xiejiadong.

题意:求两个圆环的面积交。

题解:两圆的面积交,有板子。

显然,重合的面积用容斥计算即可。

Problem J

Unsolved.

Problem K

Solved by Xiejiadong.

签到。

提出了一个假算法,自闭了一个小时。