How do I generate all the submasks for a given mask?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 165 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
5 | nor | 151 |
7 | atcoder_official | 147 |
8 | TheScrasse | 146 |
9 | Petr | 145 |
10 | SecondThread | 142 |
How do I generate all the submasks for a given mask?
Название |
---|
Auto comment: topic has been updated by skpro19 (previous revision, new revision, compare).
The easiest way I know is:
If you want 0 as a submask:
You have to know if we want to do something with the submasks of every mask till 2^N the time complexity will be O(3^N) not O(4^N).
Thanks man! It was really helpful.
Can somebody explain please, why is it 3^n ?
$$$3^n=\sum_{k=0}^{n} \binom{n}{k}2^k$$$ by binomial expansion. $$$2^k$$$ is number of submasks if we have $$$k$$$ ones. $$$\binom{n}{k}$$$ is number of masks with $$$k$$$ ones.
Oh, thanks. Ive just read it here https://cp-algorithms.com/algebra/all-submasks.html :)
Better way to think about it is, if you have N items, then each item being considered is either 1. not in the mask, 2. in the mask but not in the submask, 3. in the submask. So 3^N.
Time complexity = O(3^n) if we are generating all submasks for all 2^n numbers for the n bit number else for a particular number having k out of n bits set complexity is O(2^k)