|
| 1 | +#include <iostream> |
| 2 | +#include <sstream> |
| 3 | +#include <vector> |
| 4 | +#include <algorithm> |
| 5 | +#include <set> |
| 6 | +#include <map> |
| 7 | +#include <queue> |
| 8 | +#include <cstring> |
| 9 | +#include <climits> |
| 10 | +#include <cstdio> |
| 11 | +using namespace std; |
| 12 | +typedef pair<int,int> pi; |
| 13 | +typedef vector<int> vi; |
| 14 | +typedef vector<vi> vvi; |
| 15 | +typedef vector<string> vs; |
| 16 | +typedef vector<vs> vvs; |
| 17 | + |
| 18 | +class GroceryBagger{ |
| 19 | + public: |
| 20 | + int minimumBags(int strength, vector <string> itemType) { |
| 21 | + map<string, int> M; |
| 22 | + for(string s : itemType) M[s]++; |
| 23 | + int ret = 0; |
| 24 | + for(pair<string, int> p : M) ret += (p.second+strength-1)/strength; |
| 25 | + return ret; |
| 26 | + } |
| 27 | + |
| 28 | +// BEGIN CUT HERE |
| 29 | + public: |
| 30 | + void run_test(int Case) { if ((Case == -1) || (Case == 0)) test_case_0(); if ((Case == -1) || (Case == 1)) test_case_1(); if ((Case == -1) || (Case == 2)) test_case_2(); if ((Case == -1) || (Case == 3)) test_case_3(); if ((Case == -1) || (Case == 4)) test_case_4(); } |
| 31 | + private: |
| 32 | + template <typename T> string print_array(const vector<T> &V) { ostringstream os; os << "{ "; for (typename vector<T>::const_iterator iter = V.begin(); iter != V.end(); ++iter) os << '\"' << *iter << "\","; os << " }"; return os.str(); } |
| 33 | + void verify_case(int Case, const int &Expected, const int &Received) { cerr << "Test Case #" << Case << "..."; if (Expected == Received) cerr << "PASSED" << endl; else { cerr << "FAILED" << endl; cerr << "\tExpected: \"" << Expected << '\"' << endl; cerr << "\tReceived: \"" << Received << '\"' << endl; } } |
| 34 | + void test_case_0() { int Arg0 = 2; string Arr1[] = {"DAIRY", |
| 35 | + "DAIRY", |
| 36 | + "PRODUCE", |
| 37 | + "PRODUCE", |
| 38 | + "PRODUCE", |
| 39 | + "MEAT"}; vector <string> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); int Arg2 = 4; verify_case(0, Arg2, minimumBags(Arg0, Arg1)); } |
| 40 | + void test_case_1() { int Arg0 = 3; string Arr1[] = {"DAIRY", |
| 41 | + "DAIRY", |
| 42 | + "PRODUCE", |
| 43 | + "PRODUCE", |
| 44 | + "PRODUCE", |
| 45 | + "MEAT"}; vector <string> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); int Arg2 = 3; verify_case(1, Arg2, minimumBags(Arg0, Arg1)); } |
| 46 | + void test_case_2() { int Arg0 = 10; string Arr1[] = {}; vector <string> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); int Arg2 = 0; verify_case(2, Arg2, minimumBags(Arg0, Arg1)); } |
| 47 | + void test_case_3() { int Arg0 = 5; string Arr1[] = {"CANNED", "CANNED", "PRODUCE", |
| 48 | + "DAIRY", "MEAT", "BREAD", |
| 49 | + "HOUSEHOLD","PRODUCE", "FROZEN", |
| 50 | + "PRODUCE", "DAIRY"}; vector <string> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); int Arg2 = 7; verify_case(3, Arg2, minimumBags(Arg0, Arg1)); } |
| 51 | + void test_case_4() { int Arg0 = 2; string Arr1[] = {"CANNED", "CANNED", "PRODUCE", |
| 52 | + "DAIRY", "MEAT", "BREAD", |
| 53 | + "HOUSEHOLD","PRODUCE", "FROZEN", |
| 54 | + "PRODUCE", "DAIRY"}; vector <string> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); int Arg2 = 8; verify_case(4, Arg2, minimumBags(Arg0, Arg1)); } |
| 55 | + |
| 56 | +// END CUT HERE |
| 57 | + |
| 58 | +}; |
| 59 | + |
| 60 | +// BEGIN CUT HERE |
| 61 | +int main(){ |
| 62 | + |
| 63 | + GroceryBagger ___test; |
| 64 | + ___test.run_test(-1); |
| 65 | +} |
| 66 | +// END CUT HERE |
0 commit comments