Submission #7084681

---

Source Code Expand

#include <iostream>
#include <vector>
#include <cstring>
#include <algorithm> // sort
#include <map>
#include <string>
#include <bits/stdc++.h>

#define REP(i, n) for (long long i = 0; i < (n); i++) 
typedef long long ll;

static const ll MOD = 1000000007;
static const ll INF = 1000000000000000000LL;
using namespace std;
using pint = pair<int,int>;


bool res = false;
vector <int> NG(3);
int dfs(int n, int cnt)
{
  if(cnt > 100)return -1;
  if(res == true)return 0;
  if(n == 0)
  {
    res = true;
    cout << cnt << endl;
    return 0;
  }

  bool fag1 = true;
  bool fag2 = true;
  bool fag3 = true;

  REP(i,3)
  {
    if(n-1 == NG[i])fag1 = false;
    if(n-2 == NG[i])fag2 = false;
    if(n-3 == NG[i])fag3 = false;
  }
  if(fag3)
  {
    dfs(n-3, cnt + 1);
  }
  else if(fag2)
  {
    dfs(n-2, cnt + 1);
  }
  else if(fag1)
  {
    dfs(n-1, cnt + 1);
  }
  else
  {
    return -1;
  }

  return -1;
}

//1, 2, 3 引き算
//観点: 3つが連続していなければOK, NでなければOK
//ただし,100回以内に納めること <= 300 
int main(){
  int N;
  cin >> N;
  if(N > 300)
  {
    cout << "NO" << endl;
    return 0;
  }

  REP(i,3)
  {
    cin >> NG[i];
  }
  REP(i,3)
  {
    if(N == NG[i])
    {
      cout << "NO" << endl;
      return 0;      
    }
  }

  sort(NG.begin(),NG.end());

  int ren = 1;

  REP(i,2)
  {
    if(NG[i] == NG[i+1] -1)++ren;
  }

  if(ren == 3)
  {
    cout << "NO" << endl;
    return 0;
  }

  dfs(N,0);

  string str = "NO";

  if(res == true)
  {
    str = "YES";
  }

  cout << str << endl;

  return 0;
}

Submission Info

Judge Result