Minimum OR Spanning Tree

CodeChefRating 2992Open on judge ↗

The *or-weight* of a weighted tree is defined as the [bitwise-or](https://en.wikipedia.org/wiki/Bitwise_operation#OR) of the weights of all edges of the tree. You are given an **undirected weighted connected** graph with $N$ nodes and $M$ edges. Your task is to find the [spanning tree](https://en.wikipedia.org/wiki/Spanning_tree) with **minimum** *or-weight*. You should answer $Q$ queries. For

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI