During a contest, wasting 40 minutes on a broken idea hurts way more than skipping a problem. These are the 3 red flags that usually tell me to drop an approach: (-) Endless casework: Every edge case you find needs a new patch instead of fitting one clean rule. (-) Forcing a data structure: You picked Segment Tree / Binary Search early, and now you're inventing ugly hacks just to make transitions work. (-) Can't explain why in one sentence: If your greedy/DP idea sounds like "maybe sort by X and hope it works" without a clear invariant, you're guessing.
When any of these happen, I test n <= 5 by hand or flip the problem (work backwards from the final state).
What's your biggest red flag that an approach won't work?









If I find myself writing more than 100 lines for a Div2 C, I stop immediately
When I have to prove my greedy by saying 'trust me bro' to myself
if you cannot reduce your shi to a mathematical formula or two 90% of the time; your shi failing
a refined version of the ^ comment:
The remaining 10% is Div2 C constructive problems where the intended solution is 150 lines of pure pain
drop an example problem yo