Submission #6410888

---

Source Code Expand

#include <bits/stdc++.h>
#define DUMP(x)  cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define IFOR(i, m, n) for(int i = n - 1; i >= m; i-- )
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define FOREACH(x,a) for(auto& (x) : (a) )
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
const ll INF = 1e18;
/* テンプレートここまで */
void yes(){
  cout << "YES" << endl;
  exit(0);
}

void no(){
  cout << "NO" << endl;
  exit(0);
}

int main() {
  ll n, a,b; cin >> n >> a >> b;
  ll k; cin >> k;
  vector<ll> p(k); REP(i, k) cin >> p[i];
  p.push_back(a);
  p.push_back(b);
  sort(ALL(p));
  REP(i, p.size()-1){
    if(p[i] == p[i+1]) no();
  }
  yes();
}

Submission Info

Judge Result