I need help to solved this intersting problem link .
thank you in advance.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | adamant | 157 |
6 | awoo | 157 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | djm03178 | 153 |
I need help to solved this intersting problem link .
thank you in advance.
Name |
---|
if you now know how to solve it then please help .
not sure at all but this might work:
First, let's work on finding the # of cool numbers <= X, for a given X (then we can get the answer by computing that for B and A-1).
For a fixed X, we can get the # of cool numbers with a dp[digit][sum1][sum2][alreadyless_bit]
digit will be the position of the digit we're trying, We will go from most significative to least. sum1 and sum2 are the sums of the two sets. alreadyless_bit tells if we are already strictly less than X, if so, the new digit can be any digit, otherwise, it has to be between 0 and the respective X's digit.
This counts the cool numbers but it might count each one many times, I don't know if you can avoid that hehe
Did you solve this problem later.. ? If yes can you share your idea?
Can someone help in this question
I might be wrong, but how about...
...submitting some "solutions" close to the source size limit? ;)
I couldn't think of any solution. I know above idea proposed by lmn0x4F seems to be good but couldn't find a way to for overcounting issue.
Can you provide some hint?
I viciously precomputed answers for blocks of size 200000 and then solved naively for the remainders. You might want to have a fast naive solver (i.e., $$$O(d)$$$ instead of $$$O(d^2)$$$ knapsack). Keep in mind the 50K source size limit.
Thanks a lot for sharing your approach