Submission #1833459

---

Source Code Expand

#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
using namespace std;

#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }



int N;
int ng[3];

bool dp[310][110];


int main() {
    while (cin >> N) {
        for (int i = 0; i < 3; ++i) cin >> ng[i];
        memset(dp, 0, sizeof(dp));
        dp[0][0] = true;
        for (int i = 0; i <= N; ++i) {
            bool ok = true;
            for (int j = 0; j < 3; ++j) if (i == ng[j]) ok = false;
            if (!ok) continue;
            for (int j = 1; j <= 100; ++j) {
                if (i - 1 >= 0) dp[i][j] |= dp[i-1][j-1];
                if (i - 2 >= 0) dp[i][j] |= dp[i-2][j-1];
                if (i - 3 >= 0) dp[i][j] |= dp[i-3][j-1];
                
                //if (dp[i][j]) cout << i << ", " << j << ": " << dp[i][j] << endl;
            }
        }
        
        bool res = false;
        for (int j = 0; j <= 100; ++j) if (dp[N][j]) res = true;
        
        if (res) puts("YES");
        else puts("NO");
    }
}

Submission Info

Judge Result