|
| 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 set<int> si; |
| 14 | +typedef vector<int> vi; |
| 15 | +typedef vector<vi> vvi; |
| 16 | +typedef vector<string> vs; |
| 17 | +typedef long long ll; |
| 18 | +#define sz size() |
| 19 | +#define mp(x, y) make_pair(x, y) |
| 20 | +#define ri(a, b) for(int i=((int)(a)); i < ((int)(b)); i++) // i -> [a, b) |
| 21 | +#define rie(a, b) for(int i=((int)(a)); i <= ((int)(b)); i++) // i -> [a, b] |
| 22 | +#define rj(a, b) for(int j=((int)(a)); j < ((int)(b)); j++) // j -> [a, b) |
| 23 | +#define rje(a, b) for(int j=((int)(a)); j <= ((int)(b)); j++) // j -> [a, b] |
| 24 | +#define rk(a, b) for(int k=((int)(a)); k < ((int)(b)); k++) // k -> [a, b) |
| 25 | +#define rke(a, b) for(int k=((int)(a)); k <= ((int)(b)); k++) // k -> [a, b] |
| 26 | +#define fi(b) for(int i=0; i < ((int)(b)); i++) // i -> [0, b) |
| 27 | +#define fie(b) for(int i=0; i <= ((int)(b)); i++) // i -> [0, b] |
| 28 | +#define fj(b) for(int j=0; j < ((int)(b)); j++) // j -> [0, b) |
| 29 | +#define fje(b) for(int j=0; j <= ((int)(b)); j++) // j -> [0, b] |
| 30 | +#define fk(b) for(int k=0; k < ((int)(b)); k++) // k -> [0, b) |
| 31 | +#define fke(b) for(int k=0; k < ((int)(b)); k++) // k -> [0, b] |
| 32 | +#define fle(b) for(int l=0; l <= ((int)(b)); l++) // l -> [0, b] |
| 33 | +vs M; |
| 34 | +int visited[55][55]; |
| 35 | +int n, m; |
| 36 | +#define valid(x, y) ( (x) >= 0 && (x) < n && (y) >= 0 && (y) < m && !visited[(x)][(y)] && M[(x)][(y)] == 'X') |
| 37 | + |
| 38 | + |
| 39 | +class ArcadeManao{ |
| 40 | + public: |
| 41 | + int shortestLadder(vector <string> level, int coinRow, int coinColumn){ |
| 42 | + M = level; |
| 43 | + n = M.size(); |
| 44 | + m = M[0].size(); |
| 45 | + vi move(2); |
| 46 | + move[0] = -1; move[1] = 1; |
| 47 | + |
| 48 | + for(int l = 0; l < n; l++){ |
| 49 | + // cout<<"level = "<<l<<endl; |
| 50 | + fi(n) fj(m) visited[i][j] = 0; |
| 51 | + queue<pi> Q; |
| 52 | + Q.push(mp(n-1, m-1)); |
| 53 | + visited[n-1][m-1] = 1; |
| 54 | + while(!Q.empty()){ |
| 55 | + pi p = Q.front(); |
| 56 | + Q.pop(); |
| 57 | + int x = p.first, y = p.second; |
| 58 | + // cout<<x<<" "<<y<<endl; |
| 59 | + if(x+1 == coinRow && y+1 == coinColumn) return l; |
| 60 | + //Move horizontally |
| 61 | + for(int k : move){ |
| 62 | + if(valid(x, y+k)){ |
| 63 | + Q.push(mp(x, y+k)); |
| 64 | + visited[x][y+k] = 1; |
| 65 | + } |
| 66 | + } |
| 67 | + //Move vertically |
| 68 | + for(int i = 1; i <= l; i++){ |
| 69 | + for(int k : move){ |
| 70 | + if(valid(x+k*i, y)){ |
| 71 | + visited[x+k*i][y] = 1; |
| 72 | + Q.push(mp(x+k*i, y)); |
| 73 | + } |
| 74 | + } |
| 75 | + } |
| 76 | + } |
| 77 | + } |
| 78 | + } |
| 79 | + |
| 80 | + |
| 81 | +// BEGIN CUT HERE |
| 82 | + public: |
| 83 | + 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(); } |
| 84 | + private: |
| 85 | + 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(); } |
| 86 | + 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; } } |
| 87 | + void test_case_0() { string Arr0[] = {"XXXX....", |
| 88 | + "...X.XXX", |
| 89 | + "XXX..X..", |
| 90 | + "......X.", |
| 91 | + "XXXXXXXX"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 2; int Arg2 = 4; int Arg3 = 2; verify_case(0, Arg3, shortestLadder(Arg0, Arg1, Arg2)); } |
| 92 | + void test_case_1() { string Arr0[] = {"XXXX", |
| 93 | + "...X", |
| 94 | + "XXXX"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 1; int Arg2 = 1; int Arg3 = 1; verify_case(1, Arg3, shortestLadder(Arg0, Arg1, Arg2)); } |
| 95 | + void test_case_2() { string Arr0[] = {"..X..", |
| 96 | + ".X.X.", |
| 97 | + "X...X", |
| 98 | + ".X.X.", |
| 99 | + "..X..", |
| 100 | + "XXXXX"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 1; int Arg2 = 3; int Arg3 = 4; verify_case(2, Arg3, shortestLadder(Arg0, Arg1, Arg2)); } |
| 101 | + void test_case_3() { string Arr0[] = {"X"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 1; int Arg2 = 1; int Arg3 = 0; verify_case(3, Arg3, shortestLadder(Arg0, Arg1, Arg2)); } |
| 102 | + void test_case_4() { string Arr0[] = {"XXXXXXXXXX", |
| 103 | + "...X......", |
| 104 | + "XXX.......", |
| 105 | + "X.....XXXX", |
| 106 | + "..XXXXX..X", |
| 107 | + ".........X", |
| 108 | + ".........X", |
| 109 | + "XXXXXXXXXX"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 1; int Arg2 = 1; int Arg3 = 2; verify_case(4, Arg3, shortestLadder(Arg0, Arg1, Arg2)); } |
| 110 | + |
| 111 | +// END CUT HERE |
| 112 | + |
| 113 | +}; |
| 114 | + |
| 115 | +// BEGIN CUT HERE |
| 116 | +int main(){ |
| 117 | + |
| 118 | + ArcadeManao ___test; |
| 119 | + ___test.run_test(-1); |
| 120 | +} |
| 121 | +// END CUT HERE |
0 commit comments