4fd800b3a8 2011-02-23        kinaba: #include <iostream>
4fd800b3a8 2011-02-23        kinaba: #include <sstream>
4fd800b3a8 2011-02-23        kinaba: #include <iomanip>
4fd800b3a8 2011-02-23        kinaba: #include <vector>
4fd800b3a8 2011-02-23        kinaba: #include <string>
4fd800b3a8 2011-02-23        kinaba: #include <map>
4fd800b3a8 2011-02-23        kinaba: #include <set>
4fd800b3a8 2011-02-23        kinaba: #include <algorithm>
4fd800b3a8 2011-02-23        kinaba: #include <numeric>
4fd800b3a8 2011-02-23        kinaba: #include <iterator>
4fd800b3a8 2011-02-23        kinaba: #include <functional>
4fd800b3a8 2011-02-23        kinaba: #include <complex>
4fd800b3a8 2011-02-23        kinaba: #include <queue>
4fd800b3a8 2011-02-23        kinaba: #include <stack>
4fd800b3a8 2011-02-23        kinaba: #include <cmath>
4fd800b3a8 2011-02-23        kinaba: #include <cassert>
4fd800b3a8 2011-02-23        kinaba: #include <cstring>
4fd800b3a8 2011-02-23        kinaba: using namespace std;
4fd800b3a8 2011-02-23        kinaba: typedef long long LL;
4fd800b3a8 2011-02-23        kinaba: typedef complex<double> CMP;
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: class MazeMaker { public:
4fd800b3a8 2011-02-23        kinaba: 	int longestPath(vector <string> maze, int startRow, int startCol, vector <int> moveRow, vector <int> moveCol)
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		const int H = maze.size();
4fd800b3a8 2011-02-23        kinaba: 		const int W = maze[0].size();
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		typedef pair<int,int> point;
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		int cell = 0;
4fd800b3a8 2011-02-23        kinaba: 		for(int y=0; y<H; ++y)
4fd800b3a8 2011-02-23        kinaba: 			for(int x=0; x<W; ++x)
4fd800b3a8 2011-02-23        kinaba: 				if( maze[y][x] == '.' )
4fd800b3a8 2011-02-23        kinaba: 					++cell;
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		vector<point> q(1, point(startRow, startCol));
4fd800b3a8 2011-02-23        kinaba: 		set<point> visited; visited.insert(q[0]);
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		for(int step=0 ;; ++step)
4fd800b3a8 2011-02-23        kinaba: 		{
4fd800b3a8 2011-02-23        kinaba: 			vector<point> q2;
4fd800b3a8 2011-02-23        kinaba: 			for(int i=0; i<q.size(); ++i)
4fd800b3a8 2011-02-23        kinaba: 				for(int j=0; j<moveRow.size(); ++j)
4fd800b3a8 2011-02-23        kinaba: 				{
4fd800b3a8 2011-02-23        kinaba: 					int yy = q[i].first+moveRow[j];
4fd800b3a8 2011-02-23        kinaba: 					int xx = q[i].second+moveCol[j];
4fd800b3a8 2011-02-23        kinaba: 					point pp( yy, xx );
4fd800b3a8 2011-02-23        kinaba: 					if( visited.count(pp) || yy<0 || H<=yy || xx<0 || W<=xx || maze[yy][xx]!='.' )
4fd800b3a8 2011-02-23        kinaba: 						continue;
4fd800b3a8 2011-02-23        kinaba: 					visited.insert(pp);
4fd800b3a8 2011-02-23        kinaba: 					q2.push_back(pp);
4fd800b3a8 2011-02-23        kinaba: 				}
4fd800b3a8 2011-02-23        kinaba: 			q.swap(q2);
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 			if( q.empty() )
4fd800b3a8 2011-02-23        kinaba: 				return (visited.size()==cell ? step : -1);
4fd800b3a8 2011-02-23        kinaba: 		}
4fd800b3a8 2011-02-23        kinaba: 		assert(false);
4fd800b3a8 2011-02-23        kinaba: 	}
4fd800b3a8 2011-02-23        kinaba: };
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: // BEGIN CUT HERE
4fd800b3a8 2011-02-23        kinaba: #include <ctime>
4fd800b3a8 2011-02-23        kinaba: double start_time; string timer()
4fd800b3a8 2011-02-23        kinaba:  { ostringstream os; os << " (" << int((clock()-start_time)/CLOCKS_PER_SEC*1000) << " msec)"; return os.str(); }
4fd800b3a8 2011-02-23        kinaba: template<typename T> ostream& operator<<(ostream& os, const vector<T>& v)
4fd800b3a8 2011-02-23        kinaba:  { os << "{ ";
4fd800b3a8 2011-02-23        kinaba:    for(typename vector<T>::const_iterator it=v.begin(); it!=v.end(); ++it)
4fd800b3a8 2011-02-23        kinaba:    os << '\"' << *it << '\"' << (it+1==v.end() ? "" : ", "); os << " }"; return os; }
4fd800b3a8 2011-02-23        kinaba: void verify_case(const int& Expected, const int& Received) {
4fd800b3a8 2011-02-23        kinaba:  bool ok = (Expected == Received);
4fd800b3a8 2011-02-23        kinaba:  if(ok) cerr << "PASSED" << timer() << endl;  else { cerr << "FAILED" << timer() << endl;
4fd800b3a8 2011-02-23        kinaba:  cerr << "\to: \"" << Expected << '\"' << endl << "\tx: \"" << Received << '\"' << endl; } }
4fd800b3a8 2011-02-23        kinaba: #define CASE(N) {cerr << "Test Case #" << N << "..." << flush; start_time=clock();
4fd800b3a8 2011-02-23        kinaba: #define END	 verify_case(_, MazeMaker().longestPath(maze, startRow, startCol, moveRow, moveCol));}
4fd800b3a8 2011-02-23        kinaba: int main(){
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: CASE(0)
4fd800b3a8 2011-02-23        kinaba: 	string maze_[] = {"...",
4fd800b3a8 2011-02-23        kinaba:  "...",
4fd800b3a8 2011-02-23        kinaba:  "..."};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> maze(maze_, maze_+sizeof(maze_)/sizeof(*maze_));
4fd800b3a8 2011-02-23        kinaba: 	int startRow = 0;
4fd800b3a8 2011-02-23        kinaba: 	int startCol = 1;
4fd800b3a8 2011-02-23        kinaba: 	int moveRow_[] = {1,0,-1,0};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> moveRow(moveRow_, moveRow_+sizeof(moveRow_)/sizeof(*moveRow_));
4fd800b3a8 2011-02-23        kinaba: 	int moveCol_[] = {0,1,0,-1};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> moveCol(moveCol_, moveCol_+sizeof(moveCol_)/sizeof(*moveCol_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 3;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(1)
4fd800b3a8 2011-02-23        kinaba: 	string maze_[] = {"...",
4fd800b3a8 2011-02-23        kinaba:  "...",
4fd800b3a8 2011-02-23        kinaba:  "..."};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> maze(maze_, maze_+sizeof(maze_)/sizeof(*maze_));
4fd800b3a8 2011-02-23        kinaba: 	int startRow = 0;
4fd800b3a8 2011-02-23        kinaba: 	int startCol = 1;
4fd800b3a8 2011-02-23        kinaba: 	int moveRow_[] = {1, 0, -1, 0, 1, 1, -1, -1};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> moveRow(moveRow_, moveRow_+sizeof(moveRow_)/sizeof(*moveRow_));
4fd800b3a8 2011-02-23        kinaba: 	int moveCol_[] = {0, 1, 0, -1, 1, -1, 1, -1};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> moveCol(moveCol_, moveCol_+sizeof(moveCol_)/sizeof(*moveCol_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 2;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(2)
4fd800b3a8 2011-02-23        kinaba: 	string maze_[] = {"X.X",
4fd800b3a8 2011-02-23        kinaba:  "...",
4fd800b3a8 2011-02-23        kinaba:  "XXX",
4fd800b3a8 2011-02-23        kinaba:  "X.X"};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> maze(maze_, maze_+sizeof(maze_)/sizeof(*maze_));
4fd800b3a8 2011-02-23        kinaba: 	int startRow = 0;
4fd800b3a8 2011-02-23        kinaba: 	int startCol = 1;
4fd800b3a8 2011-02-23        kinaba: 	int moveRow_[] = {1, 0, -1, 0};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> moveRow(moveRow_, moveRow_+sizeof(moveRow_)/sizeof(*moveRow_));
4fd800b3a8 2011-02-23        kinaba: 	int moveCol_[] = {0, 1, 0, -1};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> moveCol(moveCol_, moveCol_+sizeof(moveCol_)/sizeof(*moveCol_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = -1;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(3)
4fd800b3a8 2011-02-23        kinaba: 	string maze_[] = {".......",
4fd800b3a8 2011-02-23        kinaba:  "X.X.X..",
4fd800b3a8 2011-02-23        kinaba:  "XXX...X",
4fd800b3a8 2011-02-23        kinaba:  "....X..",
4fd800b3a8 2011-02-23        kinaba:  "X....X.",
4fd800b3a8 2011-02-23        kinaba:  "......."};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> maze(maze_, maze_+sizeof(maze_)/sizeof(*maze_));
4fd800b3a8 2011-02-23        kinaba: 	int startRow = 5;
4fd800b3a8 2011-02-23        kinaba: 	int startCol = 0;
4fd800b3a8 2011-02-23        kinaba: 	int moveRow_[] = {1, 0, -1, 0,-2, 1};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> moveRow(moveRow_, moveRow_+sizeof(moveRow_)/sizeof(*moveRow_));
4fd800b3a8 2011-02-23        kinaba: 	int moveCol_[] = {0, -1, 0, 1, 3, 0};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> moveCol(moveCol_, moveCol_+sizeof(moveCol_)/sizeof(*moveCol_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 7;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(4)
4fd800b3a8 2011-02-23        kinaba: 	string maze_[] = {"......."};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> maze(maze_, maze_+sizeof(maze_)/sizeof(*maze_));
4fd800b3a8 2011-02-23        kinaba: 	int startRow = 0;
4fd800b3a8 2011-02-23        kinaba: 	int startCol = 0;
4fd800b3a8 2011-02-23        kinaba: 	int moveRow_[] = {1, 0, 1, 0, 1, 0};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> moveRow(moveRow_, moveRow_+sizeof(moveRow_)/sizeof(*moveRow_));
4fd800b3a8 2011-02-23        kinaba: 	int moveCol_[] = {0, 1, 0, 1, 0, 1};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> moveCol(moveCol_, moveCol_+sizeof(moveCol_)/sizeof(*moveCol_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 6;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(5)
4fd800b3a8 2011-02-23        kinaba: 	string maze_[] = {"..X.X.X.X.X.X."};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> maze(maze_, maze_+sizeof(maze_)/sizeof(*maze_));
4fd800b3a8 2011-02-23        kinaba: 	int startRow = 0;
4fd800b3a8 2011-02-23        kinaba: 	int startCol = 0;
4fd800b3a8 2011-02-23        kinaba: 	int moveRow_[] = {2,0,-2,0};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> moveRow(moveRow_, moveRow_+sizeof(moveRow_)/sizeof(*moveRow_));
4fd800b3a8 2011-02-23        kinaba: 	int moveCol_[] = {0,2,0,-2};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> moveCol(moveCol_, moveCol_+sizeof(moveCol_)/sizeof(*moveCol_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = -1;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(6)
4fd800b3a8 2011-02-23        kinaba: 	string maze_[] = {".X","X."};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> maze(maze_, maze_+sizeof(maze_)/sizeof(*maze_));
4fd800b3a8 2011-02-23        kinaba: 	int startRow = 0;
4fd800b3a8 2011-02-23        kinaba: 	int startCol = 0;
4fd800b3a8 2011-02-23        kinaba: 	int moveRow_[] = {1};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> moveRow(moveRow_, moveRow_+sizeof(moveRow_)/sizeof(*moveRow_));
4fd800b3a8 2011-02-23        kinaba: 	int moveCol_[] = {1};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> moveCol(moveCol_, moveCol_+sizeof(moveCol_)/sizeof(*moveCol_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 1;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(7)
4fd800b3a8 2011-02-23        kinaba: 	string maze_[] = {".X","X."};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> maze(maze_, maze_+sizeof(maze_)/sizeof(*maze_));
4fd800b3a8 2011-02-23        kinaba: 	int startRow = 0;
4fd800b3a8 2011-02-23        kinaba: 	int startCol = 0;
4fd800b3a8 2011-02-23        kinaba: 	int moveRow_[] = {1};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> moveRow(moveRow_, moveRow_+sizeof(moveRow_)/sizeof(*moveRow_));
4fd800b3a8 2011-02-23        kinaba: 	int moveCol_[] = {0};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> moveCol(moveCol_, moveCol_+sizeof(moveCol_)/sizeof(*moveCol_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = -1;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: }
4fd800b3a8 2011-02-23        kinaba: // END CUT HERE