Help with a 2-SAT problem please?(Resolved)

Правка en2, от KIMJONGOOF, 2024-10-11 15:46:23

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

My submission -> https://codeforces.me/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.

*Edit -> Resolved now.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский KIMJONGOOF 2024-10-11 15:46:23 36 Tiny change: 'binations.' -> 'binations.\n\n*Edit -> Resolved now.'
en1 Английский KIMJONGOOF 2024-10-11 01:05:53 434 Initial revision (published)