| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
Help with a 2-SAT problem please?(Resolved)
Problem Link -> https://mirror.codeforces.com/contest/776/problem/D
My submission -> https://mirror.codeforces.com/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. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
AARYABHATTA_THE_GREAT | 2024-10-11 15:46:23 | 36 | Tiny change: 'binations.' -> 'binations.\n\n*Edit -> Resolved now.' | |
| en1 |
|
AARYABHATTA_THE_GREAT | 2024-10-11 01:05:53 | 434 | Initial revision (published) |
