Submission #74666481

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<char, int>;
using PQ = priority_queue<int>;
using PQG = priority_queue<int, vector<int>, greater<int>>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(a) (a).begin(), (a).end()
#define rev(a) (a).rbegin(), (a).rend()
#define pb push_back
#define eb emplace_back
#define pob pop_back

int main() {
  int n, m;
  cin >> n;
  vector<int> a(n), b(n);
  rep(i,n) cin >> a[i] >> b[i];
  cin >> m;
  vector<set<P>> st(11);
  vector<string> s(m);
  rep(i,m) {
    cin >> s[i];
    int l = s[i].size();
    rep(j,l) st[l].insert(P(s[i][j],j));
  }

  rep(i,m) {
    string t = s[i];
    int l = t.size();
    if(l != n) {
      cout << "No\n";
      continue;
    }
    bool ok = true;
    rep(j,l) if(!st[a[j]].count(P(t[j],b[j]-1))) ok = false;
    cout << (ok ? "Yes\n" : "No\n");
  }
  return 0;
}

Submission Info

Judge Result