Submission #1419880

---

Source Code Expand

#include <bits/stdc++.h>
#define FOR(i,bg,ed) for(ll i=(bg);i<(ed);i++)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007
#define int long long
using namespace std;
typedef long long ll;
const int INF = 1e9;

int N;
int NG;
bool isNG[310];
int dp[310];
int dx[3] = {-1, -2, -3};

signed main()
{
    cin >> N;
    REP(i,3) {
        cin >> NG;
        isNG[NG] = true;
    }

    for (int i=0; i<=N; i++) dp[i] = INF;
    dp[N] = (isNG[N] ? INF : 0);
    for (int i=N; i>=1; i--) {
        REP(j,3) {
            int nx = i + dx[j];
            if (nx >= 0) {
                dp[nx] = (isNG[nx] ? INF : min(dp[nx], dp[i] + 1));
            }
        }
    }

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

Submission Info

Judge Result