제출 #672646

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
672646		Forested	I want to be the very best too! (NOI17_pokemonmaster)	C++17	27 / 100	5052 ms	4872 KiB

pokemonmaster

#ifndef LOCAL
#define FAST_IO
#endif

// ============
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define OVERRIDE(a, b, c, d, ...) d
#define REP2(i, n) for (i32 i = 0; i < (i32) (n); ++i)
#define REP3(i, m, n) for (i32 i = (i32) (m); i < (i32) (n); ++i)
#define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define PER(i, n) for (i32 i = (i32) (n) - 1; i >= 0; --i)
#define ALL(x) begin(x), end(x)

using namespace std;

using u32 = unsigned int;
using u64 = unsigned long long;
using u128 = __uint128_t;
using i32 = signed int;
using i64 = signed long long;
using i128 = __int128_t;
using f64 = double;
using f80 = long double;

template <typename T>
using Vec = vector<T>;

template <typename T>
bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T>
bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

istream &operator>>(istream &is, i128 &x) {
    i64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, i128 x) {
    os << (i64) x;
    return os;
}
istream &operator>>(istream &is, u128 &x) {
    u64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, u128 x) {
    os << (u64) x;
    return os;
}

[[maybe_unused]] constexpr i32 INF = 1000000100;
[[maybe_unused]] constexpr i64 INF64 = 3000000000000000100;
struct SetUpIO {
    SetUpIO() {
#ifdef FAST_IO
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
#endif
        cout << fixed << setprecision(15);
    }
} set_up_io;
// ============

#ifdef DEBUGF
#else
#define DBG(x) (void)0
#endif

int main() {
    const i32 dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
    i32 r, c, q;
    cin >> r >> c >> q;
    Vec<Vec<i32>> l(r, Vec<i32>(c));
    REP(i, r) REP(j, c) { cin >> l[i][j]; }
    Vec<Vec<i32>> p(r, Vec<i32>(c));
    REP(i, r) REP(j, c) { cin >> p[i][j]; }
    REP(qi, q) {
        i32 type, x, y, val;
        cin >> type >> y >> x >> val;
        --x;
        --y;
        if (type == 1) {
            p[x][y] = val;
        } else {
            if (val < l[x][y]) {
                cout << 0 << '\n';
            } else {
                Vec<Vec<i32>> flg(r, Vec<i32>(c, 0));
                queue<pair<i32, i32>> que;
                Vec<i32> poke;
                flg[x][y] = 1;
                que.emplace(x, y);
                poke.push_back(p[x][y]);
                while (!que.empty()) {
                    auto [x_, y_] = que.front();
                    que.pop();
                    REP(dir, 4) {
                        i32 tx = x_ + dx[dir];
                        i32 ty = y_ + dy[dir];
                        if (tx >= 0 && tx < r && ty >= 0 && ty < c &&
                            l[tx][ty] <= val && !flg[tx][ty]) {
                            flg[tx][ty] = 1;
                            que.emplace(tx, ty);
                            poke.emplace_back(p[tx][ty]);
                        }
                    }
                }
                sort(ALL(poke));
                poke.erase(unique(ALL(poke)), poke.end());
                cout << poke.size() << '\n';
            }
        }
    }
}

• Subtask 1: 11 / 11
• Subtask 2: 16 / 16
• Subtask 3: 0 / 20
• Subtask 4: 0 / 24
• Subtask 5: 0 / 29