백준 2508번 사탕 박사 고창영 C++

https://www.acmicpc.net/problem/2508

2508번: 사탕 박사 고창영

 

#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <utility>
#include <stack>
#include <queue>
#include <math.h>
#include <set>
#include <map>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <limits.h>

using namespace std;
using int64 = long long;

int dRow[4] = { -1,0,1,0 };
int dCol[4] = { 0,1,0,-1 };

int t;

vector<vector<char>> board;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    cin >> t;
    while (t--) {
        int r, c;
        cin >> r >> c;
        board = vector<vector<char>>(r, vector<char>(c));
        for (int i = 0; i < r; i++)
            for (int j = 0; j < c; j++)
                cin >> board[i][j];

        int cnt = 0;
        for (int i = 0; i < r; i++) {
            for (int j = 0; j < c; j++) {
                if (board[i][j] == 'o') {
                    if (i + 1 < r && i - 1 >= 0) {
                        if (board[i + 1][j] == '^' && board[i - 1][j] == 'v') {
                            cnt++;
                            continue;
                        }
                    }
                    if (j + 1 < c && j - 1 >= 0) {
                        if (board[i][j + 1] == '<' && board[i][j - 1] == '>') {
                            cnt++;
                        }
                    }
                }
            }
        }
        cout << cnt << "\n";
    }
}