|
| 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 | +int A[55][55]; |
| 37 | +string s; |
| 38 | +bool valid(int i, int j){ |
| 39 | + set<char> S; |
| 40 | + for(int k = i; k <= j; k++) |
| 41 | + if(s[k] != '*') S.insert(s[k]); |
| 42 | + return S.size() <= 1; |
| 43 | +} |
| 44 | + |
| 45 | +class Stamp { |
| 46 | + public: |
| 47 | + int getMinimumCost(string desiredColor, int stampCost, int pushCost) { |
| 48 | + s = desiredColor; |
| 49 | + int mincost = inf, n = desiredColor.size(); |
| 50 | + for(int L = 1; L <= n; L++){ |
| 51 | + fi(55) fj(55) A[i][j] = 0; |
| 52 | + fie(n-L){ |
| 53 | + int j = i+L-1; |
| 54 | + if(valid(i, j)) A[i][j] = 1; |
| 55 | + } |
| 56 | + for(int l = L+1; l <= n; l++) |
| 57 | + for(int i = 0; i <= n-l; i++){ |
| 58 | + int j = i+l-1; |
| 59 | + if(A[i][j]) continue; |
| 60 | + if(valid(i, j)){ |
| 61 | + A[i][j] = (l+L-1)/L; |
| 62 | + continue; |
| 63 | + } |
| 64 | + int minv = inf; |
| 65 | + for(int k = i; k < j; k++){ |
| 66 | + int a = A[i][k], b = A[k+1][j]; |
| 67 | + if(a == 0 || b == 0) continue; |
| 68 | + minv = min(minv, a+b); |
| 69 | + } |
| 70 | + if(minv != inf) A[i][j] = minv; |
| 71 | + } |
| 72 | + int val = A[0][n-1]; |
| 73 | + if(val == 0) continue; |
| 74 | + mincost = min(mincost, stampCost*L + pushCost*val); |
| 75 | + } |
| 76 | + return mincost; |
| 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() { string Arg0 = "RRGGBB"; int Arg1 = 1; int Arg2 = 1; int Arg3 = 5; verify_case(0, Arg3, getMinimumCost(Arg0, Arg1, Arg2)); } |
| 86 | + void test_case_1() { string Arg0 = "R**GB*"; int Arg1 = 1; int Arg2 = 1; int Arg3 = 5; verify_case(1, Arg3, getMinimumCost(Arg0, Arg1, Arg2)); } |
| 87 | + void test_case_2() { string Arg0 = "BRRB"; int Arg1 = 2; int Arg2 = 7; int Arg3 = 30; verify_case(2, Arg3, getMinimumCost(Arg0, Arg1, Arg2)); } |
| 88 | + void test_case_3() { string Arg0 = "R*RR*GG"; int Arg1 = 10; int Arg2 = 58; int Arg3 = 204; verify_case(3, Arg3, getMinimumCost(Arg0, Arg1, Arg2)); } |
| 89 | + void test_case_4() { string Arg0 = "*B**B**B*BB*G*BBB**B**B*"; int Arg1 = 5; int Arg2 = 2; int Arg3 = 33; verify_case(4, Arg3, getMinimumCost(Arg0, Arg1, Arg2)); } |
| 90 | + void test_case_5() { string Arg0 = "*R*RG*G*GR*RGG*G*GGR***RR*GG"; int Arg1 = 7; int Arg2 = 1; int Arg3 = 30; verify_case(5, Arg3, getMinimumCost(Arg0, Arg1, Arg2)); } |
| 91 | + |
| 92 | +// END CUT HERE |
| 93 | + |
| 94 | +}; |
| 95 | + |
| 96 | + // BEGIN CUT HERE |
| 97 | + int main() |
| 98 | + { |
| 99 | + Stamp ___test; |
| 100 | + ___test.run_test(-1); |
| 101 | + } |
| 102 | + // END CUT HERE |
| 103 | + |
0 commit comments