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 LateProfessor { public:
4fd800b3a8 2011-02-23        kinaba: 	double getProbability(int waitTime, int walkTime, int lateTime, int bestArrival, int worstArrival)
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		if( worstArrival - bestArrival == 0 )
4fd800b3a8 2011-02-23        kinaba: 		{
4fd800b3a8 2011-02-23        kinaba: 			int t = bestArrival % (waitTime+walkTime);
4fd800b3a8 2011-02-23        kinaba: 			if( t<=waitTime )
4fd800b3a8 2011-02-23        kinaba: 				return 0;
4fd800b3a8 2011-02-23        kinaba: 			if( t+lateTime <= waitTime+walkTime )
4fd800b3a8 2011-02-23        kinaba: 				return 1;
4fd800b3a8 2011-02-23        kinaba: 			return 0;
4fd800b3a8 2011-02-23        kinaba: 		}
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		if( walkTime <= lateTime )
4fd800b3a8 2011-02-23        kinaba: 			return 0;
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		int bad = 0;
4fd800b3a8 2011-02-23        kinaba: 		for(int t=0; t<=worstArrival; t+=waitTime+walkTime)
4fd800b3a8 2011-02-23        kinaba: 		{
4fd800b3a8 2011-02-23        kinaba: 			int tb = max(bestArrival, t+waitTime);
4fd800b3a8 2011-02-23        kinaba: 			int te = min(worstArrival, t+waitTime+walkTime-lateTime);
4fd800b3a8 2011-02-23        kinaba: 			if( tb < te )
4fd800b3a8 2011-02-23        kinaba: 				bad += te - tb;
4fd800b3a8 2011-02-23        kinaba: 		}
4fd800b3a8 2011-02-23        kinaba: 		return double(bad) / (worstArrival - bestArrival);
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 double& Expected, const double& Received) {
4fd800b3a8 2011-02-23        kinaba:  bool ok = (abs(Expected - Received) < 1e-9);
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(_, LateProfessor().getProbability(waitTime, walkTime, lateTime, bestArrival, worstArrival));}
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 waitTime = 20;
4fd800b3a8 2011-02-23        kinaba: 	int walkTime = 30;
4fd800b3a8 2011-02-23        kinaba: 	int lateTime = 10;
4fd800b3a8 2011-02-23        kinaba: 	int bestArrival = 0;
4fd800b3a8 2011-02-23        kinaba: 	int worstArrival = 50;
4fd800b3a8 2011-02-23        kinaba: 	double _ = 0.4;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(1)
4fd800b3a8 2011-02-23        kinaba: 	int waitTime = 20;
4fd800b3a8 2011-02-23        kinaba: 	int walkTime = 30;
4fd800b3a8 2011-02-23        kinaba: 	int lateTime = 10;
4fd800b3a8 2011-02-23        kinaba: 	int bestArrival = 30;
4fd800b3a8 2011-02-23        kinaba: 	int worstArrival = 100;
4fd800b3a8 2011-02-23        kinaba: 	double _ = 0.42857142857142855;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(2)
4fd800b3a8 2011-02-23        kinaba: 	int waitTime = 20;
4fd800b3a8 2011-02-23        kinaba: 	int walkTime = 40;
4fd800b3a8 2011-02-23        kinaba: 	int lateTime = 50;
4fd800b3a8 2011-02-23        kinaba: 	int bestArrival = 0;
4fd800b3a8 2011-02-23        kinaba: 	int worstArrival = 300;
4fd800b3a8 2011-02-23        kinaba: 	double _ = 0.0;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(3)
4fd800b3a8 2011-02-23        kinaba: 	int waitTime = 101;
4fd800b3a8 2011-02-23        kinaba: 	int walkTime = 230;
4fd800b3a8 2011-02-23        kinaba: 	int lateTime = 10;
4fd800b3a8 2011-02-23        kinaba: 	int bestArrival = 654;
4fd800b3a8 2011-02-23        kinaba: 	int worstArrival = 17890;
4fd800b3a8 2011-02-23        kinaba: 	double _ = 0.6637270828498492;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(4)
4fd800b3a8 2011-02-23        kinaba: 	int waitTime = 20;
4fd800b3a8 2011-02-23        kinaba: 	int walkTime = 30;
4fd800b3a8 2011-02-23        kinaba: 	int lateTime = 10;
4fd800b3a8 2011-02-23        kinaba: 	int bestArrival = 90;
4fd800b3a8 2011-02-23        kinaba: 	int worstArrival = 90;
4fd800b3a8 2011-02-23        kinaba: 	double _ = 1.0;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(5)
4fd800b3a8 2011-02-23        kinaba: 	int waitTime = 1000;
4fd800b3a8 2011-02-23        kinaba: 	int walkTime = 600;
4fd800b3a8 2011-02-23        kinaba: 	int lateTime = 1;
4fd800b3a8 2011-02-23        kinaba: 	int bestArrival = 17000;
4fd800b3a8 2011-02-23        kinaba: 	int worstArrival = 17000;
4fd800b3a8 2011-02-23        kinaba: 	double _ = 0.0;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(6)
4fd800b3a8 2011-02-23        kinaba: 	int waitTime = 1;
4fd800b3a8 2011-02-23        kinaba: 	int walkTime = 2;
4fd800b3a8 2011-02-23        kinaba: 	int lateTime = 1;
4fd800b3a8 2011-02-23        kinaba: 	int bestArrival = 2;
4fd800b3a8 2011-02-23        kinaba: 	int worstArrival = 2;
4fd800b3a8 2011-02-23        kinaba: 	double _ = -1;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(7)
4fd800b3a8 2011-02-23        kinaba: 	int waitTime = 1000;
4fd800b3a8 2011-02-23        kinaba: 	int walkTime = 1000;
4fd800b3a8 2011-02-23        kinaba: 	int lateTime = 1000;
4fd800b3a8 2011-02-23        kinaba: 	int bestArrival = 0;
4fd800b3a8 2011-02-23        kinaba: 	int worstArrival = 10000000;
4fd800b3a8 2011-02-23        kinaba: 	double _ = -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