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 CoinsExchange { public: 4fd800b3a8 2011-02-23 kinaba: int countExchanges(int G1, int S1, int B1, int G2, int S2, int B2) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: if( G1 < G2 ) { 4fd800b3a8 2011-02-23 kinaba: int n = G2-G1; 4fd800b3a8 2011-02-23 kinaba: return check2( S1, B1, S2+n*11, B2, n ); // 11*n silver needed 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: if( B1 < B2 ) { 4fd800b3a8 2011-02-23 kinaba: int n = (B2-B1+8)/9; 4fd800b3a8 2011-02-23 kinaba: return check2( G1, S1, G2, S2+n, n ); // n silver needed 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: // need silver 4fd800b3a8 2011-02-23 kinaba: int n = 0; 4fd800b3a8 2011-02-23 kinaba: while( S1<S2 && G1- 1>=G2 ) S1+=9, G1-= 1, n++; 4fd800b3a8 2011-02-23 kinaba: while( S1<S2 && B1-11>=B2 ) S1+=1, B1-=11, n++; 4fd800b3a8 2011-02-23 kinaba: return S1<S2 ? -1 : n; 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: int check2(int S1, int B1, int S2, int B2, int acc) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: if( S1 < S2 ) { 4fd800b3a8 2011-02-23 kinaba: int n = S2-S1; 4fd800b3a8 2011-02-23 kinaba: return B2<=B1-n*11 ? n+acc : -1; 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: if( B1 < B2 ) { 4fd800b3a8 2011-02-23 kinaba: int n = (B2-B1+8)/9; 4fd800b3a8 2011-02-23 kinaba: return S2<=S1-n ? n+acc : -1; 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: return acc; 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(_, CoinsExchange().countExchanges(G1, S1, B1, G2, S2, B2));} 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 G1 = 1; 4fd800b3a8 2011-02-23 kinaba: int S1 = 0; 4fd800b3a8 2011-02-23 kinaba: int B1 = 0; 4fd800b3a8 2011-02-23 kinaba: int G2 = 0; 4fd800b3a8 2011-02-23 kinaba: int S2 = 0; 4fd800b3a8 2011-02-23 kinaba: int B2 = 81; 4fd800b3a8 2011-02-23 kinaba: int _ = 10; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(1) 4fd800b3a8 2011-02-23 kinaba: int G1 = 1; 4fd800b3a8 2011-02-23 kinaba: int S1 = 100; 4fd800b3a8 2011-02-23 kinaba: int B1 = 12; 4fd800b3a8 2011-02-23 kinaba: int G2 = 5; 4fd800b3a8 2011-02-23 kinaba: int S2 = 53; 4fd800b3a8 2011-02-23 kinaba: int B2 = 33; 4fd800b3a8 2011-02-23 kinaba: int _ = 7; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(2) 4fd800b3a8 2011-02-23 kinaba: int G1 = 1; 4fd800b3a8 2011-02-23 kinaba: int S1 = 100; 4fd800b3a8 2011-02-23 kinaba: int B1 = 12; 4fd800b3a8 2011-02-23 kinaba: int G2 = 5; 4fd800b3a8 2011-02-23 kinaba: int S2 = 63; 4fd800b3a8 2011-02-23 kinaba: int B2 = 33; 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 G1 = 5; 4fd800b3a8 2011-02-23 kinaba: int S1 = 10; 4fd800b3a8 2011-02-23 kinaba: int B1 = 12; 4fd800b3a8 2011-02-23 kinaba: int G2 = 3; 4fd800b3a8 2011-02-23 kinaba: int S2 = 7; 4fd800b3a8 2011-02-23 kinaba: int B2 = 9; 4fd800b3a8 2011-02-23 kinaba: int _ = 0; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: // END CUT HERE