|
| 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 make_pair |
| 20 | +#define pb push_back |
| 21 | +#define ri(a, b) for(int i=((int)(a)); i < ((int)(b)); i++) // i -> [a, b) |
| 22 | +#define rie(a, b) for(int i=((int)(a)); i <= ((int)(b)); i++) // i -> [a, b] |
| 23 | +#define rj(a, b) for(int j=((int)(a)); j < ((int)(b)); j++) // j -> [a, b) |
| 24 | +#define rje(a, b) for(int j=((int)(a)); j <= ((int)(b)); j++) // j -> [a, b] |
| 25 | +#define rk(a, b) for(int k=((int)(a)); k < ((int)(b)); k++) // k -> [a, b) |
| 26 | +#define rke(a, b) for(int k=((int)(a)); k <= ((int)(b)); k++) // k -> [a, b] |
| 27 | +#define fi(b) for(int i=0; i < ((int)(b)); i++) // i -> [0, b) |
| 28 | +#define fie(b) for(int i=0; i <= ((int)(b)); i++) // i -> [0, b] |
| 29 | +#define fj(b) for(int j=0; j < ((int)(b)); j++) // j -> [0, b) |
| 30 | +#define fje(b) for(int j=0; j <= ((int)(b)); j++) // j -> [0, b] |
| 31 | +#define fk(b) for(int k=0; k < ((int)(b)); k++) // k -> [0, b) |
| 32 | +#define fke(b) for(int k=0; k < ((int)(b)); k++) // k -> [0, b] |
| 33 | +#define fle(b) for(int l=0; l <= ((int)(b)); l++) // l -> [0, b] |
| 34 | +int n; |
| 35 | +#define valid(x, y) ( 0 <= (x) && (x) < 2 && 0 <= (y) && (y) < n ) |
| 36 | +int A[8] = {1, -1, 0, 0, 1, -1, -1, 1}; |
| 37 | +int B[8] = {0, 0, 1, -1, -1, 1, -1, 1}; |
| 38 | + |
| 39 | +class DevuAndPlantingTrees{ |
| 40 | + |
| 41 | + public: |
| 42 | + int maximumTreesDevuCanGrow(vector <string> garden){ |
| 43 | + |
| 44 | + n = garden[0].size(); |
| 45 | + vs temp = garden; |
| 46 | + for(int i = 0; i < 2; i++) |
| 47 | + for(int j = 0; j < n; j++){ |
| 48 | + if(garden[i][j] != '*') continue; |
| 49 | + fk(8){ |
| 50 | + int ii = i + A[k], jj = j + B[k]; |
| 51 | + if(valid(ii, jj) && garden[ii][jj] == '.') garden[ii][jj] = 'x'; |
| 52 | + } |
| 53 | + } |
| 54 | + fi(2){ |
| 55 | + fj(n) cout<<garden[i][j]; |
| 56 | + cout<<endl; |
| 57 | + } |
| 58 | + fi(2) fj(n) { |
| 59 | + if(garden[i][j] != '.') continue; |
| 60 | + garden[i][j] = '*'; |
| 61 | + fk(8){ |
| 62 | + int ii = i + A[k], jj = j + B[k]; |
| 63 | + if(valid(ii, jj) && garden[ii][jj] == '.') garden[ii][jj] = 'x'; |
| 64 | + } |
| 65 | + } |
| 66 | + int c = 0; |
| 67 | + fi(2) fj(n) if(garden[i][j] == '*') c++; |
| 68 | + return c; |
| 69 | + } |
| 70 | + |
| 71 | +// BEGIN CUT HERE |
| 72 | + public: |
| 73 | + 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(); } |
| 74 | + private: |
| 75 | + 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(); } |
| 76 | + 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; } } |
| 77 | + void test_case_0() { string Arr0[] = {"..", ".."}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 1; verify_case(0, Arg1, maximumTreesDevuCanGrow(Arg0)); } |
| 78 | + void test_case_1() { string Arr0[] = {"..", ".*"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 1; verify_case(1, Arg1, maximumTreesDevuCanGrow(Arg0)); } |
| 79 | + void test_case_2() { string Arr0[] = {"...", |
| 80 | +"..*"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 2; verify_case(2, Arg1, maximumTreesDevuCanGrow(Arg0)); } |
| 81 | + void test_case_3() { string Arr0[] = {".....*..........", |
| 82 | +".*.......*.*..*."}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 7; verify_case(3, Arg1, maximumTreesDevuCanGrow(Arg0)); } |
| 83 | + void test_case_4() { string Arr0[] = {"....*.*.*...........*........", |
| 84 | +"*..........*..*.*.*....*...*."}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 13; verify_case(4, Arg1, maximumTreesDevuCanGrow(Arg0)); } |
| 85 | + void test_case_5() { string Arr0[] = {".....*..*..........*............................*", |
| 86 | +"*..*.............*...*.*.*.*..*.....*.*...*...*.."}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 23; verify_case(5, Arg1, maximumTreesDevuCanGrow(Arg0)); } |
| 87 | + |
| 88 | +// END CUT HERE |
| 89 | + |
| 90 | + }; |
| 91 | + |
| 92 | + // BEGIN CUT HERE |
| 93 | + int main() |
| 94 | + { |
| 95 | + DevuAndPlantingTrees ___test; |
| 96 | + ___test.run_test(-1); |
| 97 | + } |
| 98 | + // END CUT HERE |
0 commit comments