Submission #74676051

---

Source Code Expand

#include <format>
#include <iostream>
#include <set>
#include <vector>
using namespace std;

void solve(void) {
    int n;
    cin >> n;
    vector<int> a(n);
    vector<int> b(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i] >> b[i];
    }

    int m;
    cin >> m;
    vector<string> s(m);
    for (auto& i : s) {
        cin >> i;
    }

    vector bucket(10, vector<set<char>>(10));
    for (const auto& ss : s) {
        int len = ss.size();
        for (int i = 0; i < len; i++) {
            bucket[len - 1][i].insert(ss[i]);
        }
    }

    for (const auto& ss : s) {
        int len = ss.size();
        if (len != n) {
            cout << "No\n";
            continue;
        }
        bool ok = true;
        for (int i = 0; i < len; i++) {
            if (!bucket[a[i] - 1][b[i] - 1].contains(ss[i])) {
                ok = false;
                break;
            }
        }
        cout << (ok ? "Yes" : "No") << '\n';
    }
}

int main(void) {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    solve();

    return 0;
}

Submission Info

Judge Result