Submission #7086192

---

Source Code Expand

#include <bits/stdc++.h>
#define ll long long
#define rep(X,N) for(ll X = 0; X < (N); X++)
#define PI (acos(-1.0))
#define pback push_back
#define mpair make_pair
#define MODN 1000000007
#define ALL(V) (V).begin(),(V).end()

using namespace std;

int main(){

    //ngの数がnと同じか,
    //ダイクストラ法で100回で0まで到達できるかを確認する
    int n;
    bool ans = false;

    vector<int> ng;
    cin >> n;

    rep(i,3){
        int tmp;
        cin >> tmp;
        ng.pback(tmp);
    }

    priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq;
    vector<int> cost(301,INT_MAX);

    pq.push(mpair(0,n));

    while(!pq.empty()){

        int step = pq.top().first;
        int tmpn = pq.top().second;

        if(tmpn >= 0 && tmpn != ng[0] && tmpn != ng[1] && tmpn != ng[2] && step < cost[tmpn]){
            cost[tmpn] = step;

            pq.push(mpair(step + 1, tmpn - 1));
            pq.push(mpair(step + 1, tmpn - 2));
            pq.push(mpair(step + 1, tmpn - 3));
        }

        pq.pop();
    }

    cout << (cost[0] <= 100 ? "YES" : "NO" ) << endl;

    

    return 0;
}

Submission Info

Judge Result