№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | cry | 160 |
2 | maomao90 | 160 |
4 | -is-this-fft- | 159 |
5 | atcoder_official | 158 |
5 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | maroonrk | 152 |
10 | Dominater069 | 149 |
Название |
---|
Let dp[i] be the absolute difference between the weights of A and B considering the first i items.
Note that dp[i] can only be 0,1 or 2.
Base Case: dp[1] = v[1]
Transition is simply dp[i] = abs(v[i] — dp[i-1]).
Note that parity is maintained on transition, so seeing a stone of weight 1 always changes parity of dp[i], and 0 and 2 don't change parity.
There is only one trick, suppose we have dp[i-1] = 0, and v[i] = 2. It's possible that we might be able to place 2 on one side, and move two previous 1 weight stones over on the other side. Therefore, just keep count of how many 1s we have seen, and if we've seen more than 2, make sure the transition from 0 -> 2 ends in 0 instead of 2.
Of course, to recover the answer, we simply need to check if dp[n] is 0 or not.
150316817 for clarity.
instead of carrying the counts of 1, simply sort the vector in descending order and calculate dp[i]=abs(dp[i-1] -v[i]);
https://codeforces.me/problemset/submission/1472/232719835 for more clarity