Submission #2244266

---

Source Code Expand

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

#define ll long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define rep(i, n) for (int (i) = (0); (i) < (n); ++(i))
#define repp(i, m, n) for (int (i) = (m); (i) < (n); ++(i))
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) cerr<<"("<<#x<<", "<<#y<<") = "<<"("<<x<<", "<<y<<")"<<endl;
#define debug3(x, y, z) cerr<<"("<<#x<<", "<<#y<<", "<<#z<<") = "<<"("<<x<<", "<<y<<", "<<z<<")"<<endl;
#define debugB(x, y) cerr<<#x<<": "<<bitset<y>(x) << endl;
#define line() cerr << "---------------" << endl;

const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const double PI = 3.14159265358979323846;

template<typename T>
void printA(vector<T> &printArray, char between = ' ') {
   int paSize = printArray.size();
   for (int i = 0; i < paSize; i++) { cerr << printArray[i] << between;}
   if (between != '\n') {cerr << endl;}
}

// ------------------------------------------------------------------------------------------

int N;
int ng[5];

int main() {
   cin >> N;
   rep (i, 3) { cin >> ng[i]; }
   sort(ng, ng+N);

   for (int i = 0; i <= N; ) {
      bool ok = true;
      rep (j, 3) { if (i+1 == ng[j]) ok = false; }
      if (ok) {
         i++;
         continue;
      }
      ok = true;
      rep (j, 3) { if (i+2 == ng[j]) ok = false; }
      if (ok) {
         i += 2;
         continue;
      }

      ok = true;
      rep (j, 3) { if (i+3 == ng[j]) ok = false; }
      if (ok) {
         i += 3;
         continue;
      }
      if (!ok) {
         puts("NO");
         return 0;
      }
   }

   puts("YES");

   return 0;
}

Submission Info

Judge Result