Submission #1768515

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>

int main(){

	int N,a,b,K;

	std::cin >> N >> a >> b >> K;
	std::vector<int> P(K+2);
	P[0]=a;
	P[K+1]=b;

	for(int i=1;i<K+2;i++){
	std::cin >> P[i];
	}
	std::set<int> S;
	std::sort(P.begin(),P.end());
	for(int i=0;i<K+2;i++){
		S.insert(P[i]);
	}
	if(P.size()==S.size()){
		std::cout << "YES" << std::endl;
	}else{
		std::cout << "NO" <<  std::endl;
	}

	return 0;

} 

Submission Info

Judge Result