Submission #74703471

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,a,b) for(ll i = (a); i < (ll)(b); i++)
#define all(x) (x).begin(), (x).end()
#define fore(x, a) for(auto &x : a)
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
const ll INF = 2e18;

#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif

template<class T> using vc = vector<T>;
template<class T> using vv = vc<vc<T>>;
using vl = vc<ll>; using vvl = vv<ll>;
using vs = vc<string>;
//vl a(n);  vvl b(h,vl(w));
using P = pair<ll,ll>;//vector<P> a;
template<class T> using pq = priority_queue<T,vector<T>>;
template<class T> using pq_g = priority_queue<T,vector<T>,greater<T>>;

template<class T>
istream& operator>>(istream& is, vector<T>& v){
    for(T& x : v) is >> x;
    return is;
}

void YN(bool condition) {
    if (condition) {
        cout << "Yes\n";
    } else {
        cout << "No\n";
    }
}
template<typename T>
long long sz(const T& x) {
    return (long long)x.size();
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    ll n;cin >> n;
    vl a(n),b(n);
    rep(i,0,n){
        cin >> a[i]>>b[i];
    }
    ll m;cin >> m;
    vs s(m);
    vector<set<P>> se(26);
    rep(i,0,m){
        cin >> s[i];
        rep(j,0,sz(s[i])){
            se[s[i][j]-'a'].insert({sz(s[i]),j+1});
        }
    }
    rep(i,0,m){
        bool isokay=1;
        if(sz(s[i])==n){
            rep(j,0,n){
                if(se[s[i][j]-'a'].count({a[j],b[j]})==0){
                    isokay=0;
                    break;
                }
            }
        }
        else isokay=false;
        YN(isokay);
    }

    
}

Submission Info

Judge Result