| # | User | Rating |
|---|---|---|
| 1 | Benq | 3857 |
| 2 | jiangly | 3810 |
| 3 | maroonrk | 3534 |
| 4 | tourist | 3528 |
| 5 | Kevin114514 | 3510 |
| 6 | turmax | 3411 |
| 7 | Um_nik | 3387 |
| 8 | Radewoosh | 3367 |
| 9 | heuristica | 3322 |
| 10 | strapple | 3317 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | maspy | 150 |
| 3 | Um_nik | 146 |
| 4 | Errichto | 139 |
| 5 | adamant | 136 |
| 6 | maroonrk | 134 |
| 7 | DNR | 133 |
| 8 | nik_exists | 131 |
| 8 | Dominater069 | 131 |
| 10 | Proof_by_QED | 130 |
|
+3
Yeah, thanks. I don't know why I was forgetting this condition for this test case. |
|
0
For the problem — Monopole Magnets, it is written:- "every row and every column has exactly one segment of black cells or is all-white" From what I'm understanding, there should be continuous black cells within a row or a column. No white between them. So, if I have a 3x3 square with the middle cell (1,1) white and all other cells black. Then I can have a solution with four south magnets at the four corners ((0,0), (0,2), (2,0), and (2,2)). Can anyone tell me if it's correct or I'm making some mistake? |
|
0
You can think it like this : Suppose You can make a set with distinct elements from the original sequence and of length 3, like (* represents the elements in the original sequence) |
| Name |
|---|


