Submission #3004881

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <cmath>
#include <vector>
#include <queue>
#include <limits>
#include <algorithm>
#include <string>
#include <map>
using namespace std;

int main()
{
	int32_t N, a, b, K;
	cin >> N >> a >> b >> K;

	vector<int32_t> v;
	v.push_back(a);
	v.push_back(b);
	for (int32_t i = 0; i < K; i++) {
		int32_t P;
		cin >> P;
		v.push_back(P);
	}
	sort(v.begin(), v.end());

	int32_t prev = -1;
	for (size_t i = 0; i < v.size(); i++) {
		if (v[i] == prev) {
			cout << "NO" << endl;
			return 0;
		}
		prev = v[i];
	}
	cout << "YES" << endl;

	return 0;
}

Submission Info

Judge Result