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 <limits.h>
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 ColoringRectangle { public:
4fd800b3a8 2011-02-23        kinaba: 	int chooseDisks(int width, int height, vector <int> red, vector <int> blue)
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		vector<double> R;
4fd800b3a8 2011-02-23        kinaba: 		for(int i=0; i<red.size(); ++i) {
4fd800b3a8 2011-02-23        kinaba: 			double r = red[i]/2.0;
4fd800b3a8 2011-02-23        kinaba: 			if( r < height/2 )
4fd800b3a8 2011-02-23        kinaba: 				continue;
4fd800b3a8 2011-02-23        kinaba: 			R.push_back( sqrt(r*r - (height/2.0)*(height/2.0))*2 );
4fd800b3a8 2011-02-23        kinaba: 		}
4fd800b3a8 2011-02-23        kinaba: 		vector<double> B;
4fd800b3a8 2011-02-23        kinaba: 		for(int i=0; i<blue.size(); ++i) {
4fd800b3a8 2011-02-23        kinaba: 			double r = blue[i]/2.0;
4fd800b3a8 2011-02-23        kinaba: 			if( r < height/2 )
4fd800b3a8 2011-02-23        kinaba: 				continue;
4fd800b3a8 2011-02-23        kinaba: 			B.push_back( sqrt(r*r - (height/2.0)*(height/2.0))*2 );
4fd800b3a8 2011-02-23        kinaba: 		}
4fd800b3a8 2011-02-23        kinaba: 		sort(R.rbegin(), R.rend());
4fd800b3a8 2011-02-23        kinaba: 		sort(B.rbegin(), B.rend());
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		int m = f(R, B, width);
4fd800b3a8 2011-02-23        kinaba: 		int n = f(B, R, width);
4fd800b3a8 2011-02-23        kinaba: 		int a = min(m,n);
4fd800b3a8 2011-02-23        kinaba: 		if( a == INT_MAX )
4fd800b3a8 2011-02-23        kinaba: 			return -1;
4fd800b3a8 2011-02-23        kinaba: 		return a;
4fd800b3a8 2011-02-23        kinaba: 	}
4fd800b3a8 2011-02-23        kinaba: 	int f(vector<double>& R, vector<double>& B, double W) {
4fd800b3a8 2011-02-23        kinaba: 		double w = 0;
4fd800b3a8 2011-02-23        kinaba: 		for(int i=0 ;; ++i) {
4fd800b3a8 2011-02-23        kinaba: 			if( i%2 == 0 ) {
4fd800b3a8 2011-02-23        kinaba: 				if( i/2>=R.size() )
4fd800b3a8 2011-02-23        kinaba: 					return INT_MAX;
4fd800b3a8 2011-02-23        kinaba: 				w += R[i/2];
4fd800b3a8 2011-02-23        kinaba: 				if( W <= w )
4fd800b3a8 2011-02-23        kinaba: 					return i+1;
4fd800b3a8 2011-02-23        kinaba: 			} else {
4fd800b3a8 2011-02-23        kinaba: 				if( i/2>=B.size() )
4fd800b3a8 2011-02-23        kinaba: 					return INT_MAX;
4fd800b3a8 2011-02-23        kinaba: 				w += B[i/2];
4fd800b3a8 2011-02-23        kinaba: 				if( W <= w )
4fd800b3a8 2011-02-23        kinaba: 					return i+1;
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: // 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(_, ColoringRectangle().chooseDisks(width, height, red, blue));}
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 width = 11;
4fd800b3a8 2011-02-23        kinaba: 	int height = 3;
4fd800b3a8 2011-02-23        kinaba: 	int red_[] = {5,5};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> red(red_, red_+sizeof(red_)/sizeof(*red_));
4fd800b3a8 2011-02-23        kinaba: 	int blue_[] = {2,5};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> blue(blue_, blue_+sizeof(blue_)/sizeof(*blue_));
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: 	int width = 30;
4fd800b3a8 2011-02-23        kinaba: 	int height = 5;
4fd800b3a8 2011-02-23        kinaba: 	int red_[] = {4,10,7,8,10};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> red(red_, red_+sizeof(red_)/sizeof(*red_));
4fd800b3a8 2011-02-23        kinaba: 	int blue_[] = {5,6,11,7,5};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> blue(blue_, blue_+sizeof(blue_)/sizeof(*blue_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 4;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(2)
4fd800b3a8 2011-02-23        kinaba: 	int width = 16;
4fd800b3a8 2011-02-23        kinaba: 	int height = 4;
4fd800b3a8 2011-02-23        kinaba: 	int red_[] = {6,5,7};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> red(red_, red_+sizeof(red_)/sizeof(*red_));
4fd800b3a8 2011-02-23        kinaba: 	int blue_[] = {5};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> blue(blue_, blue_+sizeof(blue_)/sizeof(*blue_));
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: 	int width = 4;
4fd800b3a8 2011-02-23        kinaba: 	int height = 4;
4fd800b3a8 2011-02-23        kinaba: 	int red_[] = {5};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> red(red_, red_+sizeof(red_)/sizeof(*red_));
4fd800b3a8 2011-02-23        kinaba: 	int blue_[] = {6};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> blue(blue_, blue_+sizeof(blue_)/sizeof(*blue_));
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: 	int width = 6;
4fd800b3a8 2011-02-23        kinaba: 	int height = 2;
4fd800b3a8 2011-02-23        kinaba: 	int red_[] = {6,6};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> red(red_, red_+sizeof(red_)/sizeof(*red_));
4fd800b3a8 2011-02-23        kinaba: 	int blue_[] = {2};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> blue(blue_, blue_+sizeof(blue_)/sizeof(*blue_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 3;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(5)
4fd800b3a8 2011-02-23        kinaba: 	int width = 16;
4fd800b3a8 2011-02-23        kinaba: 	int height = 13;
4fd800b3a8 2011-02-23        kinaba: 	int red_[] = {20};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> red(red_, red_+sizeof(red_)/sizeof(*red_));
4fd800b3a8 2011-02-23        kinaba: 	int blue_[] = {20};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> blue(blue_, blue_+sizeof(blue_)/sizeof(*blue_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = -1;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: /*
4fd800b3a8 2011-02-23        kinaba: CASE(6)
4fd800b3a8 2011-02-23        kinaba: 	int width = ;
4fd800b3a8 2011-02-23        kinaba: 	int height = ;
4fd800b3a8 2011-02-23        kinaba: 	int red_[] = ;
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> red(red_, red_+sizeof(red_)/sizeof(*red_));
4fd800b3a8 2011-02-23        kinaba: 	int blue_[] = ;
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> blue(blue_, blue_+sizeof(blue_)/sizeof(*blue_));
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