I'm exercising my dp skills and encountered topcoder SRM 694 dev1 250 problem. Can someone explain how to solve it?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3843 |
2 | jiangly | 3705 |
3 | Benq | 3628 |
4 | orzdevinwang | 3571 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3530 |
8 | ecnerwala | 3499 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 153 |
5 | maroonrk | 153 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
9 | orz | 145 |
10 | pajenegod | 144 |
I'm exercising my dp skills and encountered topcoder SRM 694 dev1 250 problem. Can someone explain how to solve it?
Название |
---|
I solved it using DP[i][a][b][m] = can I reach state up to student i, where first group has xor sum a, second group has xor sum b and m is a mask that indicates the state for each of the three groups (empty / non empty). Note that sum of third group can be derived from sum of the other two by xoring them with the current prefix xor sum.