Hi community.
I have two tasks which seems to share same basic ideas.
Problem G in ICPC Tehran site 2017
I tried following approaches for thinking about the first problem:
reducing it to finding maximum subset xor which is of course wrong. since it's not possible to use any subset of edges that we wish (for example in odd length cycles).
Using the fact that edge with the highest bit on should be used but still no chance.
Coming up with some DP solution, I think we need to know current xor of used edges which is too much so no chance again.
I would appreciate any hints.
Sharing thinking process which leads to the solution is so much more helpful though :)
