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 FibonacciKnapsack { public: 4fd800b3a8 2011-02-23 kinaba: long long maximalCost(vector <string> items, string C_) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: LL C; 4fd800b3a8 2011-02-23 kinaba: stringstream(C_) >> C; 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: vector< pair<LL,LL> > wp; 4fd800b3a8 2011-02-23 kinaba: for(int i=0; i<items.size(); ++i) { 4fd800b3a8 2011-02-23 kinaba: LL W, P; 4fd800b3a8 2011-02-23 kinaba: stringstream(items[i]) >> W >> P; 4fd800b3a8 2011-02-23 kinaba: wp.push_back( make_pair(W,P) ); 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: sort( wp.begin(), wp.end() ); 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: LL lW = 0, lP = 0; 4fd800b3a8 2011-02-23 kinaba: for(int i=0; i<wp.size(); ++i) 4fd800b3a8 2011-02-23 kinaba: lW += wp[i].first, lP += wp[i].second; 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: best = 0; 4fd800b3a8 2011-02-23 kinaba: rec( lW, lP, wp, wp.size()-1, C, 0 ); 4fd800b3a8 2011-02-23 kinaba: return best; 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: LL best; 4fd800b3a8 2011-02-23 kinaba: void rec( LL lW, LL lP, vector< pair<LL,LL> >& wp, int i, LL w, LL cP ) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: if( lW <= w ) 4fd800b3a8 2011-02-23 kinaba: best = max(best, lP+cP); 4fd800b3a8 2011-02-23 kinaba: if( lP+cP <= best ) 4fd800b3a8 2011-02-23 kinaba: return; 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: for(int k=i; k>=0 && wp[k].first==wp[i].first; --k) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: lW -= wp[k].first; 4fd800b3a8 2011-02-23 kinaba: lP -= wp[k].second; 4fd800b3a8 2011-02-23 kinaba: if( w >= 0 ) 4fd800b3a8 2011-02-23 kinaba: rec(lW, lP, wp, k-1, w, cP); 4fd800b3a8 2011-02-23 kinaba: w -= wp[k].first; 4fd800b3a8 2011-02-23 kinaba: cP += wp[k].second; 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 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(_, FibonacciKnapsack().maximalCost(items, C));} 4fd800b3a8 2011-02-23 kinaba: int main(){ 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: CASE(0) 4fd800b3a8 2011-02-23 kinaba: string items_[] = {"5 555", "8 195", "13 651"}; 4fd800b3a8 2011-02-23 kinaba: vector <string> items(items_, items_+sizeof(items_)/sizeof(*items_)); 4fd800b3a8 2011-02-23 kinaba: string C = "15"; 4fd800b3a8 2011-02-23 kinaba: long long _ = 750LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(1) 4fd800b3a8 2011-02-23 kinaba: string items_[] = {"5 555", "8 195", "13 751"}; 4fd800b3a8 2011-02-23 kinaba: vector <string> items(items_, items_+sizeof(items_)/sizeof(*items_)); 4fd800b3a8 2011-02-23 kinaba: string C = "15"; 4fd800b3a8 2011-02-23 kinaba: long long _ = 751LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(2) 4fd800b3a8 2011-02-23 kinaba: string items_[] = {"55 1562", "5 814", "55 1962", "8 996", "2 716", "34 1792"}; 4fd800b3a8 2011-02-23 kinaba: vector <string> items(items_, items_+sizeof(items_)/sizeof(*items_)); 4fd800b3a8 2011-02-23 kinaba: string C = "94"; 4fd800b3a8 2011-02-23 kinaba: long long _ = 4568LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(3) 4fd800b3a8 2011-02-23 kinaba: string items_[] = {"13 89"}; 4fd800b3a8 2011-02-23 kinaba: vector <string> items(items_, items_+sizeof(items_)/sizeof(*items_)); 4fd800b3a8 2011-02-23 kinaba: string C = "1"; 4fd800b3a8 2011-02-23 kinaba: long long _ = 0LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(4) 4fd800b3a8 2011-02-23 kinaba: string items_[] = {"27777890035288 9419696870097445", 4fd800b3a8 2011-02-23 kinaba: "53316291173 6312623457097563", 4fd800b3a8 2011-02-23 kinaba: "165580141 8848283653257131"}; 4fd800b3a8 2011-02-23 kinaba: vector <string> items(items_, items_+sizeof(items_)/sizeof(*items_)); 4fd800b3a8 2011-02-23 kinaba: string C = "27777900000000"; 4fd800b3a8 2011-02-23 kinaba: long long _ = 15160907110354694LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(5) 4fd800b3a8 2011-02-23 kinaba: string items_[] = {"89 90", "55 54", "55 54", "34 35", "34 35", "34 35", "34 35", "21 23", "21 23", "21 23", "21 23", "21 23", "21 23", "21 23", "21 23", "13 14", "13 14", "13 14", "13 14", "13 14", "13 14", "13 14", "13 14", "13 14", "13 14", "13 14", "13 14", "13 14", "13 14", "13 14", "13 14", "8 10", "8 10", "8 10", "8 10", "8 10", "8 10", "8 10", "8 10", "8 10", "8 10", "8 10", "8 10", "8 10", "8 10", "8 10", "8 10", "8 10", "8 10", "8 10"}; 4fd800b3a8 2011-02-23 kinaba: vector <string> items(items_, items_+sizeof(items_)/sizeof(*items_)); 4fd800b3a8 2011-02-23 kinaba: string C = "200"; 4fd800b3a8 2011-02-23 kinaba: long long _ = 241LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: // END CUT HERE