#763484 (C++17) No.1949 足し算するだけのパズルゲーム(2)

• 問題: No.1949 足し算するだけのパズルゲーム(2)
• ユーザー: kaikey
• 提出日時: 2022-05-20 22:26:29
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 74 ms / 3,000 ms
• コード長: 4,608 bytes
• コンパイル時間: 2,167 ms
• コンパイル使用メモリ: 213,356 KB
• 実行使用メモリ: 9,380 KB
• 最終ジャッジ日時: 2024-09-20 08:40:32
• 合計ジャッジ時間: 3,845 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,816 KB
testcase_01	AC	2 ms; 6,944 KB
testcase_02	AC	2 ms; 6,944 KB
testcase_03	AC	1 ms; 6,940 KB
testcase_04	AC	2 ms; 6,940 KB
testcase_05	AC	2 ms; 6,944 KB
testcase_06	AC	2 ms; 6,944 KB
testcase_07	AC	48 ms; 6,944 KB
testcase_08	AC	30 ms; 6,944 KB
testcase_09	AC	55 ms; 6,944 KB
testcase_10	AC	52 ms; 6,944 KB
testcase_11	AC	57 ms; 6,944 KB
testcase_12	AC	51 ms; 6,940 KB
testcase_13	AC	40 ms; 6,944 KB
testcase_14	AC	49 ms; 9,380 KB
testcase_15	AC	51 ms; 8,480 KB
testcase_16	AC	18 ms; 6,940 KB
testcase_17	AC	74 ms; 8,476 KB
testcase_18	AC	17 ms; 6,944 KB
testcase_19	AC	2 ms; 6,940 KB
testcase_20	AC	2 ms; 6,944 KB
testcase_21	AC	2 ms; 6,940 KB
testcase_22	AC	61 ms; 6,944 KB
testcase_23	AC	2 ms; 6,944 KB
testcase_24	AC	27 ms; 6,940 KB
testcase_25	AC	41 ms; 6,940 KB

ソースコード

#include "bits/stdc++.h"
#include <random>
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i<i##_end_;++i)
#define IFOR(i, begin, end) for(lint i=(end)-1,i##_begin_=(begin);i>=i##_begin_;--i)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define endk '\n'
using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef long double ld; typedef pair<lint, lint> plint; typedef pair<ld, ld> pld;
struct fast_ios { fast_ios() { cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(10); }; } fast_ios_;
template<class T> auto add = [](T a, T b) -> T { return a + b; };
template<class T> auto mul = [](T a, T b) -> T { return a * b; };
template<class T> auto f_max = [](T a, T b) -> T { return max(a, b); };
template<class T> auto f_min = [](T a, T b) -> T { return min(a, b); };
template<class T> using V = vector<T>;
using Vl = V<lint>; using VVl = V<Vl>; using VVVl = V<V<Vl>>;
template< typename T > ostream& operator<<(ostream& os, const vector< T >& v) {
    for (int i = 0; i < (int)v.size(); i++) os << v[i] << (i + 1 != v.size() ? " " : "");
    return os;
}
template< typename T >istream& operator>>(istream& is, vector< T >& v) {
    for (T& in : v) is >> in;
    return is;
}
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
template <class T>
T div_floor(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a >= 0 ? a / b : (a + 1) / b - 1;
}
template <class T>
T div_ceil(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a > 0 ? (a - 1) / b + 1 : a / b;
}
template <class F> struct rec {
    F f;
    rec(F&& f_) : f(std::forward<F>(f_)) {}
    template <class... Args> auto operator()(Args &&... args) const {
        return f(*this, std::forward<Args>(args)...);
    }
};
lint gcd(lint a, lint b) { if (b == 0) return a; else return gcd(b, a % b); }
lint digit(lint a) { return (lint)log10(a); }
lint e_dist(plint a, plint b) { return abs(a.first - b.first) * abs(a.first - b.first) + abs(a.second - b.second) * abs(a.second - b.second); }
lint m_dist(plint a, plint b) { return abs(a.first - b.first) + abs(a.second - b.second); }
bool check_overflow(lint a, lint b, lint limit) { if (b == 0) return false; return a >= limit / b; } // a * b > c => true
void Worshall_Floyd(VVl& g) { REP(k, SZ(g)) REP(i, SZ(g)) REP(j, SZ(g)) chmin(g[i][j], g[i][k] + g[k][j]); }
const lint MOD1000000007 = 1000000007, MOD998244353 = 998244353, INF = 4e18;
lint dx[8] = { 0, 1, 0, -1, 1, -1, 1, -1 }, dy[8] = { 1, 0, -1, 0, -1, -1, 1, 1 };
bool YN(bool flag) { cout << (flag ? "YES" : "NO") << endk; return flag; } bool yn(bool flag) { cout << (flag ? "Yes" : "No") << endk; return flag; }
struct Edge {
    lint from, to;
    lint cost, t;
    Edge() {

    }
    Edge(lint u, lint v, lint c, lint _t) {
        cost = c;
        from = u;
        to = v;
        t = _t;
    }
    bool operator<(const Edge& e) const {
        return cost < e.cost;
    }
};
struct WeightedEdge {
    lint to;
    lint cost;
    WeightedEdge(lint v, lint c) {
        to = v;
        cost = c;
    }
    bool operator<(const WeightedEdge& e) const {
        return cost < e.cost;
    }
};
using WeightedGraph = V<V<WeightedEdge>>;
typedef pair<lint, plint> tlint;
typedef pair<ld, ld> pld;
typedef pair<plint, plint> qlint;
typedef pair<string, string> pstr;
typedef pair<lint, Vl> valv;

int main() {
    lint N, M, X, Y;
    cin >> N >> M >> X >> Y; X--; Y--;
    VVl arr(N, Vl(M));
    cin >> arr;
    lint sum = arr[X][Y];
    arr[X][Y] = 0;
    priority_queue<tlint> que;
    REP(k, 4) {
        lint nx = X + dx[k], ny = Y + dy[k];
        if (nx < 0 || nx >= N | ny < 0 || ny >= M) continue;
        if (arr[nx][ny] == 0) continue;
        que.push({ -arr[nx][ny], {nx,ny} });
        arr[nx][ny] = 0;
    }
    while (!que.empty()) {
        tlint t = que.top(); que.pop();
        lint v = -t.first;
        if (v >= sum) {
            yn(false);
            return 0;
        }
        else {
            sum += v;
            auto [cx, cy] = t.second;
            REP(k, 4) {
                lint nx = cx + dx[k], ny = cy + dy[k];
                if (nx < 0 || nx >= N | ny < 0 || ny >= M) continue;
                if (arr[nx][ny] == 0) continue;
                que.push({ -arr[nx][ny], {nx,ny} });
                arr[nx][ny] = 0;
            }
        }
    }
    yn(true);
}