oj.uz

Submission #491022

# Submission time Handle Problem Language Result Execution time Memory
491022 2021-11-30T04:36:37 Z sberens Mecho (IOI09_mecho) C++17
58 / 100
 1000 ms 6956 KB 
#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>

using namespace __gnu_pbds;
template<typename K> using hset = gp_hash_table<K, null_type>;
template<typename K, typename V> using hmap = gp_hash_table<K, V>;


using namespace std;

#define all(x) (x).begin(), (x).end()
#define pb push_back
#define eb emplace_back
#define smax(x, y) (x = max(x, y))
#define smin(x, y) (x = min(x, y))

#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i,0,a)
#define ROF(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i, a) ROF(i,0,a)


using ll = long long;
using ld = long double;

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

using vi = vector<int>;
using ii = array<int, 2>;
using vii = vector<ii>;
using vvi = vv<int>;

using vll = vector<ll>;
using l2 = array<ll, 2>;
using vl2 = vector<l2>;
using vvll = vv<ll>;

template<typename T>
using minq = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using maxq = priority_queue<T>;

const ll M = 1000000007;
const ll infll = M * M;

template<typename IN>
IN discrete_binary_search(function<bool(IN)> predicate, IN low = 0, IN high = numeric_limits<IN>::max()) {
    while (low < high) {
        IN middle = low + (high - low) / 2; // todo std::midpoint in cpp 2020
        if (predicate(middle))
            high = middle;
        else low = middle + 1;
    }
    return low;
}

vii dirs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};

vii adjc(int x, int y) {
    vii res;
    for (auto [dx, dy] : dirs)
        res.pb({x + dx, y + dy});
    return res;
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n, s;
    cin >> n >> s;
    vv<char> g(n, vector<char>(n));
    int mr, mc, dr, dc;
    vii hives;
    F0R(i, n) {
        F0R(j, n) {
            char x;
            cin >> x;
            g[i][j] = x;
            if (x == 'M') {
                mr = i;
                mc = j;
            } else if (x == 'H') {
                hives.pb({i, j});
            } else if (x == 'D') {
                dr = i;
                dc = j;
            }
        }
    }
    cout << discrete_binary_search<int>([&](int t) -> bool {
        queue<ii> bees, bear;
        vvi seenbees(n, vi(n)), seenbear(n, vi(n));
        for (auto [r, c] : hives) {
            bees.push({r, c});
            seenbees[r][c] = 1;
        }
        bear.push({mr, mc});
        seenbear[mr][mc] = 1;

        auto upd_bees = [&]() -> void {
            queue<ii> nextbees;
            while (!bees.empty()) {
                auto [r, c] = bees.front(); bees.pop();
                for (auto [nr, nc] : adjc(r, c)) {
                    if (0 <= nr && nr < n && 0 <= nc && nc < n && seenbees[nr][nc] == 0 && (g[nr][nc] == 'G' || g[nr][nc] == 'M')) {
                        nextbees.push({nr, nc});
                        seenbees[nr][nc] = 1;
                    }
                }
            }
            bees = nextbees;
        };
        F0R(_, t) upd_bees();
        while (!bees.empty()) {
            F0R(_, s) {
                queue<ii> nextbear;
                while (!bear.empty()) {
                    auto [r, c] = bear.front(); bear.pop();
                    if (seenbees[r][c] == 1) continue;
                    if (r == dr && c == dc) return false;
                    for (auto [nr, nc] : adjc(r, c)) {
                        if (0 <= nr && nr < n && 0 <= nc && nc < n && seenbear[nr][nc] == 0 && (g[nr][nc] == 'G' || g[nr][nc] == 'D') && seenbees[nr][nc] == 0) {
                            nextbear.push({nr, nc});
                            seenbear[nr][nc] = 1;
                        }
                    }
                }
                bear = nextbear;
            }
            upd_bees();
        }
        return true;
    }, 0, n * n) - 1 << '\n';

}

Subtask #1
58.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Execution timed out 1077 ms 6324 KB Time limit exceeded
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 4 ms 332 KB Output is correct
13 Correct 4 ms 360 KB Output is correct
14 Correct 6 ms 332 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 316 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 3 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 3 ms 332 KB Output is correct
24 Correct 3 ms 332 KB Output is correct
25 Correct 5 ms 332 KB Output is correct
26 Correct 4 ms 332 KB Output is correct
27 Correct 6 ms 332 KB Output is correct
28 Correct 4 ms 332 KB Output is correct
29 Correct 7 ms 332 KB Output is correct
30 Correct 6 ms 332 KB Output is correct
31 Correct 8 ms 332 KB Output is correct
32 Correct 10 ms 332 KB Output is correct
33 Correct 262 ms 1412 KB Output is correct
34 Correct 172 ms 1416 KB Output is correct
35 Correct 296 ms 1436 KB Output is correct
36 Correct 283 ms 2020 KB Output is correct
37 Correct 248 ms 1768 KB Output is correct
38 Correct 452 ms 1892 KB Output is correct
39 Correct 450 ms 2128 KB Output is correct
40 Correct 302 ms 2160 KB Output is correct
41 Correct 512 ms 2140 KB Output is correct
42 Correct 476 ms 2556 KB Output is correct
43 Correct 378 ms 2564 KB Output is correct
44 Correct 678 ms 2572 KB Output is correct
45 Correct 553 ms 3276 KB Output is correct
46 Correct 512 ms 3020 KB Output is correct
47 Correct 900 ms 3028 KB Output is correct
48 Correct 681 ms 3676 KB Output is correct
49 Correct 605 ms 3836 KB Output is correct
50 Correct 897 ms 3548 KB Output is correct
51 Correct 782 ms 4416 KB Output is correct
52 Correct 665 ms 4136 KB Output is correct
53 Execution timed out 1097 ms 4112 KB Time limit exceeded
54 Correct 890 ms 4848 KB Output is correct
55 Correct 722 ms 4696 KB Output is correct
56 Execution timed out 1093 ms 4684 KB Time limit exceeded
57 Execution timed out 1060 ms 5444 KB Time limit exceeded
58 Correct 857 ms 5424 KB Output is correct
59 Execution timed out 1096 ms 5324 KB Time limit exceeded
60 Execution timed out 1084 ms 6124 KB Time limit exceeded
61 Correct 975 ms 6136 KB Output is correct
62 Execution timed out 1092 ms 5964 KB Time limit exceeded
63 Execution timed out 1099 ms 6048 KB Time limit exceeded
64 Execution timed out 1084 ms 6092 KB Time limit exceeded
65 Execution timed out 1051 ms 6084 KB Time limit exceeded
66 Execution timed out 1096 ms 6084 KB Time limit exceeded
67 Execution timed out 1098 ms 6084 KB Time limit exceeded
68 Execution timed out 1093 ms 6092 KB Time limit exceeded
69 Execution timed out 1004 ms 6096 KB Time limit exceeded
70 Execution timed out 1043 ms 6092 KB Time limit exceeded
71 Execution timed out 1074 ms 6092 KB Time limit exceeded
72 Execution timed out 1069 ms 6092 KB Time limit exceeded
73 Execution timed out 1087 ms 6856 KB Time limit exceeded
74 Execution timed out 1095 ms 6640 KB Time limit exceeded
75 Execution timed out 1095 ms 6688 KB Time limit exceeded
76 Execution timed out 1083 ms 6956 KB Time limit exceeded
77 Execution timed out 1094 ms 6904 KB Time limit exceeded
78 Execution timed out 1082 ms 6596 KB Time limit exceeded
79 Execution timed out 1098 ms 6544 KB Time limit exceeded
80 Execution timed out 1097 ms 6572 KB Time limit exceeded
81 Execution timed out 1093 ms 6540 KB Time limit exceeded
82 Execution timed out 1057 ms 6592 KB Time limit exceeded
83 Execution timed out 1089 ms 6496 KB Time limit exceeded
84 Execution timed out 1079 ms 6628 KB Time limit exceeded
85 Execution timed out 1092 ms 6448 KB Time limit exceeded
86 Execution timed out 1082 ms 6640 KB Time limit exceeded
87 Execution timed out 1085 ms 6548 KB Time limit exceeded
88 Execution timed out 1097 ms 6444 KB Time limit exceeded
89 Execution timed out 1080 ms 6400 KB Time limit exceeded
90 Execution timed out 1094 ms 6360 KB Time limit exceeded
91 Execution timed out 1099 ms 6476 KB Time limit exceeded
92 Execution timed out 1091 ms 6452 KB Time limit exceeded