### Red0's blog

By Red0, history, 4 weeks ago,

....that involve LCA, MST, Treap, Sparse Table, Binary Manipulations and other advanced techniques.

Trying to build a good foundation. Thanks!

• +18

 » 4 weeks ago, # |   0 I recently tried this interesting problem. Would surely recommend it.https://mirror.codeforces.com/problemset/problem/1615/D
•  » » 4 weeks ago, # ^ |   0 Thank you!
•  » » 4 weeks ago, # ^ |   +3 if u have an explination to the solution can you please provide it ? i wrote a blog once that the tutorial wasnt clear and also kept trying with it from time to time and never got it
•  » » » 4 weeks ago, # ^ |   +5 The important observation here is that we are only concerned with the parity of no. of bits on any path, as mentioned in the editorial. Thus, we need to only look at the no. of set bits in a number, and not which bits are set.Then we can impose some restrictions on the parity of bits on each path in the input. Any edge with non negative value can also be viewed as a path of size 1. Hence, we can try to impose all these restrictions and see if these give us a valid combination. Then, we will work with the negative weighted edges and obtain their values in the same way.To store the parity of bits in any path, we are using DSU (but it is probably not required if we root our tree beforehand). To obtain the parity between any two nodes, we can xor the parity of each path from the root of the tree. Since, if any edge occurs in both the paths, it will not be on the simple path between the two nodes and hence get cancelled. If at any point, the conditions are not satisfied or are contradictory, we know that the required tree is not possible. Finally to obtain the weights of the negative edges, we can check for the required parity between the two nodes, and set our answer as 0 or 1. Here is my solution, feel free to ask any queries.https://mirror.codeforces.com/contest/1615/submission/269522430The solution can also be viewed as a variant of bipartite matching. Each node is colored either 0 or 1, depending on the parity of path between the node and root.
 » 4 weeks ago, # | ← Rev. 2 →   +4
•  » » 4 weeks ago, # ^ |   0 ty good sir!
 » 4 weeks ago, # |   +5 609E - Minimum spanning tree for each edgeusing MST and LCA
 » 4 weeks ago, # | ← Rev. 2 →   +6 i tried this interesting problem, although it might be a bit simple for the techniques you are talking about: 1305G - Kuroni and AntihypeUPDATE: CodingPokemon said that these problems are wayyyyyy to easy for your level
•  » » 4 weeks ago, # ^ |   0 aw hell nah
•  » » 4 weeks ago, # ^ |   0 i call cap on the update :skul:
•  » » » 4 weeks ago, # ^ |   0
 » 4 weeks ago, # |   +8 Here is another problem, taht uses treap: 4A - Watermelon
 » 4 weeks ago, # |   0 learn binary search
•  » » 4 weeks ago, # ^ | ← Rev. 2 →   0 .....good tip for newbies and pupils trying to reach specialist/expert
•  » » » 4 weeks ago, # ^ |   0 are you not tryna reach expert lmao
•  » » » » 4 weeks ago, # ^ |   0 im trying to reach master :)
•  » » » » » 4 weeks ago, # ^ |   +3 believe it or not but masters still need to know binary search
 » 4 weeks ago, # |   0 suggest me some mst problems
•  » » 4 weeks ago, # ^ |   +10 This one is nice: uses lca and mst -- [NOIP2013] — 货物运输
 » 4 weeks ago, # |   +3 Why are you asking for more problems when you haven't finished the ones given to you by smax and RobeZH?
•  » » 4 weeks ago, # ^ |   0 I'm in China bru, and I got permission from RobeZH to stop doing the assigned problems
•  » » » 3 weeks ago, # ^ |   0 then ask robezh for more problems smhsurely he can offer you some 603 probs
•  » » » » 3 weeks ago, # ^ |   0 I forgot to specify I'm in Hangzhou
•  » » » » » 3 weeks ago, # ^ |   0 no way you are at xyd camp wtf strong
•  » » » » » » 3 weeks ago, # ^ |   0 blud u think I would be solving 2100-2400 CF problems rn otherwise? (tho most are from luogu)
•  » » » » » » » 3 weeks ago, # ^ |   0 ok but stilllearn binary search
•  » » » » » » » » 3 weeks ago, # ^ |   0 we did, in the first day + ternary search
•  » » » » » » » » » 3 weeks ago, # ^ |   0 surely learn adhoc
•  » » » » » » » » » 3 weeks ago, # ^ |   0 ummmm i believe chinese people aren't russian enough, therefore we aren't learning adhoc :D
•  » » » » » » » » » 3 weeks ago, # ^ |   0 usaco still has ad hoc fyi
•  » » » » » » » » » 3 weeks ago, # ^ |   0 yea i know :pray:
•  » » » » » » » » » 3 weeks ago, # ^ |   0 yes and that is precisely the reason you remain a specialist
•  » » » » » » » » » 3 weeks ago, # ^ |   0 at least im not afraid to comment on my main, and I don't cheat on cf just for rating.... reminds me of someone i know...
 » 3 weeks ago, # |   0 I've been solving problems from this list, it's a very good list!https://mirror.codeforces.com/blog/entry/91600
 » 3 weeks ago, # |   0 It would be great if you could recommend the problems recommended to you during your training camp :)
 » 3 weeks ago, # |   0