/* The city is rectangular in shape of size having 'r' rows and 'c' columns. The city is divided into 'r x c' cells. Each cell is either '#' or '.' denoting whether the cell is BURNING or is SAFE, respectively. You can move horizontally or vertically from the block you are standing on. You cannot move diagonally to any other block. Input Format First line contains an integer 't' denoting the number of test cases. For each test case : First line contains an integer 'r' denoting the number of rows in the city. Second line contains an integer 'c' denoting the number of columns in the city. Third line contains four integers 'a', 'b', 'c', 'd' denoting the STARTING indices and DESTINATION indices. Each subsequent 'r' lines contains 'c' space-separated characters. Each character is either '.' or '#'. Output Format Print "YES" (without quotes) if there is any SAFE PATH from their STARTING LOCATION to DESTINATION LOCATION else print "NO" (without quotes) on a new line. Sample Input: 2 4 4 2 2 0 0 . . # # # . . # # # . # . # # # 4 4 2 2 0 0 . . # # # . # # # # . # . # # # Sample Output: YES NO */ #include #include #include using namespace std; struct cell { int row; int col; bool isSafe; cell(int r,int c,bool safe) : row(r),col(c),isSafe(safe){} bool operator==(const cell& obj) { if(row==obj.row && col==obj.col) return true; else return false; } }; enum class direction { up, down, left, right }; ostream& operator<< (ostream& os,const direction d) { if(d==direction::up) os << "up"; else if(d==direction::down) os << "down"; else if(d==direction::left) os << "left"; else if(d==direction::right) os << "right"; return os; } bool IsCellSafe(direction d,int& r,int& c,vector& vecCells) { //cout << "called for " << d << endl; int row = r; int col = c; if(d==direction::up) --row; else if(d==direction::down) ++row; else if(d==direction::left) --col; else if(d==direction::right) ++col; auto itr = find(vecCells.begin(),vecCells.end(),cell(row,col,false)); if(itr==vecCells.end()) { //cout << "NO CEELLS for " << d << " "<< row << ","<< col << endl; return false; } else { if(itr->isSafe) { r= row; c=col; //cout << "in okay called for " << d << " "<< r << ","<< c << endl; return true; } else { //cout << "in not okay called for " << d << " "<< r << ","<< c << endl; return false; } } } using namespace std; int main() { int T; cin >> T; for(int t=0;t> R >> C; int x_s,y_s,x_e,y_e; cin >> x_s >> y_s >> x_e >> y_e; //cout << x_s << ":"<< x_e << ":"<< y_s<<":" << y_e << endl; vector vecCells; for(int r=0;r> ch; if(ch=='#') vecCells.emplace_back(r,c,false); if(ch=='.') vecCells.emplace_back(r,c,true); } } string result = "NO"; int looped = 0; while(true) { //cout << "for iteration : " << looped << x_s << " " << y_s << " " << x_e << " " << y_e << endl; bool leftsafe,rightsafe,upsafe,downsafe; if(y_s>y_e) leftsafe = IsCellSafe(direction::left,x_s,y_s,vecCells); if(x_s==x_e && y_s == y_e) { result = "YES"; break; } if(y_sx_e) upsafe = IsCellSafe(direction::up,x_s,y_s,vecCells); if(x_s==x_e && y_s == y_e) { result = "YES"; break; } if(!downsafe && !upsafe && !leftsafe && !rightsafe) { result = "NO"; break; } ++looped; if(looped==20) break; } if(t==0) cout << result << endl; else cout << result; //print main layout //for(int i=0;i

Challenge [Escape Game]