Submission #1304129

---

Source Code Expand

#include <iostream>
#include<sstream>
#include<vector>
#include<iterator>
#include<algorithm>
#include<queue>
using namespace std;

#define YES "YES"
#define NO "NO"

int main(void)
{
	int N;
	cin >> N;

	vector<int> NG(3, 0);
	for(auto it=NG.begin(); it!=NG.end(); it++)
		cin >> *it;

	if(find(NG.begin(), NG.end(), N) != NG.end())
	{
		cout << NO << endl;
		return 0;
	}

	queue<int> que1, que2;
	queue<int> *prev, *next;
	prev = &que1;
	next = &que2;

	// seed
	next->push(N);

	vector<bool> table(301, true);
	table[N] = false;
	for(auto it=NG.begin(); it!=NG.end(); it++)
		table[*it] = false;

	int cnt = 0;
	bool success = false;
	const int movement[3] = {-1, -2, -3};
	while(next->empty() != true)
	{
		cnt++;
		swap(prev, next);
		while(prev->empty() != true)
		{
			int pre = prev->front();
			prev->pop();

			for(auto it=begin(movement); it!=end(movement); it++)
			{
				int state = pre + *it;

				if(state < 0)
					continue;
				else if(table[state] == false)
					continue;

				if(state == 0)
				{
					success = true;
					*prev, queue<int>().swap(*prev);
					queue<int>().swap(*next);
					break;
				}

				next->push(state);
				table[state] = false;
			}
		}

		if(cnt == 100)
			break;
	}

	if(success == true && cnt <= 100)
		cout << YES << endl;
	else
		cout << NO << endl;

	return 0;
}

Submission Info

Judge Result