Codeforces and Polygon may be unavailable from December 6, 19:00 (UTC) to December 6, 21:00 (UTC) due to technical maintenance. ×

Help with a 2-SAT problem please?

Revision en1, by KIMJONGOOF, 2024-10-11 01:05:53

Problem Link -> https://codeforces.net/contest/776/problem/D

My submission -> https://codeforces.net/contest/776/submission/285238557

Its pretty obvious from my code what i am trying to do. My Question is that is the logic correct? Where am I going wrong?

I just take cases of whether the door is locked or not and accordingly I build the adj list for the corresponding switch combinations.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English KIMJONGOOF 2024-10-11 15:46:23 36 Tiny change: 'binations.' -> 'binations.\n\n*Edit -> Resolved now.'
en1 English KIMJONGOOF 2024-10-11 01:05:53 434 Initial revision (published)