强连通图——Acwing4801

#include <iostream>
#include <cstring>

using namespace std;

const int N = 30;

int n, m;
char a[N], b[N];
int cnt[N][N];
bool st[N][N];

void dfs(int i, int j)
{
    if (i < 1 || i > n || j < 1 || j > m || st[i][j]) return;
    st[i][j] = true;
    if (a[i] == '<') dfs(i, j - 1);
    else dfs(i, j + 1);
    if (b[j] == 'v') dfs(i + 1, j);
    else dfs(i - 1, j);
}

int main()
{
    scanf("%d%d", &n, &m);
    scanf("%s%s", a + 1, b + 1);
    int s = n * m;
    
    dfs(1, 1);
 
    for (int i = 1; i <= n; i ++ ) 
        for (int j = 1; j <= m; j ++ ) 
            if (!st[i][j]) 
            {
                puts("NO");
                return 0;
            }
            
    memset(st, false, sizeof st);
    
    dfs(n, m);
    for (int i = 1; i <= n; i ++ ) 
        for (int j = 1; j <= m; j ++ ) 
            if (!st[i][j]) 
            {
                puts("NO");
                return 0;
            }
            
    puts("YES");

    return 0;
}