Gold

#include <iostream>
#include <string>

const int N = 50;
int w, h;
int type [N][N];
bool visited [N][N];
int found = 0;

void dfs(int x, int y) {
	if (visited[x][y]) return;
	visited[x][y] = true;
	if (type[x][y] == 1) {
		++found;
	}
	bool wind = false;
	for (int adjx = std::max(0, x-1); adjx < std::min(w, x+2); ++adjx) {
		if (type[adjx][y] == 2) {
			wind = true;
		}
	}
	for (int adjy = std::max(0, y-1); adjy < std::min(h, y+2); ++adjy) {
		if (type[x][adjy] == 2) {
			wind = true;
		}
	}
	if (! wind) {
		for (int adjx = std::max(0, x-1); adjx < std::min(w, x+2); ++adjx) {
			if (type[adjx][y] != 3) {
				dfs(adjx, y);
			}
		}
		for (int adjy = std::max(0, y-1); adjy < std::min(h, y+2); ++adjy) {
			if (type[x][adjy] != 3) {
				dfs(x, adjy);
			}
		}
	}
}

int main() {
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(0);

	std::cin >> w >> h;
	
	int px = -1;
	int py = -1;
	for (int y = 0; y < h; ++y) {
		std::string line;
		std::cin >> line;
		for (int x = 0; x < w; ++x) {
			if (line[x] == 'P') {
				px = x;
				py = y;
			} else if (line[x] == 'G') {
				type[x][y] = 1;
			} else if (line[x] == 'T') {
				type[x][y] = 2;
			} else if (line[x] == '#') {
				type[x][y] = 3;
			}
		}
	}
	dfs(px, py);
	std::cout << found << '\n';
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED