War with Code

/*   Shahadat Hossain   I.C.T Department   Comilla University   Session: 2013-2014   .   Problem Site: LightOj   Problem No: 1174   Problem Name: Commandos  Using BFS   */ #include <cstdio> #include <sstream> #include <cstdlib> #include <cctype> #include <cmath> #include <algorithm> #include <set> #include <queue> #include <stack> #include <list> #include <iostream> #include <fstream> #include <numeric> #include <string> #include <vector> #include <cstring> #include <map> #include <iterator> #define valid(x,y) x>= 0 && y>= 0 && x<row && y<col int fx[]= { 1 ,- 1 , 0 , 0 }; int fy[]={ 0 , 0 , 1 ,- 1 }; #define pb push_back #define mp make_pair #define fs first #define se second #define pi 2 *acos( 0 ) #define PI 3.14159265358979323846264338 #define mod