|
| 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 | +#include <numeric> |
| 12 | +using namespace std; |
| 13 | +typedef pair<int,int> pi; |
| 14 | +typedef set<int> si; |
| 15 | +typedef vector<int> vi; |
| 16 | +typedef vector<vi> vvi; |
| 17 | +typedef vector<string> vs; |
| 18 | +typedef long long ll; |
| 19 | +#define sz size() |
| 20 | +#define mp make_pair |
| 21 | +#define pb push_back |
| 22 | +#define inf 1000000000 |
| 23 | +#define ri(a, b) for(int i=((int)(a)); i < ((int)(b)); i++) // i -> [a, b) |
| 24 | +#define rie(a, b) for(int i=((int)(a)); i <= ((int)(b)); i++) // i -> [a, b] |
| 25 | +#define rj(a, b) for(int j=((int)(a)); j < ((int)(b)); j++) // j -> [a, b) |
| 26 | +#define rje(a, b) for(int j=((int)(a)); j <= ((int)(b)); j++) // j -> [a, b] |
| 27 | +#define rk(a, b) for(int k=((int)(a)); k < ((int)(b)); k++) // k -> [a, b) |
| 28 | +#define rke(a, b) for(int k=((int)(a)); k <= ((int)(b)); k++) // k -> [a, b] |
| 29 | +#define fi(b) for(int i=0; i < ((int)(b)); i++) // i -> [0, b) |
| 30 | +#define fie(b) for(int i=0; i <= ((int)(b)); i++) // i -> [0, b] |
| 31 | +#define fj(b) for(int j=0; j < ((int)(b)); j++) // j -> [0, b) |
| 32 | +#define fje(b) for(int j=0; j <= ((int)(b)); j++) // j -> [0, b] |
| 33 | +#define fk(b) for(int k=0; k < ((int)(b)); k++) // k -> [0, b) |
| 34 | +#define fke(b) for(int k=0; k < ((int)(b)); k++) // k -> [0, b] |
| 35 | +#define fle(b) for(int l=0; l <= ((int)(b)); l++) // l -> [0, b] |
| 36 | + |
| 37 | +class ICPCBalloons { |
| 38 | + public: |
| 39 | + int cal(vi s, vi v){ |
| 40 | + sort(s.rbegin(), s.rend()); |
| 41 | + sort(v.rbegin(), v.rend()); |
| 42 | + int n = s.size(), m = v.size(); |
| 43 | + int total = accumulate(v.begin(), v.end(), 0), bal = accumulate(s.begin(), s.end(), 0), due = 0; |
| 44 | + if(bal < total) return inf; |
| 45 | + fi(min(m, n)){ |
| 46 | + if(s[i] >= v[i]){ |
| 47 | + bal -= v[i]; |
| 48 | + } |
| 49 | + else { |
| 50 | + bal -= s[i]; |
| 51 | + due += v[i] - s[i]; |
| 52 | + } |
| 53 | + } |
| 54 | + if(n < m){ |
| 55 | + ri(n, m) due += v[i]; |
| 56 | + } |
| 57 | + if(bal < due) return inf; |
| 58 | + return due; |
| 59 | + } |
| 60 | + int minRepaintings(vector <int> balloonCount, string balloonSize, vector <int> maxAccepted) { |
| 61 | + vi M, L; |
| 62 | + int n = balloonCount.size(), m = maxAccepted.size(); |
| 63 | + fi(n){ |
| 64 | + if(balloonSize[i] == 'M') M.pb(balloonCount[i]); |
| 65 | + else L.pb(balloonCount[i]); |
| 66 | + } |
| 67 | + int ret = inf; |
| 68 | + fi(1<<m){ |
| 69 | + vi a, b; |
| 70 | + fj(m){ |
| 71 | + if(i&(1<<j)) a.pb(maxAccepted[j]); |
| 72 | + else b.pb(maxAccepted[j]); |
| 73 | + } |
| 74 | + ret = min(ret, cal(M, a)+cal(L, b)); |
| 75 | + } |
| 76 | + return ret < inf ? ret : -1; |
| 77 | + } |
| 78 | + |
| 79 | +// BEGIN CUT HERE |
| 80 | + public: |
| 81 | + 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(); if ((Case == -1) || (Case == 5)) test_case_5(); } |
| 82 | + private: |
| 83 | + 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(); } |
| 84 | + 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; } } |
| 85 | + void test_case_0() { int Arr0[] = {100}; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); string Arg1 = "L"; int Arr2[] = {1,2,3,4,5}; vector <int> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0]))); int Arg3 = 10; verify_case(0, Arg3, minRepaintings(Arg0, Arg1, Arg2)); } |
| 86 | + void test_case_1() { int Arr0[] = {100}; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); string Arg1 = "M"; int Arr2[] = {10,20,30,40,50}; vector <int> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0]))); int Arg3 = -1; verify_case(1, Arg3, minRepaintings(Arg0, Arg1, Arg2)); } |
| 87 | + void test_case_2() { int Arr0[] = {5,6,1,5,6,1,5,6,1}; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); string Arg1 = "MLMMLMMLM"; int Arr2[] = {7,7,4,4,7,7}; vector <int> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0]))); int Arg3 = 6; verify_case(2, Arg3, minRepaintings(Arg0, Arg1, Arg2)); } |
| 88 | + void test_case_3() { int Arr0[] = {100,100}; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); string Arg1 = "ML"; int Arr2[] = {50,51,51}; vector <int> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0]))); int Arg3 = -1; verify_case(3, Arg3, minRepaintings(Arg0, Arg1, Arg2)); } |
| 89 | + void test_case_4() { int Arr0[] = {8,5,1,4,1,1,3,1,3,3,5,4,5,6,9}; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); string Arg1 = "MMMLLLMMLLMLMLM"; int Arr2[] = {3,5,3,3,5,6,4,6,4,2,3,7,1,5,2}; vector <int> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0]))); int Arg3 = 5; verify_case(4, Arg3, minRepaintings(Arg0, Arg1, Arg2)); } |
| 90 | + void test_case_5() { int Arr0[] = {1,18,4,7,19,7,7,1,4,8,10,5,14,13,8,22,6,3,13,5,3,4,2,1,3,15,19,4,5,9,4,11,2,7,12,20,11,26,22,7,2,10,9,20,13,20,2,9,11,9}; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); string Arg1 = "LLMLLLLMLLLLLLLLLLLLMLLLLLLLLLLMMLMLLLMLLLLLLLLMLL"; int Arr2[] = {44,59,29,53,16,23,13,14,29,42,13,15,66,4,47}; vector <int> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0]))); int Arg3 = 210; verify_case(5, Arg3, minRepaintings(Arg0, Arg1, Arg2)); } |
| 91 | + |
| 92 | +// END CUT HERE |
| 93 | + |
| 94 | +}; |
| 95 | + |
| 96 | + // BEGIN CUT HERE |
| 97 | + int main() |
| 98 | + { |
| 99 | + ICPCBalloons ___test; |
| 100 | + ___test.run_test(-1); |
| 101 | + } |
| 102 | + // END CUT HERE |
| 103 | + |
0 commit comments