Computer Game Educational Codeforces Round 115 Solution
Introduction
Series of Educational Rounds continue to be held as Harbour Space University initiative. This round will be rated for coders with rating upto 2100. It will be held on extended ICPC rules. The penalty for each incorrect submission until the full correct solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution. You will be given 7 problems and two hours to solve them.
The contest was a success and lots of submissions were made by the hard striving coders. Problem A that is the Computer Game was very easy and had the maximum number of successful submission. Problem B was a not easy but not difficult also it was fit for an average coder to solve. Problem C although was quite confusing at the start but it needed good logic to solve it. Problem D was medium to difficult if you spot the logic then it was not a very big deal. Problem E was difficult to understand but the announcement that was made during the contest helped to understand the problem but it was still difficult to solve as an average coder. Problem F and G were very difficult and were made for the top coders to solve although problem G had only 2 successful submission which decided the rankings of the contest.
This Educational Rounds are very beneficial for the coders who just have started their coding journey and are yet to understand difficult logics and algorithms. Thus practice properly and it would be a great deal to coding journey.
Question
Monocarp is playing a computer game. Now he wants to complete the first level of this game.
A level is a rectangular grid of rows and columns. Monocarp controls a character, which starts in cell — at the intersection of the -st row and the -st column.
Monocarp's character can move from one cell to another in one step if the cells are adjacent by side and/or corner. Formally, it is possible to move from cell to cell in one step if and . Obviously, it is prohibited to go outside the grid.
There are traps in some cells. If Monocarp's character finds himself in such a cell, he dies, and the game ends.
To complete a level, Monocarp's character should reach cell — at the intersection of row and column .
Help Monocarp determine if it is possible to complete the level.
The first line contains a single integer () — the number of test cases. Then the test cases follow. Each test case consists of three lines.
The first line contains a single integer () — the number of columns.
The next two lines describe the level. The -th of these lines describes the -th line of the level — the line consists of the characters '0' and '1'. The character '0' corresponds to a safe cell, the character '1' corresponds to a trap cell.
Additional constraint on the input: cells and are safe.
For each test case, output YES if it is possible to complete the level, and NO otherwise.
4 3 000 000 4 0011 1100 4 0111 1110 6 010101 101010
YES YES NO YES
Consider the example from the statement.
In the first test case, one of the possible paths is .
In the second test case, one of the possible paths is
In the fourth test case, one of the possible paths is .
Comments
Post a Comment