Solve Giant Pizza if you have not already. It is the canonical 2-SAT problem and good practice for the technique. Focus on clean graph construction and correct SCC implementation. Make sure you handle the node indexing correctly.
Use 2i for xi and 2i+1 for NOT xi to avoid confusion. Verify your solution on small test cases first. Trace through the implications by hand to understand the flow.