|
| 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 | +#define inf 1000000000 |
| 18 | +int D[20]; |
| 19 | +int M[20][20]; |
| 20 | +int n; |
| 21 | + |
| 22 | +struct node{ |
| 23 | + |
| 24 | + int state; |
| 25 | + int cost; |
| 26 | + node(int s, int c) : state(s), cost(c) {} |
| 27 | +}; |
| 28 | + |
| 29 | +bool operator<(node a, node b){ |
| 30 | + return a.cost > b.cost; |
| 31 | +} |
| 32 | + |
| 33 | +class KiloManX { |
| 34 | + public: |
| 35 | + |
| 36 | + int leastShots(vs damageChart, vi bossHealth) |
| 37 | + { |
| 38 | + map<int, int> H; |
| 39 | + n = bossHealth.size(); |
| 40 | + for(int i = 0; i <= n; i++) |
| 41 | + for(int j = 0; j <= n; j++) |
| 42 | + M[i][j] = inf; |
| 43 | + for(int i = 1; i <= n; i++) M[0][i] = bossHealth[i-1]; |
| 44 | + for(int i = 1; i <= n; i++) |
| 45 | + for(int j = 1; j <= n; j++){ |
| 46 | + int k = damageChart[i-1][j-1] - '0'; |
| 47 | + if(k) M[i][j] = (bossHealth[j-1] + k - 1)/k; |
| 48 | + } |
| 49 | + priority_queue<node> Q; |
| 50 | + for(int i = 1; i <= n; i++){ |
| 51 | + H[(1<<i)+1] = M[0][i]; |
| 52 | + Q.push(node((1<<i)+1, M[0][i])); |
| 53 | + } |
| 54 | + while(!Q.empty()){ |
| 55 | + node p = Q.top(); |
| 56 | + Q.pop(); |
| 57 | + int s = p.state, c = p.cost, m = inf; |
| 58 | + if(s == (1<<(n+1))-1) return c; |
| 59 | + for(int i = 0; i <= n; i++) |
| 60 | + for(int j = 1; j <= n; j++) |
| 61 | + if(s&(1<<i) && !(s&(1<<j)) && M[i][j] < inf){ |
| 62 | + |
| 63 | + m = M[i][j]; |
| 64 | + int t = (s|(1<<j)); |
| 65 | + if(H.count(t) == 0 || H[t] > c+m){ |
| 66 | + H[t] = c+m; |
| 67 | + //cout<<"node <"<<i<<","<<j<<"> with value "<<m<<" pushed into queue at value "<<c<<endl; |
| 68 | + Q.push(node(t, c+m)); |
| 69 | + } |
| 70 | + } |
| 71 | + } |
| 72 | + } |
| 73 | + |
| 74 | +// BEGIN CUT HERE |
| 75 | + public: |
| 76 | + 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(); } |
| 77 | + private: |
| 78 | + 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(); } |
| 79 | + 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; } } |
| 80 | + void test_case_0() { string Arr0[] = {"070","500","140"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arr1[] = {150,150,150}; vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); int Arg2 = 218; verify_case(0, Arg2, leastShots(Arg0, Arg1)); } |
| 81 | + void test_case_1() { string Arr0[] = {"1542", "7935", "1139", "8882"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arr1[] = {150,150,150,150}; vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); int Arg2 = 205; verify_case(1, Arg2, leastShots(Arg0, Arg1)); } |
| 82 | + void test_case_2() { string Arr0[] = {"07", "40"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arr1[] = {150,10}; vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); int Arg2 = 48; verify_case(2, Arg2, leastShots(Arg0, Arg1)); } |
| 83 | + void test_case_3() { string Arr0[] = {"198573618294842", |
| 84 | + "159819849819205", |
| 85 | + "698849290010992", |
| 86 | + "000000000000000", |
| 87 | + "139581938009384", |
| 88 | + "158919111891911", |
| 89 | + "182731827381787", |
| 90 | + "135788359198718", |
| 91 | + "187587819218927", |
| 92 | + "185783759199192", |
| 93 | + "857819038188122", |
| 94 | + "897387187472737", |
| 95 | + "159938981818247", |
| 96 | + "128974182773177", |
| 97 | + "135885818282838"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arr1[] = {157, 1984, 577, 3001, 2003, 2984, 5988, 190003, |
| 98 | +9000, 102930, 5938, 1000000, 1000000, 5892, 38}; vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); int Arg2 = 260445; verify_case(3, Arg2, leastShots(Arg0, Arg1)); } |
| 99 | + void test_case_4() { string Arr0[] = {"02111111", "10711111", "11071111", "11104111", |
| 100 | + "41110111", "11111031", "11111107", "11111210"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arr1[] = {28,28,28,28,28,28,28,28}; vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); int Arg2 = 92; verify_case(4, Arg2, leastShots(Arg0, Arg1)); } |
| 101 | + |
| 102 | +// END CUT HERE |
| 103 | + |
| 104 | + }; |
| 105 | + |
| 106 | +// BEGIN CUT HERE |
| 107 | +int main(){ |
| 108 | + |
| 109 | + KiloManX ___test; |
| 110 | + ___test.run_test(-1); |
| 111 | + |
| 112 | +} |
| 113 | +// END CUT HERE |
0 commit comments