oj.uz

Submission #491028

# Submission time Handle Problem Language Result Execution time Memory
491028 2021-11-30T04:44:25 Z sberens Mecho (IOI09_mecho) C++17
58 / 100
 1000 ms 6492 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()) {
                assert(bees.size() < n * n);
                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;
                    }
                }
            }
            swap(bees, nextbees);
//            bees = nextbees;
        };
        F0R(_, t) upd_bees();
        while (!bees.empty()) {
            F0R(_, s) {
                queue<ii> nextbear;
                while (!bear.empty()) {
                    assert(bear.size() < n * n);
                    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;
                        }
                    }
                }
                swap(bear, nextbear);
//                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 1 ms 204 KB Output is correct
2 Correct 1 ms 280 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Execution timed out 1081 ms 6156 KB Time limit exceeded
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 3 ms 332 KB Output is correct
13 Correct 4 ms 332 KB Output is correct
14 Correct 7 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 2 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 3 ms 204 KB Output is correct
22 Correct 3 ms 204 KB Output is correct
23 Correct 2 ms 332 KB Output is correct
24 Correct 3 ms 332 KB Output is correct
25 Correct 3 ms 352 KB Output is correct
26 Correct 3 ms 332 KB Output is correct
27 Correct 8 ms 384 KB Output is correct
28 Correct 5 ms 332 KB Output is correct
29 Correct 8 ms 364 KB Output is correct
30 Correct 6 ms 332 KB Output is correct
31 Correct 5 ms 332 KB Output is correct
32 Correct 8 ms 368 KB Output is correct
33 Correct 196 ms 1416 KB Output is correct
34 Correct 150 ms 1400 KB Output is correct
35 Correct 312 ms 1420 KB Output is correct
36 Correct 226 ms 1752 KB Output is correct
37 Correct 242 ms 1764 KB Output is correct
38 Correct 412 ms 1756 KB Output is correct
39 Correct 303 ms 2124 KB Output is correct
40 Correct 248 ms 2132 KB Output is correct
41 Correct 525 ms 2136 KB Output is correct
42 Correct 365 ms 2544 KB Output is correct
43 Correct 357 ms 2556 KB Output is correct
44 Correct 765 ms 2500 KB Output is correct
45 Correct 431 ms 3020 KB Output is correct
46 Correct 440 ms 3020 KB Output is correct
47 Correct 894 ms 3020 KB Output is correct
48 Correct 539 ms 3532 KB Output is correct
49 Correct 540 ms 3540 KB Output is correct
50 Correct 935 ms 3556 KB Output is correct
51 Correct 814 ms 4232 KB Output is correct
52 Correct 692 ms 4092 KB Output is correct
53 Execution timed out 1086 ms 4092 KB Time limit exceeded
54 Correct 798 ms 4828 KB Output is correct
55 Correct 695 ms 4696 KB Output is correct
56 Execution timed out 1095 ms 4684 KB Time limit exceeded
57 Correct 887 ms 5336 KB Output is correct
58 Correct 838 ms 5400 KB Output is correct
59 Execution timed out 1096 ms 5332 KB Time limit exceeded
60 Execution timed out 1065 ms 6104 KB Time limit exceeded
61 Execution timed out 1000 ms 6032 KB Time limit exceeded
62 Execution timed out 1093 ms 6040 KB Time limit exceeded
63 Execution timed out 1092 ms 6044 KB Time limit exceeded
64 Execution timed out 1088 ms 6168 KB Time limit exceeded
65 Execution timed out 1095 ms 6060 KB Time limit exceeded
66 Execution timed out 1088 ms 6168 KB Time limit exceeded
67 Execution timed out 1084 ms 6228 KB Time limit exceeded
68 Execution timed out 1091 ms 6060 KB Time limit exceeded
69 Execution timed out 1018 ms 5964 KB Time limit exceeded
70 Execution timed out 1032 ms 6068 KB Time limit exceeded
71 Execution timed out 1057 ms 6084 KB Time limit exceeded
72 Execution timed out 1035 ms 6060 KB Time limit exceeded
73 Execution timed out 1101 ms 6340 KB Time limit exceeded
74 Execution timed out 1086 ms 6368 KB Time limit exceeded
75 Execution timed out 1094 ms 6492 KB Time limit exceeded
76 Execution timed out 1091 ms 6480 KB Time limit exceeded
77 Execution timed out 1094 ms 6368 KB Time limit exceeded
78 Execution timed out 1100 ms 6324 KB Time limit exceeded
79 Execution timed out 1073 ms 6328 KB Time limit exceeded
80 Execution timed out 1091 ms 6332 KB Time limit exceeded
81 Execution timed out 1059 ms 6300 KB Time limit exceeded
82 Execution timed out 1060 ms 6220 KB Time limit exceeded
83 Execution timed out 1092 ms 6408 KB Time limit exceeded
84 Execution timed out 1090 ms 6408 KB Time limit exceeded
85 Execution timed out 1087 ms 6492 KB Time limit exceeded
86 Execution timed out 1095 ms 6352 KB Time limit exceeded
87 Execution timed out 1094 ms 6284 KB Time limit exceeded
88 Execution timed out 1086 ms 6224 KB Time limit exceeded
89 Execution timed out 1092 ms 6344 KB Time limit exceeded
90 Execution timed out 1095 ms 6220 KB Time limit exceeded
91 Execution timed out 1095 ms 6220 KB Time limit exceeded
92 Execution timed out 1088 ms 6336 KB Time limit exceeded