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 ColorfulDecoration { public:
4fd800b3a8 2011-02-23        kinaba: 	int getMaximum(vector <int> xa, vector <int> ya, vector <int> xb, vector <int> yb)
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		int L=0, R=1000000001;
4fd800b3a8 2011-02-23        kinaba: 		while( R-L>=2 )
4fd800b3a8 2011-02-23        kinaba: 		{
4fd800b3a8 2011-02-23        kinaba: 			int C = (L+R)/2;
4fd800b3a8 2011-02-23        kinaba: 			(canPlace(C, xa, ya, xb, yb)?L:R) = C;
4fd800b3a8 2011-02-23        kinaba: 		}
4fd800b3a8 2011-02-23        kinaba: 		return L;
4fd800b3a8 2011-02-23        kinaba: 	}
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 	typedef vector< vector<int> > graph;
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 	bool canPlace(int C, vector <int> xa, vector <int> ya, vector <int> xb, vector <int> yb)
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		int N = xa.size();
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		graph G(2*N);
4fd800b3a8 2011-02-23        kinaba: 		for(int i=0; i<N; ++i) {
4fd800b3a8 2011-02-23        kinaba: 			for(int j=0; j<N; ++j) if(i!=j)
4fd800b3a8 2011-02-23        kinaba: 				if( !ok(C, xa[i], ya[i], xa[j], ya[j]) )
4fd800b3a8 2011-02-23        kinaba: 					G[i].push_back(N+j);
4fd800b3a8 2011-02-23        kinaba: 			for(int j=0; j<N; ++j) if(i!=j)
4fd800b3a8 2011-02-23        kinaba: 				if( !ok(C, xa[i], ya[i], xb[j], yb[j]) )
4fd800b3a8 2011-02-23        kinaba: 					G[i].push_back(j);
4fd800b3a8 2011-02-23        kinaba: 			for(int j=0; j<N; ++j) if(i!=j)
4fd800b3a8 2011-02-23        kinaba: 				if( !ok(C, xb[i], yb[i], xa[j], ya[j]) )
4fd800b3a8 2011-02-23        kinaba: 					G[N+i].push_back(N+j);
4fd800b3a8 2011-02-23        kinaba: 			for(int j=0; j<N; ++j) if(i!=j)
4fd800b3a8 2011-02-23        kinaba: 				if( !ok(C, xb[i], yb[i], xb[j], yb[j]) )
4fd800b3a8 2011-02-23        kinaba: 					G[N+i].push_back(j);
4fd800b3a8 2011-02-23        kinaba: 		}
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		for(int i=0; i<N; ++i)
4fd800b3a8 2011-02-23        kinaba: 			if( reachable(G,i,N+i) && reachable(G,N+i,i) )
4fd800b3a8 2011-02-23        kinaba: 				return false;
4fd800b3a8 2011-02-23        kinaba: 		return true;
4fd800b3a8 2011-02-23        kinaba: 	}
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 	bool reachable(graph& G, int s, int d)
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		set<int> V;
4fd800b3a8 2011-02-23        kinaba: 		queue<int> Q;
4fd800b3a8 2011-02-23        kinaba: 		Q.push(s);
4fd800b3a8 2011-02-23        kinaba: 		V.insert(s);
4fd800b3a8 2011-02-23        kinaba: 		while( !Q.empty() ) {
4fd800b3a8 2011-02-23        kinaba: 			int v = Q.front(); Q.pop();
4fd800b3a8 2011-02-23        kinaba: 			for(int i=0; i<G[v].size(); ++i) {
4fd800b3a8 2011-02-23        kinaba: 				int u = G[v][i];
4fd800b3a8 2011-02-23        kinaba: 				if( u == d )
4fd800b3a8 2011-02-23        kinaba: 					return true;
4fd800b3a8 2011-02-23        kinaba: 				if( !V.count(u) )
4fd800b3a8 2011-02-23        kinaba: 					V.insert(u), Q.push(u);
4fd800b3a8 2011-02-23        kinaba: 			}
4fd800b3a8 2011-02-23        kinaba: 		}
4fd800b3a8 2011-02-23        kinaba: 		return false;
4fd800b3a8 2011-02-23        kinaba: 	}
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 	bool ok(int C, int x1, int y1, int x2, int y2)
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		return C <= max(abs(x1-x2), abs(y1-y2));
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(_, ColorfulDecoration().getMaximum(xa, ya, xb, yb));}
4fd800b3a8 2011-02-23        kinaba: int main(){
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: CASE(0)
4fd800b3a8 2011-02-23        kinaba: 	int xa_[] = { 10,  0,  7 };
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> xa(xa_, xa_+sizeof(xa_)/sizeof(*xa_));
4fd800b3a8 2011-02-23        kinaba: 	int ya_[] = {  0, 19,  6 };
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> ya(ya_, ya_+sizeof(ya_)/sizeof(*ya_));
4fd800b3a8 2011-02-23        kinaba: 	int xb_[] = { 20, 10, 25 };
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> xb(xb_, xb_+sizeof(xb_)/sizeof(*xb_));
4fd800b3a8 2011-02-23        kinaba: 	int yb_[] = { 20, 35, 25 };
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> yb(yb_, yb_+sizeof(yb_)/sizeof(*yb_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 19;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(1)
4fd800b3a8 2011-02-23        kinaba: 	int xa_[] = { 464, 20 };
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> xa(xa_, xa_+sizeof(xa_)/sizeof(*xa_));
4fd800b3a8 2011-02-23        kinaba: 	int ya_[] = { 464, 10 };
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> ya(ya_, ya_+sizeof(ya_)/sizeof(*ya_));
4fd800b3a8 2011-02-23        kinaba: 	int xb_[] = { 464,  3 };
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> xb(xb_, xb_+sizeof(xb_)/sizeof(*xb_));
4fd800b3a8 2011-02-23        kinaba: 	int yb_[] = { 464, 16 };
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> yb(yb_, yb_+sizeof(yb_)/sizeof(*yb_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 461;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(2)
4fd800b3a8 2011-02-23        kinaba: 	int xa_[] = { 0, 0, 1, 1 };
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> xa(xa_, xa_+sizeof(xa_)/sizeof(*xa_));
4fd800b3a8 2011-02-23        kinaba: 	int ya_[] = { 0, 0, 1, 1 };
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> ya(ya_, ya_+sizeof(ya_)/sizeof(*ya_));
4fd800b3a8 2011-02-23        kinaba: 	int xb_[] = { 1, 1, 0, 0 };
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> xb(xb_, xb_+sizeof(xb_)/sizeof(*xb_));
4fd800b3a8 2011-02-23        kinaba: 	int yb_[] = { 1, 1, 0, 0 };
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> yb(yb_, yb_+sizeof(yb_)/sizeof(*yb_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 0;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(3)
4fd800b3a8 2011-02-23        kinaba: 	int xa_[] = { 0, 3, 0, 5, 6 };
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> xa(xa_, xa_+sizeof(xa_)/sizeof(*xa_));
4fd800b3a8 2011-02-23        kinaba: 	int ya_[] = { 1, 6, 0, 8, 5 };
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> ya(ya_, ya_+sizeof(ya_)/sizeof(*ya_));
4fd800b3a8 2011-02-23        kinaba: 	int xb_[] = { 6, 1, 7, 4, 7 };
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> xb(xb_, xb_+sizeof(xb_)/sizeof(*xb_));
4fd800b3a8 2011-02-23        kinaba: 	int yb_[] = { 5, 9, 2, 8, 9 };
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> yb(yb_, yb_+sizeof(yb_)/sizeof(*yb_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 3;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(4)
4fd800b3a8 2011-02-23        kinaba: 	int xa_[] = { 1000000000, 0 };
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> xa(xa_, xa_+sizeof(xa_)/sizeof(*xa_));
4fd800b3a8 2011-02-23        kinaba: 	int ya_[] = { 0, 1000000000 };
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> ya(ya_, ya_+sizeof(ya_)/sizeof(*ya_));
4fd800b3a8 2011-02-23        kinaba: 	int xb_[] = { 0, 1000000000 };
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> xb(xb_, xb_+sizeof(xb_)/sizeof(*xb_));
4fd800b3a8 2011-02-23        kinaba: 	int yb_[] = { 0, 1000000000 };
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> yb(yb_, yb_+sizeof(yb_)/sizeof(*yb_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 1000000000;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(5)
4fd800b3a8 2011-02-23        kinaba: 	int xa_[] = {0,0};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> xa(xa_, xa_+sizeof(xa_)/sizeof(*xa_));
4fd800b3a8 2011-02-23        kinaba: 	int ya_[] = {0,0};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> ya(ya_, ya_+sizeof(ya_)/sizeof(*ya_));
4fd800b3a8 2011-02-23        kinaba: 	int xb_[] = {0,0};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> xb(xb_, xb_+sizeof(xb_)/sizeof(*xb_));
4fd800b3a8 2011-02-23        kinaba: 	int yb_[] = {0,0};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> yb(yb_, yb_+sizeof(yb_)/sizeof(*yb_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 0;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(6)
4fd800b3a8 2011-02-23        kinaba: 	int xa_[] = {0,0};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> xa(xa_, xa_+sizeof(xa_)/sizeof(*xa_));
4fd800b3a8 2011-02-23        kinaba: 	int ya_[] = {0,0};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> ya(ya_, ya_+sizeof(ya_)/sizeof(*ya_));
4fd800b3a8 2011-02-23        kinaba: 	int xb_[] = {1,1};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> xb(xb_, xb_+sizeof(xb_)/sizeof(*xb_));
4fd800b3a8 2011-02-23        kinaba: 	int yb_[] = {1,1};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> yb(yb_, yb_+sizeof(yb_)/sizeof(*yb_));
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: 	int xa_[] = {0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> xa(xa_, xa_+sizeof(xa_)/sizeof(*xa_));
4fd800b3a8 2011-02-23        kinaba: 	int ya_[] = {1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,10};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> ya(ya_, ya_+sizeof(ya_)/sizeof(*ya_));
4fd800b3a8 2011-02-23        kinaba: 	int xb_[] = {2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,10,11};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> xb(xb_, xb_+sizeof(xb_)/sizeof(*xb_));
4fd800b3a8 2011-02-23        kinaba: 	int yb_[] = {3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,10,11,12};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> yb(yb_, yb_+sizeof(yb_)/sizeof(*yb_));
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