Submission #1205526

#	Time	Username	Problem	Language	Result	Execution time	Memory
1205526		Triseedot	Maze (JOI23_ho_t3)	C++20	100 / 100	461 ms	188300 KiB

Main

// Made by ordinary newbie

#pragma region setup
#include <bits/stdc++.h>
#include <random>
#include <chrono>
using namespace std;

// variables
#define int long long
using ld = long double;
using ll = long long;
using ull = unsigned long long;
template<typename T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;
// bitwise operations
#define cnt_bit(n) __builtin_popcountll(n)
#define low_bit(n) ((n) & (-(n)))
#define bit(n, i) (((n) >> (i)) & 1)
#define set_bit(n, i) ((n) | (1ll << (i)))
#define reset_bit(n, i) ((n) & ~(1ll << (i)))
#define flip_bit(n, i) ((n) ^ (1ll << (i)))
// math
#define sqr(n) ((n) * (n))
int log2_floor(ull n) {
    return n ? __builtin_clzll(1) - __builtin_clzll(n) : -1;
}
const ll INF = 1e18;
// utils
#define len(x) (int) x.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
template <typename T>
istream& operator>>(istream& is, vector<T>& v) {
    for(auto& el : v) {
        is >> el;
    }
    return is;
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < len(v); i++) {
        if (i) os << ' ';
        os << v[i];
    }
    return os;
}
template<class... Args>
auto create(size_t n, Args&&... args) {
    if constexpr(sizeof...(args) == 1) {
        return vector(n, args...);
    }
    else {
        return vector(n, create(args...));
    }
}
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
    size_t operator()(pair<int, int> x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x.first + FIXED_RANDOM) ^ splitmix64(x.second + FIXED_RANDOM);
    }
};
template<typename T, typename U>
bool chmin(T& a, const U b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U>
bool chmax(T& a, const U b) {
    if (b > a) {
        a = b;
        return true;
    }
    return false;
}
template<typename T>
void compress(vector<T>& v) {
    int n = len(v);
    vector<pair<T, int>> u(n);
    for (int i = 0; i < n; i++) {
        u[i] = {v[i], i};
    }
    sort(all(u));
    int curr = 0;
    for (int i = 0; i < n; i++) {
        if (i != 0 && u[i].first != u[i - 1].first) curr++;
        v[u[i].second] = curr;
    }
}
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
#pragma endregion

void solve() {
    int n, m, k;
    cin >> n >> m >> k;

    queue<pair<int, int>> curr, next;
    vector dist = create(n, m, make_pair(-1ll, -1ll));
    int i1, j1, i2, j2;
    cin >> i1 >> j1 >> i2 >> j2;
    i1--, j1--, i2--, j2--;
    dist[i1][j1] = {0, 0};
    curr.push({i1, j1});

    vector<string> a(n);
    cin >> a;

    while (true) {
        if (curr.empty()) {
            if (next.empty()) break;
            swap(next, curr);
        }
        auto [i, j] = curr.front();
        curr.pop();
        if (dist[i][j].second != 0) {
            for (int i1 = max(0ll, i - 1); i1 <= min(n - 1, i + 1); i1++) {
                for (int j1 = max(0ll, j - 1); j1 <= min(m - 1, j + 1); j1++) {
                    if (dist[i1][j1].first != -1) continue;
                    dist[i1][j1] = dist[i][j];
                    dist[i1][j1].second--;
                    curr.push({i1, j1});
                }
            }
        }
        else {
            for (int i1 = max(0ll, i - 1); i1 <= min(n - 1, i + 1); i1++) {
                for (int j1 = max(0ll, j - 1); j1 <= min(m - 1, j + 1); j1++) {
                    if (abs(i - i1) + abs(j - j1) != 1) continue;
                    if (dist[i1][j1].first != -1) continue;
                    if (a[i1][j1] == '.') {
                        dist[i1][j1] = dist[i][j];
                        curr.push({i1, j1});
                    }
                    else {
                        dist[i1][j1] = {dist[i][j].first + 1, k - 1};
                        next.push({i1, j1});
                    }
                }
            }
        }
    }

    cout << dist[i2][j2].first << '\n';
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int tt = 1;
    //cin >> tt;
    for (int i = 1; i <= tt; i++) {
        solve();
    }
}

• Subtask 1: 8 / 8
• Subtask 2: 19 / 19
• Subtask 3: 16 / 16
• Subtask 4: 19 / 19
• Subtask 5: 5 / 5
• Subtask 6: 19 / 19
• Subtask 7: 8 / 8
• Subtask 8: 6 / 6