Submission #74661294

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int main() {

	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	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 valid[11][11][26] = {};
	for (const string &s : S) {
		int len = s.length();
		for (int pos = 0; pos < len; pos++) {
			valid[len][pos][s[pos] - 'a'] = true;
		}
	}
	for (int j = 0; j < M; j++) {
		const string &spine = S[j];
		if ((int)spine.length() != N) {
			cout << "No\n";
			continue;
		}
		bool ok = true;
		for (int i = 0; i < N && ok; i++) {
			int len = A[i];
			int pos = B[i];
			char c = spine[i];
			if (pos >= len) {
				ok = false;
				break;
			}
			if (!valid[len][pos][c - 'a']) {
				ok = false;
				break;
			}
		}
		cout << (ok ? "Yes" : "No") << '\n';
	}

	return 0;
}

Submission Info

Judge Result