As promised, here are some (nested) hints for Codeforces Round #682 (Div. 2).
1438A - Специфичные вкусы Андре
Hint 1
Hint 1
Hint 1
Hint 1
I wasn't able to solve E and F. If you did, you may want to add your hints in the comments.
# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | atcoder_official | 148 |
5 | -is-this-fft- | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
10 | TheScrasse | 142 |
Unofficial hints for Codeforces Round #682 (Div. 2) (A — D)
As promised, here are some (nested) hints for Codeforces Round #682 (Div. 2).
1438A - Специфичные вкусы Андре
Solve some small tests on paper.
Can you make the sum of each subarray equal to its length?
Suppose that the answer is NO
. Which property should hold for the array $$$a$$$?
What happens if $$$l_1 = r_1$$$?
The answer is YES
if there is a pair of equal elements in the array $$$b$$$. What happens if there are no equal elements?
Look at the binary representation of the sum of each subarray. Are there equal binary representations?
Solve on paper
3 3
1 1 1
1 1 1
1 1 1
Now solve
3 3
2 1 1
1 1 2
2 1 2
Do a chess coloring on the grid. Can you make all differences odd?
How does the xor of all the array change after every operation?
The xor remains constant. Let it be $$$x$$$. If you make all elements equal, what's the xor of the resulting array?
If $$$n$$$ is even, $$$x = 0$$$. So the answer is NO
if the starting xor is not $$$0$$$. If $$$n$$$ is odd, at the end $$$x = a[i]$$$ for each $$$i$$$, so the answer is always YES
.
In both cases, you can solve the problem by making each $$$a[i]$$$ equal to $$$x$$$. Can you make $$$a[1] = x$$$ first?
Now you want to "spread" $$$x$$$ in all the array. Are there three indices such that $$$a[i] \oplus a[j] \oplus a[k] = x$$$?
I wasn't able to solve E and F. If you did, you may want to add your hints in the comments.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en6 |
![]() |
TheScrasse | 2020-11-13 20:59:08 | 17 | Tiny change: '\nThe xor remains c' -> '\nThe xor of all the array remains c' | |
en5 |
![]() |
TheScrasse | 2020-11-13 20:46:19 | 97 | ||
en4 |
![]() |
TheScrasse | 2020-11-13 20:32:22 | 34 | Tiny change: 'he array. Are ther' -> 'he array. You already have some $a[i] = x$. Are ther' | |
en3 |
![]() |
TheScrasse | 2020-11-13 20:25:47 | 24 | Tiny change: 'th cases, you can ' -> 'th cases, if the answer is `YES`, you can ' | |
en2 |
![]() |
TheScrasse | 2020-11-13 20:21:01 | 76 | ||
en1 |
![]() |
TheScrasse | 2020-11-13 20:18:34 | 2080 | Initial revision (published) |
Name |
---|