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: double outer_prod(const CMP& a, const CMP& b) { return imag(conj(a)*b); }
4fd800b3a8 2011-02-23        kinaba: double inner_prod(const CMP& a, const CMP& b) { return real(conj(a)*b); }
4fd800b3a8 2011-02-23        kinaba: int ccw(const CMP& a, CMP b, CMP c) {
4fd800b3a8 2011-02-23        kinaba: 	b -= a; c -= a;
4fd800b3a8 2011-02-23        kinaba: 	if( outer_prod(b,c) > 0 ) return +1; // counter clockwise
4fd800b3a8 2011-02-23        kinaba: 	if( outer_prod(b,c) < 0 ) return -1; // clockwise
4fd800b3a8 2011-02-23        kinaba: 	if( inner_prod(b,c) < 0 ) return +2; // c--[a--b] on line
4fd800b3a8 2011-02-23        kinaba: 	if( norm(b) < norm(c) )   return -2; // [a--b]--c on line
4fd800b3a8 2011-02-23        kinaba: 	return 0; // [a--c--b] on line
4fd800b3a8 2011-02-23        kinaba: }
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: class TimeTravellingGardener { public:
4fd800b3a8 2011-02-23        kinaba: 	int determineUsage(vector <int> distance, vector <int> height)
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		const int N = height.size();
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		distance.insert(distance.begin(), 0);
4fd800b3a8 2011-02-23        kinaba: 		partial_sum(distance.begin(), distance.end(), distance.begin());
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		vector<CMP> p;
4fd800b3a8 2011-02-23        kinaba: 		for(int i=0; i<N; ++i)
4fd800b3a8 2011-02-23        kinaba: 			p.push_back( CMP(distance[i], height[i]) );
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		int best = N-1;
4fd800b3a8 2011-02-23        kinaba: 		for(int i=0; i<N; ++i)
4fd800b3a8 2011-02-23        kinaba: 			for(int j=i+1; j<N; ++j)
4fd800b3a8 2011-02-23        kinaba: 			{
4fd800b3a8 2011-02-23        kinaba: 				best = min(best, score(p[i], p[j], p));
4fd800b3a8 2011-02-23        kinaba: 				best = min(best, score(p[i].real(), p[j], p));
4fd800b3a8 2011-02-23        kinaba: 				best = min(best, score(p[i], p[j].real(), p));
4fd800b3a8 2011-02-23        kinaba: 			}
4fd800b3a8 2011-02-23        kinaba: 		return best;
4fd800b3a8 2011-02-23        kinaba: 	}
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 	int score(const CMP& a, const CMP& b, const vector<CMP>& p)
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		int s = 0;
4fd800b3a8 2011-02-23        kinaba: 		for(int i=0; i<p.size(); ++i)
4fd800b3a8 2011-02-23        kinaba: 		{
4fd800b3a8 2011-02-23        kinaba: 			if( ccw(a, b, p[i]) == -1 ) return INT_MAX;
4fd800b3a8 2011-02-23        kinaba: 			if( ccw(a, b, p[i].real()) == +1 ) return INT_MAX;
4fd800b3a8 2011-02-23        kinaba: 			if( ccw(a, b, p[i]) == +1 ) ++s;
4fd800b3a8 2011-02-23        kinaba: 		}
4fd800b3a8 2011-02-23        kinaba: 		return s;
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(_, TimeTravellingGardener().determineUsage(distance, height));}
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 distance_[] = {2,2};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> distance(distance_, distance_+sizeof(distance_)/sizeof(*distance_));
4fd800b3a8 2011-02-23        kinaba: 	int height_[] = {1,3,10};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> height(height_, height_+sizeof(height_)/sizeof(*height_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 1;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(1)
4fd800b3a8 2011-02-23        kinaba: 	int distance_[] = {3,3};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> distance(distance_, distance_+sizeof(distance_)/sizeof(*distance_));
4fd800b3a8 2011-02-23        kinaba: 	int height_[] = {3,1,3};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> height(height_, height_+sizeof(height_)/sizeof(*height_));
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 distance_[] = {1,3};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> distance(distance_, distance_+sizeof(distance_)/sizeof(*distance_));
4fd800b3a8 2011-02-23        kinaba: 	int height_[] = {4,4,4};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> height(height_, height_+sizeof(height_)/sizeof(*height_));
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 distance_[] = {4,2};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> distance(distance_, distance_+sizeof(distance_)/sizeof(*distance_));
4fd800b3a8 2011-02-23        kinaba: 	int height_[] = {9,8,5};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> height(height_, height_+sizeof(height_)/sizeof(*height_));
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 distance_[] = {476,465,260,484};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> distance(distance_, distance_+sizeof(distance_)/sizeof(*distance_));
4fd800b3a8 2011-02-23        kinaba: 	int height_[] = {39,13,8,72,80};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> height(height_, height_+sizeof(height_)/sizeof(*height_));
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 distance_[] = {173,36,668,79,26,544};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> distance(distance_, distance_+sizeof(distance_)/sizeof(*distance_));
4fd800b3a8 2011-02-23        kinaba: 	int height_[] = {488,743,203,446,444,91,453};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> height(height_, height_+sizeof(height_)/sizeof(*height_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 5;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(6)
4fd800b3a8 2011-02-23        kinaba: 	int distance_[] = {2,4,2,2,4,2,4,2,2,4};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> distance(distance_, distance_+sizeof(distance_)/sizeof(*distance_));
4fd800b3a8 2011-02-23        kinaba: 	int height_[] = {2,2,10,10,10,16,16,22,22,28,28};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> height(height_, height_+sizeof(height_)/sizeof(*height_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 6;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: }
4fd800b3a8 2011-02-23        kinaba: // END CUT HERE