Submission #1758780

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
int ok;

void dfsf(int n, int rest, int stage, vector<int> a){
	if (n <= 0){
		ok = 1;
		return;
	}
	if (rest == 0)
		return;
	if (stage == -1)
		dfsf(n - 3, rest - 1, stage, a);
	if (n == a[stage]){
		return;
	}
	if (n - 1 == a[stage]){
		dfsf(n - 3, rest-1, stage-1, a);
		dfsf(n - 2, rest-1, stage-1, a);
	}
	else if (n - 2 == a[stage]) {
		dfsf(n - 1, rest-1, stage-1, a);
		dfsf(n - 3, rest-1, stage-1, a);
	}
	else if (n - 3 == a[stage] ){
		dfsf(n - 1, rest-1, stage-1, a);
		dfsf(n - 2, rest-1, stage-1, a);
	}
	else 
		dfsf(n - 3, rest - 1, stage, a);
}
	

int main(void){
	int n;
	
	vector<int> ng(3);
	
	cin >> n >> ng[0] >> ng[1] >> ng[2];
	sort(ng.begin(), ng.end());
	
	ok = 0;
	dfsf(n, 100, 2, ng);
	if (ok)
		cout << "OK" << endl;
	else
		cout << "NO" << endl;
	
	return 0;
}

Submission Info

Judge Result