×

# approach for BEERUS

 1 Can anyone discuss their approach for this problem from this contest This question is marked "community wiki". asked 13 Jun, 11:15 3★sonu_628 336●8 accept rate: 8%

 3 The only catch in the problem was that (node(i) OR node(j)) + (node(i) AND node(j)) = node(i) + node(j).The rest is easy to figure out. answered 13 Jun, 12:13 6★smartnj 57●3 accept rate: 50% Can you tell me where did you learn this property that A|B + A&B = A + B (14 Jun, 12:48) ay23063★
 1 From this I see that MST is a star with center in lightweight node. And weight MST = Sum{node_i} + (n-2)*node_0, node_0 - is lightweight node. Sum {node_i} - easy to get. But how to get weight of lightweight node? answered 13 Jun, 19:51 106●3 accept rate: 9% 2 If you have $\displaystyle\sum_{i}^{} node_i$ it should be straightforward to obtain the weights for each node. $node_i = \frac{1}{n} * \left( gohan[i] + trunks[i] - \displaystyle\sum_{i}^{} node_i\right)$. Now just loop over all nodes and obtain the maximum. (13 Jun, 21:58)
 toggle preview community wiki:
Preview

By Email:

Markdown Basics

• *italic* or _italic_
• **bold** or __bold__
• image?![alt text](/path/img.jpg "title")
• numbered list: 1. Foo 2. Bar
• to add a line break simply add two spaces to where you would like the new line to be.
• basic HTML tags are also supported
• mathemetical formulas in Latex between \$ symbol

Question tags:

×2,541
×368
×72
×5