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 UnfoldingTriangles { public:
4fd800b3a8 2011-02-23        kinaba: 	int solve(vector <string> grid, int unfoldLimit)
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		int X = grid[0].size();
4fd800b3a8 2011-02-23        kinaba: 		int Y = grid.size();
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		int Max = -1;
4fd800b3a8 2011-02-23        kinaba: 		// top-right
4fd800b3a8 2011-02-23        kinaba: 		for(int y=0; y<Y; ++y)
4fd800b3a8 2011-02-23        kinaba: 			for(int x=X; x>=1; --x)
4fd800b3a8 2011-02-23        kinaba: 			{
4fd800b3a8 2011-02-23        kinaba: 				int numTri = 0;
4fd800b3a8 2011-02-23        kinaba: 				// size
4fd800b3a8 2011-02-23        kinaba: 				for(int n=1; x-n>=0 && y+n<=Y; ++n)
4fd800b3a8 2011-02-23        kinaba: 				{
4fd800b3a8 2011-02-23        kinaba: 					// right-check
4fd800b3a8 2011-02-23        kinaba: 					if( x<X && grid[y+n-1][x]=='#' )
4fd800b3a8 2011-02-23        kinaba: 						goto NextTopRight;
4fd800b3a8 2011-02-23        kinaba: 					// diag-check
4fd800b3a8 2011-02-23        kinaba: 					if( grid[y+n-1][x-n]!='/' )
4fd800b3a8 2011-02-23        kinaba: 						goto NextTopRight;
4fd800b3a8 2011-02-23        kinaba: 					// inner-check
4fd800b3a8 2011-02-23        kinaba: 					for(int k=1; k<n; ++k) {
4fd800b3a8 2011-02-23        kinaba: 						if( grid[y+n-1][x-k] == '.' )
4fd800b3a8 2011-02-23        kinaba: 							goto NextTopRight;
4fd800b3a8 2011-02-23        kinaba: 						if( grid[y+n-1][x-k] == '/' )
4fd800b3a8 2011-02-23        kinaba: 							if( ++numTri > unfoldLimit )
4fd800b3a8 2011-02-23        kinaba: 								goto NextTopRight;
4fd800b3a8 2011-02-23        kinaba: 					}
4fd800b3a8 2011-02-23        kinaba: 					// bottom-check
4fd800b3a8 2011-02-23        kinaba: 					bool ok = true;
4fd800b3a8 2011-02-23        kinaba: 					if( y+n == Y )
4fd800b3a8 2011-02-23        kinaba: 						ok = true;
4fd800b3a8 2011-02-23        kinaba: 					else
4fd800b3a8 2011-02-23        kinaba: 						for(int k=1; k<=n; ++k) {
4fd800b3a8 2011-02-23        kinaba: 							if( grid[y+n][x-k] == '#' )
4fd800b3a8 2011-02-23        kinaba: 								{ok=false; break;}
4fd800b3a8 2011-02-23        kinaba: 						}
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 					// update
4fd800b3a8 2011-02-23        kinaba: 					if( ok )
4fd800b3a8 2011-02-23        kinaba: 						Max = max( Max, n*(n+1)/2 );
4fd800b3a8 2011-02-23        kinaba: 				}
4fd800b3a8 2011-02-23        kinaba: 			NextTopRight:;
4fd800b3a8 2011-02-23        kinaba: 			}
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		return Max;
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(_, UnfoldingTriangles().solve(grid, unfoldLimit));}
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 grid_[] = {".../",
4fd800b3a8 2011-02-23        kinaba:  "../#",
4fd800b3a8 2011-02-23        kinaba:  "./#/",
4fd800b3a8 2011-02-23        kinaba:  "/#//"};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> grid(grid_, grid_+sizeof(grid_)/sizeof(*grid_));
4fd800b3a8 2011-02-23        kinaba: 	int unfoldLimit = 4;
4fd800b3a8 2011-02-23        kinaba: 	int _ = 10;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(1)
4fd800b3a8 2011-02-23        kinaba: 	string grid_[] = {".../",
4fd800b3a8 2011-02-23        kinaba:  "../#",
4fd800b3a8 2011-02-23        kinaba:  "./#/",
4fd800b3a8 2011-02-23        kinaba:  "/#//"};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> grid(grid_, grid_+sizeof(grid_)/sizeof(*grid_));
4fd800b3a8 2011-02-23        kinaba: 	int unfoldLimit = 2;
4fd800b3a8 2011-02-23        kinaba: 	int _ = 3;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(2)
4fd800b3a8 2011-02-23        kinaba: 	string grid_[] = {"////",
4fd800b3a8 2011-02-23        kinaba:  "////",
4fd800b3a8 2011-02-23        kinaba:  "////",
4fd800b3a8 2011-02-23        kinaba:  "////"};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> grid(grid_, grid_+sizeof(grid_)/sizeof(*grid_));
4fd800b3a8 2011-02-23        kinaba: 	int unfoldLimit = 5;
4fd800b3a8 2011-02-23        kinaba: 	int _ = 6;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(3)
4fd800b3a8 2011-02-23        kinaba: 	string grid_[] = {".....#...",
4fd800b3a8 2011-02-23        kinaba:  "....###.."};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> grid(grid_, grid_+sizeof(grid_)/sizeof(*grid_));
4fd800b3a8 2011-02-23        kinaba: 	int unfoldLimit = 10;
4fd800b3a8 2011-02-23        kinaba: 	int _ = -1;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(4)
4fd800b3a8 2011-02-23        kinaba: 	string grid_[] = {"#//#",
4fd800b3a8 2011-02-23        kinaba:  "#//#",
4fd800b3a8 2011-02-23        kinaba:  "####",
4fd800b3a8 2011-02-23        kinaba:  "///#"};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> grid(grid_, grid_+sizeof(grid_)/sizeof(*grid_));
4fd800b3a8 2011-02-23        kinaba: 	int unfoldLimit = 4;
4fd800b3a8 2011-02-23        kinaba: 	int _ = 1;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(5)
4fd800b3a8 2011-02-23        kinaba: 	string grid_[] = {".../.../",
4fd800b3a8 2011-02-23        kinaba:  "../#..//",
4fd800b3a8 2011-02-23        kinaba:  "./.#.///",
4fd800b3a8 2011-02-23        kinaba:  "/###...."};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> grid(grid_, grid_+sizeof(grid_)/sizeof(*grid_));
4fd800b3a8 2011-02-23        kinaba: 	int unfoldLimit = 3;
4fd800b3a8 2011-02-23        kinaba: 	int _ = 6;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(6)
4fd800b3a8 2011-02-23        kinaba: 	string grid_[] = {
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  "//////////////////////////////////////////////////",
4fd800b3a8 2011-02-23        kinaba:  };
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> grid(grid_, grid_+sizeof(grid_)/sizeof(*grid_));
4fd800b3a8 2011-02-23        kinaba: 	int unfoldLimit = 2500;
4fd800b3a8 2011-02-23        kinaba: 	int _ = 6;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: }
4fd800b3a8 2011-02-23        kinaba: // END CUT HERE