I can't understand the problem. can anyone help me please :)
Problems link: http://www.codeforces.com/problemset/problem/196/B
Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here.
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/07/2026 00:32:15 (f1).
Desktop version, switch to mobile version.
Supported by
Here's the main idea:
If you can reach cell (i,j) in maze A and also in some other maze B, then you can walk infinitely. This reduces the space of your BFS to N*N (a node in your BFS consists of (i,j,mazeNumber)).
Please explain more without using BFS.
As you have to explore the state space you must use one of the exploration algorithms (BFS/DFS). Maybe I didn't understand your question properly.
I'm not really good with DFS/BFS so i was trying to solve it with another way
You'd rather learn BFS/DFS algorithms because without learning such basic algorithms you won't succeed in writing contests. At least try to learn them, they are really useful and powerful ones. Moreover, I don't see any other solution to this problem, neither simple, nor hard.
.