提出 #74667036

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
int main() {
    int n;
    cin >> n;
    vector<int> a(n), b(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i] >> b[i];
        b[i]--;
    }
    int m;
    cin >> m;
    vector<string> s(m);
    for (int i = 0; i < m; i++) {
        cin >> s[i];
    }
    bool ok[11][10][26] = {false};

    for (string& str : s) {
        int len = str.size();
        for (int pos = 0; pos < len; pos++) {
            int ch = str[pos] - 'a';
            ok[len][pos][ch] = true;
        }
    }
    for (string& spine : s) {
        if ((int)spine.size() != n) {
            cout << "No\n";
            continue;
        }
        bool possible = true;
        for (int i = 0; i < n; i++) {
            int needLen = a[i];
            int needPos = b[i];
            int needChar = spine[i] - 'a';
            if (!ok[needLen][needPos][needChar]) {
                possible = false;
                break;
            }
        }
        cout << (possible ? "Yes" : "No") << "\n";
    }
    return 0;
}

提出情報

ジャッジ結果