提出 #75534453

---

ソースコード 拡げる

#include <bits/stdc++.h>
#define fastio cin.tie(0)->sync_with_stdio(0)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define compress(v) sort(all(v)), v.erase(unique(all(v)), v.end())
#define sz(x) (int)(x).size()
using namespace std;
typedef long long ll;

int main() {
    fastio; int T; cin >> T;
    for (int tc = 0; tc < T; tc++) {
        int N, M; cin >> N >> M;
        vector<vector<int>> adj(N);
        for (int i = 0; i < M; i++) {
            int u, v; cin >> u >> v; u--; v--;
            adj[u].push_back(v);
            adj[v].push_back(u);
        }
        vector<string> hv(N);
        int W; cin >> W;
        for (auto &i : hv) cin >> i;
        vector<vector<int>> vis(N, vector<int>(10));
        auto dfs = [&](auto dfs, int u, int d) -> bool {
            vis[u][d] = 1;
            int nd = (d+1)%W;
            for (auto v : adj[u]) {
                if (hv[v][nd] == 'x') continue;
                if (vis[v][nd] == 1) return true;
                if (vis[v][nd] == 0 && dfs(dfs, v, nd)) return true;
            }
            if (hv[u][nd] == 'o') {
                if (vis[u][nd] == 1) return true;
                if (vis[u][nd] == 0 && dfs(dfs, u, nd)) return true;
            }
            vis[u][d] = 2;
            return false;
        };
        bool chk = false;
        for (int i = 0; i < N; i++) {
            if (hv[i][0] == 'o' && vis[i][0] == 0) {
                if (dfs(dfs, i, 0)) {
                    chk = true; break;
                }
            }
        }
        cout << (chk ? "Yes" : "No") << "\n";
    }
    return 0;
}

提出情報

ジャッジ結果