SOS dp
文章平均质量分 93
tomjobs
别慌,慌也没用
展开
-
B - Binomial Gym - 102576B(Lucas定理,SOS DP)
题意:n个数,求多少个数满足(a[i]a[j])\tbinom{a[i]}{a[j]}(a[j]a[i])为奇数。思路:由卢卡斯定理可以得到,如果存在n的某个二进制位为0,且m的该二进制位为1,那么就有(nm)mod 2=0\tbinom{n}{m}\mod2=0(mn)mod2=0。所以只有m是nnn的子集的时候(nm)\tbinom{n}{m}(mn)才会是奇数。那么实际上就是求子集和,这个直接用SOS DP就好了。#pragma optimize("-O3")#inclu.原创 2020-10-03 22:45:52 · 304 阅读 · 0 评论 -
Codeforces 383 E. Vowels(SOS DP)
Iahubina is tired of so many complicated languages, so she decided to invent a new, simple language. She already made a dictionary consisting of n 3-words. A 3-word is a sequence of exactly 3 lowercase letters of the first 24 letters of the English alphabe原创 2020-09-23 16:48:01 · 387 阅读 · 0 评论 -
Codeforces165 E. Compatible Numbers(SOS dp)
Two integers x and y are compatible, if the result of their bitwise “AND” equals zero, that is, a & b = 0. For example, numbers 90 (10110102) and 36 (1001002) are compatible, as 10110102 & 1001002 = 02, and numbers 3 (112) and 6 (1102) are not comp原创 2020-09-23 12:43:47 · 235 阅读 · 0 评论 -
Codeforces1208 F. Bits And Pieces (SOS DP)
题意:寻找最大的a[i]|a[j]&a[k],满足i<j<k。思路:SOS DP。定义dp[sta][0/1]dp[sta][0/1]dp[sta][0/1]得到stastasta这个状态的最大下标,次大下标。那么初始有dp[a[i]][0]=idp[a[i]][0]=idp[a[i]][0]=i。对于a[j]&a[k],是指就是求a[j]a[j]a[j]的子集或者a[k]a[k]a[k]的子集。所以可以用SOS DP的方法维护出stastasta状态的最大次大下标。原创 2020-09-23 00:01:09 · 197 阅读 · 0 评论 -
Codeforces Global Round 10 G. Omkar and Pies(SOS DP,状压)
Omkar has a pie tray with ???? (2≤????≤20) spots. Each spot in the tray contains either a chocolate pie or a pumpkin pie. However, Omkar does not like the way that the pies are currently arranged, and has another ideal arrangement that he would prefer inst原创 2020-09-21 20:13:46 · 670 阅读 · 0 评论