oj.uz

Submission #401054

# Submission time Handle Problem Language Result Execution time Memory
401054 2021-05-09T09:29:56 Z ruadhan Mecho (IOI09_mecho) C++17
95 / 100
 252 ms 7120 KB 
#include <bits/stdc++.h>
#define sz(x) (int)x.size()
#define x first
#define y second
#define X 0
#define Y 1
#define TIME 2
#define STEPS 3
using namespace std;
typedef pair<int, int> pi;

const int MX = 805;
string grid[MX];
int bees_time[MX][MX];
int N, S;

vector<pi> hives;
vector<pi> dirs = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
void calc_bee_times()
{
    queue<pi> q;
    for (auto i : hives)
    {
        q.push(i);
        bees_time[i.x][i.y] = 0;
    }
    while (!q.empty())
    {
        auto curr = q.front();
        q.pop();
        for (auto d : dirs)
        {
            int i = curr.x + d.x, j = curr.y + d.y;
            if (i < 0 || i >= N || j < 0 || j >= N || grid[i][j] == 'T' || bees_time[i][j] != -1)
                continue;
            bees_time[i][j] = bees_time[curr.x][curr.y] + 1;
            q.push({i, j});
        }
    }
}

pi mecho, home;
int processed[MX][MX];
bool ok(int t)
{
    for (int i = 0; i < N; i++)
    {
        for (int j = 0; j < N; j++)
            processed[i][j] = -1;
    }

    if (bees_time[mecho.x][mecho.y] <= t)
        return false;

    queue<pi> q;
    processed[mecho.x][mecho.y] = 0;

    q.push(mecho);
    while (!q.empty())
    {
        auto curr = q.front();

        // cout << "new queue top = " << curr.x << " " << curr.y << ", d=" << processed[curr.x][curr.y] << '\n';

        q.pop();
        for (auto d : dirs)
        {
            int i = curr.x + d.x, j = curr.y + d.y;

            if (i < 0 || i >= N || j < 0 || j >= N || grid[i][j] == 'T' || (bees_time[i][j] <= t + (processed[curr.x][curr.y] + 1) / S && make_pair(i, j) != home) || processed[i][j] != -1)
                continue;

            // cout << "we can go to " << i << ", " << j << " from here with steps = " << processed[curr.x][curr.y] + 1 << ", moves = " << (processed[curr.x][curr.y] + 1) / S << '\n';

            processed[i][j] = processed[curr.x][curr.y] + 1;
            q.push({i, j});
        }
    }
    return processed[home.x][home.y] != -1;
}

int main()
{
    cin >> N >> S;
    for (int i = 0; i < MX; i++)
        for (int j = 0; j < MX; j++)
            bees_time[i][j] = -1;

    for (int i = 0; i < N; i++)
    {
        cin >> grid[i];
        for (int j = 0; j < N; j++)
        {
            if (grid[i][j] == 'H')
                hives.push_back({i, j});
            else if (grid[i][j] == 'M')
                mecho.x = i, mecho.y = j;
            else if (grid[i][j] == 'D')
                home.x = i, home.y = j;
        }
    }

    calc_bee_times();

    // cout << ok(2) << '\n';

    // for (int i = 0; i < N; i++)
    // {
    //     for (int j = 0; j < N; j++)
    //         cout << bees_time[i][j] << " ";
    //     cout << '\n';
    // }

    int lo = 0, hi = 800 * 800;
    for (int b = hi / 2; b >= 1; b /= 2)
    {
        while (lo + b < hi && ok(lo + b))
            lo += b;
    }

    if (lo == 0 && !ok(0))
        cout << -1 << '\n';
    else
        cout << lo << '\n';

    return 0;
}

Subtask #1
95.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2764 KB Output is correct
2 Correct 2 ms 2776 KB Output is correct
3 Correct 2 ms 2764 KB Output is correct
4 Correct 2 ms 2764 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 2 ms 2892 KB Output is correct
7 Correct 153 ms 6852 KB Output is correct
8 Correct 2 ms 2892 KB Output is correct
9 Correct 2 ms 2892 KB Output is correct
10 Correct 2 ms 2892 KB Output is correct
11 Correct 2 ms 2892 KB Output is correct
12 Incorrect 3 ms 3020 KB Output isn't correct
13 Correct 3 ms 3020 KB Output is correct
14 Correct 3 ms 3028 KB Output is correct
15 Correct 2 ms 2892 KB Output is correct
16 Correct 2 ms 2892 KB Output is correct
17 Correct 2 ms 2892 KB Output is correct
18 Correct 2 ms 2900 KB Output is correct
19 Correct 2 ms 2892 KB Output is correct
20 Correct 2 ms 2892 KB Output is correct
21 Correct 2 ms 2892 KB Output is correct
22 Correct 3 ms 2892 KB Output is correct
23 Correct 3 ms 3020 KB Output is correct
24 Correct 2 ms 3020 KB Output is correct
25 Correct 3 ms 2944 KB Output is correct
26 Correct 3 ms 3020 KB Output is correct
27 Correct 3 ms 3020 KB Output is correct
28 Correct 3 ms 3020 KB Output is correct
29 Correct 3 ms 3020 KB Output is correct
30 Correct 3 ms 3024 KB Output is correct
31 Correct 3 ms 3020 KB Output is correct
32 Correct 3 ms 3020 KB Output is correct
33 Correct 10 ms 4188 KB Output is correct
34 Correct 10 ms 4156 KB Output is correct
35 Correct 34 ms 4172 KB Output is correct
36 Correct 13 ms 4428 KB Output is correct
37 Correct 13 ms 4432 KB Output is correct
38 Correct 45 ms 4444 KB Output is correct
39 Correct 14 ms 4684 KB Output is correct
40 Correct 15 ms 4696 KB Output is correct
41 Correct 55 ms 4684 KB Output is correct
42 Correct 17 ms 5072 KB Output is correct
43 Correct 18 ms 5192 KB Output is correct
44 Correct 73 ms 5148 KB Output is correct
45 Correct 21 ms 5296 KB Output is correct
46 Correct 23 ms 5348 KB Output is correct
47 Correct 89 ms 5412 KB Output is correct
48 Correct 22 ms 5568 KB Output is correct
49 Correct 22 ms 5672 KB Output is correct
50 Correct 100 ms 5580 KB Output is correct
51 Correct 25 ms 5840 KB Output is correct
52 Correct 31 ms 5828 KB Output is correct
53 Correct 122 ms 5936 KB Output is correct
54 Correct 30 ms 6196 KB Output is correct
55 Correct 30 ms 6088 KB Output is correct
56 Correct 141 ms 6192 KB Output is correct
57 Correct 34 ms 6424 KB Output is correct
58 Correct 37 ms 6436 KB Output is correct
59 Correct 165 ms 6472 KB Output is correct
60 Correct 41 ms 6732 KB Output is correct
61 Correct 46 ms 6724 KB Output is correct
62 Correct 190 ms 6760 KB Output is correct
63 Correct 136 ms 6756 KB Output is correct
64 Correct 252 ms 6764 KB Output is correct
65 Correct 196 ms 6760 KB Output is correct
66 Correct 185 ms 6684 KB Output is correct
67 Correct 150 ms 6760 KB Output is correct
68 Correct 74 ms 6792 KB Output is correct
69 Correct 68 ms 6732 KB Output is correct
70 Correct 57 ms 6704 KB Output is correct
71 Correct 61 ms 6684 KB Output is correct
72 Correct 51 ms 6700 KB Output is correct
73 Correct 52 ms 7060 KB Output is correct
74 Correct 94 ms 7056 KB Output is correct
75 Correct 120 ms 7120 KB Output is correct
76 Correct 111 ms 7084 KB Output is correct
77 Correct 121 ms 7032 KB Output is correct
78 Correct 117 ms 7028 KB Output is correct
79 Correct 79 ms 6932 KB Output is correct
80 Correct 99 ms 7040 KB Output is correct
81 Correct 119 ms 6996 KB Output is correct
82 Correct 110 ms 6988 KB Output is correct
83 Correct 125 ms 6904 KB Output is correct
84 Correct 120 ms 6880 KB Output is correct
85 Correct 142 ms 6980 KB Output is correct
86 Correct 124 ms 6980 KB Output is correct
87 Correct 141 ms 6980 KB Output is correct
88 Correct 124 ms 6924 KB Output is correct
89 Correct 143 ms 6980 KB Output is correct
90 Correct 141 ms 6980 KB Output is correct
91 Correct 165 ms 6824 KB Output is correct
92 Correct 135 ms 6932 KB Output is correct