bitset
文章平均质量分 59
Effervescence
OIer
展开
-
Topcoder SRM 721 Div.2 C. ApocalypseEasy
C. ApocalypseEasyProblem Statement We have an undirected tree with n nodes, numbered 0 through n-1. You are given its description: a vector p with n-1 elements. For each valid i, there is an edg原创 2017-09-28 19:06:35 · 341 阅读 · 2 评论 -
POJ 1742 coins(背包+二进制优化+bitset)
coins原创 2017-10-16 17:37:59 · 402 阅读 · 0 评论 -
[BZOJ3108][CQOI2013]图的逆变换(Bitset)
3108: [cqoi2013]图的逆变换Time Limit: 10 Sec Memory Limit: 128 MB给一个n结点m条边的有向图D,可以这样构造图E:给D的每条边u->v,在E中建立一个点uv,然后对于D中的两条边u->v和v->w,在E中从uv向vw连一条有向边。E中不含有其他点和边。输入E,你的任务是判断是否存在相应的D。注意,...原创 2018-02-27 18:12:49 · 362 阅读 · 0 评论