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 TheCoffeeTimeDivOne { public:
4fd800b3a8 2011-02-23        kinaba: 	long long find(int ____n, vector <int> tea)
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		sort(tea.begin(), tea.end());
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		LL n = ____n;
4fd800b3a8 2011-02-23        kinaba: 		LL t = n*4 + 47LL*((tea.size()+6)/7) + 47LL*((n-tea.size()+6)/7);
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		for(int tp=tea.size()-1; tp>=0; )
4fd800b3a8 2011-02-23        kinaba: 		{
4fd800b3a8 2011-02-23        kinaba: 			t  += tea[tp]*2;
4fd800b3a8 2011-02-23        kinaba: 			tp -= 7;
4fd800b3a8 2011-02-23        kinaba: 		}
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		if( n > tea.size() )
4fd800b3a8 2011-02-23        kinaba: 		{
4fd800b3a8 2011-02-23        kinaba: 			LL s = (n-tea.size()) % 7;
4fd800b3a8 2011-02-23        kinaba: 			if(s==0) s = 7;
4fd800b3a8 2011-02-23        kinaba: 			for(int tp=0; s<=n; s+=7)
4fd800b3a8 2011-02-23        kinaba: 			{
4fd800b3a8 2011-02-23        kinaba: 				while(tp<tea.size() && tea[tp]<=s)
4fd800b3a8 2011-02-23        kinaba: 					++s, ++tp;
4fd800b3a8 2011-02-23        kinaba: 				t += 2*s;
4fd800b3a8 2011-02-23        kinaba: 			}
4fd800b3a8 2011-02-23        kinaba: 		}
4fd800b3a8 2011-02-23        kinaba: 		return t;
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 long long& Expected, const long long& 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(_, TheCoffeeTimeDivOne().find(n, tea));}
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 n = 2;
4fd800b3a8 2011-02-23        kinaba: 	int tea_[] = {1};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> tea(tea_, tea_+sizeof(tea_)/sizeof(*tea_));
4fd800b3a8 2011-02-23        kinaba: 	long long _ = 108LL;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(1)
4fd800b3a8 2011-02-23        kinaba: 	int n = 2;
4fd800b3a8 2011-02-23        kinaba: 	int tea_[] = {2, 1};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> tea(tea_, tea_+sizeof(tea_)/sizeof(*tea_));
4fd800b3a8 2011-02-23        kinaba: 	long long _ = 59LL;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(2)
4fd800b3a8 2011-02-23        kinaba: 	int n = 15;
4fd800b3a8 2011-02-23        kinaba: 	int tea_[] = {1, 2, 3, 4, 5, 6, 7};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> tea(tea_, tea_+sizeof(tea_)/sizeof(*tea_));
4fd800b3a8 2011-02-23        kinaba: 	long long _ = 261LL;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(3)
4fd800b3a8 2011-02-23        kinaba: 	int n = 47;
4fd800b3a8 2011-02-23        kinaba: 	int tea_[] = {1, 10, 6, 2, 4};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> tea(tea_, tea_+sizeof(tea_)/sizeof(*tea_));
4fd800b3a8 2011-02-23        kinaba: 	long long _ = 891LL;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(4)
4fd800b3a8 2011-02-23        kinaba: 	int n = 44777777;
4fd800b3a8 2011-02-23        kinaba: 	int tea_[] = {1,2,4,8,16,32,64,128,1000,2000,3000,4000,5000,6000,7000,8000,9000};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> tea(tea_, tea_+sizeof(tea_)/sizeof(*tea_));
4fd800b3a8 2011-02-23        kinaba: 	long long _ = -1LL;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: /*
4fd800b3a8 2011-02-23        kinaba: CASE(5)
4fd800b3a8 2011-02-23        kinaba: 	int n = ;
4fd800b3a8 2011-02-23        kinaba: 	int tea_[] = ;
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> tea(tea_, tea_+sizeof(tea_)/sizeof(*tea_));
4fd800b3a8 2011-02-23        kinaba: 	long long _ = LL;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: */
4fd800b3a8 2011-02-23        kinaba: }
4fd800b3a8 2011-02-23        kinaba: // END CUT HERE