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 CrouchingAmoebas { public:
4fd800b3a8 2011-02-23        kinaba: 	int count(vector <int> x, vector <int> y, int A, int T)
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		int answer = 0;
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		const int N = x.size();
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		vector<int> ys, xs;
4fd800b3a8 2011-02-23        kinaba: 		for(int i=0; i<N; ++i)
4fd800b3a8 2011-02-23        kinaba: 			for(int dy=-T; dy<=+T; ++dy)
4fd800b3a8 2011-02-23        kinaba: 				ys.push_back(y[i]+dy);
4fd800b3a8 2011-02-23        kinaba: 		for(int i=0; i<N; ++i)
4fd800b3a8 2011-02-23        kinaba: 			for(int dx=-T; dx<=+T; ++dx)
4fd800b3a8 2011-02-23        kinaba: 				xs.push_back(x[i]+dx);
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		for(int i=0; i<xs.size(); ++i)
4fd800b3a8 2011-02-23        kinaba: 		for(int k=0; k<ys.size(); ++k)
4fd800b3a8 2011-02-23        kinaba: 		{
4fd800b3a8 2011-02-23        kinaba: 			int Y = ys[k];
4fd800b3a8 2011-02-23        kinaba: 			int X = xs[i];
4fd800b3a8 2011-02-23        kinaba: 			vector<unsigned int> ds;
4fd800b3a8 2011-02-23        kinaba: 			for(int j=0; j<N; ++j) {
4fd800b3a8 2011-02-23        kinaba: 				unsigned int d = distance(Y,X,A,y[j],x[j]);
4fd800b3a8 2011-02-23        kinaba: 				if( d <= T )
4fd800b3a8 2011-02-23        kinaba: 					ds.push_back(d);
4fd800b3a8 2011-02-23        kinaba: 			}
4fd800b3a8 2011-02-23        kinaba: 			sort( ds.begin(), ds.end() );
4fd800b3a8 2011-02-23        kinaba: 			int e=T, c=0;
4fd800b3a8 2011-02-23        kinaba: 			for(int j=0; j<ds.size() && ds[j]<=e; ++j)
4fd800b3a8 2011-02-23        kinaba: 				e-=ds[j], ++c;
4fd800b3a8 2011-02-23        kinaba: 			answer = max(answer, c);
4fd800b3a8 2011-02-23        kinaba: 		}
4fd800b3a8 2011-02-23        kinaba: 		return answer;
4fd800b3a8 2011-02-23        kinaba: 	}
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 	static unsigned int distance(int Y, int X, int A, int y, int x)
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		unsigned int yd = (y<Y ? Y-y : Y+A<y ? y-(Y+A) : 0);
4fd800b3a8 2011-02-23        kinaba: 		unsigned int xd = (x<X ? X-x : X+A<x ? x-(X+A) : 0);
4fd800b3a8 2011-02-23        kinaba: 		return xd + yd;
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(_, CrouchingAmoebas().count(x, y, A, T));}
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 x_[] = {0,0};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> x(x_, x_+sizeof(x_)/sizeof(*x_));
4fd800b3a8 2011-02-23        kinaba: 	int y_[] = {0,1};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> y(y_, y_+sizeof(y_)/sizeof(*y_));
4fd800b3a8 2011-02-23        kinaba: 	int A = 1;
4fd800b3a8 2011-02-23        kinaba: 	int T = 1;
4fd800b3a8 2011-02-23        kinaba: 	int _ = 2;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(1)
4fd800b3a8 2011-02-23        kinaba: 	int x_[] = {0,1,2};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> x(x_, x_+sizeof(x_)/sizeof(*x_));
4fd800b3a8 2011-02-23        kinaba: 	int y_[] = {1,2,0};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> y(y_, y_+sizeof(y_)/sizeof(*y_));
4fd800b3a8 2011-02-23        kinaba: 	int A = 1;
4fd800b3a8 2011-02-23        kinaba: 	int T = 1;
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: 	int x_[] = {0,1,2};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> x(x_, x_+sizeof(x_)/sizeof(*x_));
4fd800b3a8 2011-02-23        kinaba: 	int y_[] = {1,2,0};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> y(y_, y_+sizeof(y_)/sizeof(*y_));
4fd800b3a8 2011-02-23        kinaba: 	int A = 1;
4fd800b3a8 2011-02-23        kinaba: 	int T = 2;
4fd800b3a8 2011-02-23        kinaba: 	int _ = 3;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(3)
4fd800b3a8 2011-02-23        kinaba: 	int x_[] = {0,0,3,3};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> x(x_, x_+sizeof(x_)/sizeof(*x_));
4fd800b3a8 2011-02-23        kinaba: 	int y_[] = {0,3,0,3};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> y(y_, y_+sizeof(y_)/sizeof(*y_));
4fd800b3a8 2011-02-23        kinaba: 	int A = 2;
4fd800b3a8 2011-02-23        kinaba: 	int T = 4;
4fd800b3a8 2011-02-23        kinaba: 	int _ = 4;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(4)
4fd800b3a8 2011-02-23        kinaba: 	int x_[] = {-1000000000,1000000000};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> x(x_, x_+sizeof(x_)/sizeof(*x_));
4fd800b3a8 2011-02-23        kinaba: 	int y_[] = {-1000000000,1000000000};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> y(y_, y_+sizeof(y_)/sizeof(*y_));
4fd800b3a8 2011-02-23        kinaba: 	int A = 1;
4fd800b3a8 2011-02-23        kinaba: 	int T = 15;
4fd800b3a8 2011-02-23        kinaba: 	int _ = 1;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: /*
4fd800b3a8 2011-02-23        kinaba: CASE(5)
4fd800b3a8 2011-02-23        kinaba: 	int x_[] = ;
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> x(x_, x_+sizeof(x_)/sizeof(*x_));
4fd800b3a8 2011-02-23        kinaba: 	int y_[] = ;
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> y(y_, y_+sizeof(y_)/sizeof(*y_));
4fd800b3a8 2011-02-23        kinaba: 	int A = ;
4fd800b3a8 2011-02-23        kinaba: 	int T = ;
4fd800b3a8 2011-02-23        kinaba: 	int _ = ;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(6)
4fd800b3a8 2011-02-23        kinaba: 	int x_[] = ;
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> x(x_, x_+sizeof(x_)/sizeof(*x_));
4fd800b3a8 2011-02-23        kinaba: 	int y_[] = ;
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> y(y_, y_+sizeof(y_)/sizeof(*y_));
4fd800b3a8 2011-02-23        kinaba: 	int A = ;
4fd800b3a8 2011-02-23        kinaba: 	int T = ;
4fd800b3a8 2011-02-23        kinaba: 	int _ = ;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: */
4fd800b3a8 2011-02-23        kinaba: }
4fd800b3a8 2011-02-23        kinaba: // END CUT HERE