提出 #70038241

---

ソースコード 拡げる

#include <algorithm>
#include <iostream>
#include <vector>

int main()
{
    using namespace std;
    int ct;
    cin >> ct;
    auto solve = [] {
        int n, m, k;
        cin >> n >> m >> k;
        string s;
        cin >> s;
        vector g(n, vector<int>());
        for (int i = 0; i < m; ++i) {
            int x, y;
            cin >> x >> y;
            x--;
            y--;
            g[x].push_back(y);
        }
        vector<int> aw(n), bw(n);
        for (int i = 0; i < n; ++i) {
            if (s[i] == 'A')
                aw[i] = 1;
            else
                bw[i] = 1;
        }
        for (int i = 0; i < 2 * k; ++i) {
            vector<int> naw(n), nbw(n);
            for (int v = 0; v < n; ++v) {
                for (int nv : g[v]) {
                    naw[v] |= 1 ^ bw[nv];
                    nbw[v] |= 1 ^ aw[nv];
                }
            }
            aw = move(naw);
            bw = move(nbw);
        }
        if (aw[0])
            puts("Alice");
        else
            puts("Bob");
    };
    for (int i = 0; i < ct; ++i) {
        solve();
    }
}

提出情報

ジャッジ結果