Submission #2245911

---

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;}
}

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

const int INF = 1e8;
int dp[333];
int n;
int ng[5];

bool dame(int x) {
   if (x < 0) return true;
   rep (i, 3) {
      if (x == ng[i]) return true;
   }
   return false;
}

int main() {
   rep (i, 333) dp[i] = INF;
   cin >> n;
   rep (i, 3) {
      cin >> ng[i];
      if (n == ng[i]) {
         puts("NO");
         return 0;
      }
   }

   dp[n] = 0;
   for (int i = n; i >= 0; i--) { // iからの遷移
      for (int j = 1; j <= 3; j++) {
         if (dame(i-j)) continue;
         dp[i-j] = min(dp[i-j], dp[i]+1);
      }
   }

   if (dp[0] <= 100) {
      puts("YES");
   } else {
      puts("NO");
   }

   return 0;
}

Submission Info

Judge Result