Submission #1678320

---

Source Code Expand

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<cstring>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>
#include<iterator>

#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define rep(i,n) for(int i=0; i<n; i++)
#define FOR(i,a,n) for(int i=a; i<n; i++)

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, char> plc;
typedef pair<string, string> pss;

int n;
int ng1, ng2, ng3;
int dp[110][5];

bool search(int x) {
	for (int i = 1; i <= 100; i++) {
		if (!(dp[i][x] != ng1 && dp[i][x] != ng2 && dp[i][x] != ng3)) {
			return false;
		}
	}
	if (dp[100][x] != 0)return false;
	return true;
}

int main()
{
	cin >> n;
	cin >> ng1 >> ng2 >> ng3;

	if (n == ng1 || n == ng2 || n == ng3) {
		cout << "NO" << endl;
		return 0;
	}

	dp[0][0] = dp[0][1] = dp[0][2] = n;
	for (int i = 1; i <= 100; i++) {
		for (int j = 0; j < 3; j++) {
			if (dp[i - 1][j] >= 1) dp[i][0] = dp[i - 1][j] - 1;
			if (dp[i - 1][j] >= 2) dp[i][1] = dp[i - 1][j] - 2;
			if (dp[i - 1][j] >= 3) dp[i][2] = dp[i - 1][j] - 3;
		}
	}
	
	if (search(0) || search(1) || search(2))
		cout << "YES" << endl;
	else
		cout << "NO" << endl;
	return 0;
}

Submission Info

Judge Result