Submission #10735682

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair < int, int >;

int main() {
	int m = 3, x, n;
	map < int, pii > mp;
	for (int i = 0; i < m; i++) {
		for (int j = 0; j < m; j++) {
			cin >> x;
			mp[x] = make_pair (i, j);
		}
	}
	vector < int > rows (m), cols(m), diag(2);
	cin >> n;
	while (n--) {
		cin >> x;
		if (mp.find (x) == mp.end()) continue;
		pii p = mp[x];
		rows[p.first]++;
		cols[p.second]++;
		if (p.first == p.second) diag[0]++;
		if (p.first + p.second == m - 1) diag[1]++;
	}
	for (int row : rows) {
		if (row >= m) {
			cout << "Yes" << endl;
			return 0;
		}
	}
	for (int col : cols) {
		if (col >= m) {
			cout << "Yes" << endl;
			return 0;
		}
	}
	for (int d: diag) {
		if (d >= m) {
			cout << "Yes" << endl;
			return 0;
		}
	}
	cout << "No" << endl;
	return 0;	
}

Submission Info

Judge Result