oj.uz

Submission #491023

# Submission time Handle Problem Language Result Execution time Memory
491023 2021-11-30T04:38:21 Z sberens Mecho (IOI09_mecho) C++17
58 / 100
 1000 ms 6564 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;
                    }
                }
            }
            swap(bees, nextbees);
//            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;
                        }
                    }
                }
                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 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 1095 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 1 ms 204 KB Output is correct
12 Correct 3 ms 332 KB Output is correct
13 Correct 5 ms 332 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 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 2 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 332 KB Output is correct
26 Correct 4 ms 332 KB Output is correct
27 Correct 7 ms 332 KB Output is correct
28 Correct 4 ms 332 KB Output is correct
29 Correct 4 ms 332 KB Output is correct
30 Correct 5 ms 360 KB Output is correct
31 Correct 6 ms 332 KB Output is correct
32 Correct 5 ms 332 KB Output is correct
33 Correct 156 ms 1404 KB Output is correct
34 Correct 144 ms 1440 KB Output is correct
35 Correct 271 ms 1356 KB Output is correct
36 Correct 210 ms 1740 KB Output is correct
37 Correct 202 ms 1740 KB Output is correct
38 Correct 423 ms 1908 KB Output is correct
39 Correct 263 ms 2124 KB Output is correct
40 Correct 239 ms 2128 KB Output is correct
41 Correct 491 ms 2248 KB Output is correct
42 Correct 328 ms 2556 KB Output is correct
43 Correct 328 ms 2580 KB Output is correct
44 Correct 597 ms 2560 KB Output is correct
45 Correct 416 ms 3020 KB Output is correct
46 Correct 421 ms 3176 KB Output is correct
47 Correct 821 ms 3032 KB Output is correct
48 Correct 511 ms 3608 KB Output is correct
49 Correct 509 ms 3596 KB Output is correct
50 Correct 880 ms 3556 KB Output is correct
51 Correct 580 ms 4092 KB Output is correct
52 Correct 569 ms 4108 KB Output is correct
53 Execution timed out 1091 ms 4092 KB Time limit exceeded
54 Correct 693 ms 4860 KB Output is correct
55 Correct 636 ms 4716 KB Output is correct
56 Execution timed out 1087 ms 4716 KB Time limit exceeded
57 Correct 803 ms 5404 KB Output is correct
58 Correct 756 ms 5396 KB Output is correct
59 Execution timed out 1091 ms 5348 KB Time limit exceeded
60 Correct 968 ms 6220 KB Output is correct
61 Correct 862 ms 6040 KB Output is correct
62 Execution timed out 1094 ms 5956 KB Time limit exceeded
63 Execution timed out 1063 ms 6120 KB Time limit exceeded
64 Execution timed out 1090 ms 6180 KB Time limit exceeded
65 Execution timed out 1094 ms 6016 KB Time limit exceeded
66 Execution timed out 1079 ms 6180 KB Time limit exceeded
67 Execution timed out 1088 ms 6136 KB Time limit exceeded
68 Execution timed out 1093 ms 6072 KB Time limit exceeded
69 Correct 965 ms 6100 KB Output is correct
70 Execution timed out 1016 ms 6084 KB Time limit exceeded
71 Execution timed out 1065 ms 6068 KB Time limit exceeded
72 Execution timed out 1012 ms 6064 KB Time limit exceeded
73 Execution timed out 1095 ms 6368 KB Time limit exceeded
74 Execution timed out 1098 ms 6480 KB Time limit exceeded
75 Execution timed out 1087 ms 6456 KB Time limit exceeded
76 Execution timed out 1088 ms 6564 KB Time limit exceeded
77 Execution timed out 1090 ms 6500 KB Time limit exceeded
78 Execution timed out 1096 ms 6328 KB Time limit exceeded
79 Execution timed out 1094 ms 6324 KB Time limit exceeded
80 Execution timed out 1098 ms 6440 KB Time limit exceeded
81 Execution timed out 1093 ms 6356 KB Time limit exceeded
82 Execution timed out 1083 ms 6296 KB Time limit exceeded
83 Execution timed out 1093 ms 6388 KB Time limit exceeded
84 Execution timed out 1100 ms 6256 KB Time limit exceeded
85 Execution timed out 1095 ms 6312 KB Time limit exceeded
86 Execution timed out 1088 ms 6300 KB Time limit exceeded
87 Execution timed out 1087 ms 6336 KB Time limit exceeded
88 Execution timed out 1086 ms 6220 KB Time limit exceeded
89 Execution timed out 1092 ms 6216 KB Time limit exceeded
90 Execution timed out 1090 ms 6220 KB Time limit exceeded
91 Execution timed out 1089 ms 6312 KB Time limit exceeded
92 Execution timed out 1080 ms 6420 KB Time limit exceeded