oj.uz

답안 #399476

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
399476 2021-05-05T21:31:00 Z ruadhan Mecho (IOI09_mecho) C++17
84 / 100
 267 ms 7280 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' || grid[i][j] == 'M' || 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;
    }

    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
84.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2768 KB Output is correct
2 Correct 2 ms 2764 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 2764 KB Output is correct
6 Correct 3 ms 2892 KB Output is correct
7 Correct 153 ms 6784 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 2 ms 3020 KB Output isn't correct
13 Incorrect 3 ms 3020 KB Output isn't correct
14 Correct 3 ms 3020 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 2892 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 3 ms 3020 KB Output is correct
25 Correct 3 ms 3020 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 2984 KB Output is correct
31 Correct 3 ms 3024 KB Output is correct
32 Correct 3 ms 3024 KB Output is correct
33 Correct 10 ms 4172 KB Output is correct
34 Correct 11 ms 4172 KB Output is correct
35 Correct 36 ms 4240 KB Output is correct
36 Correct 12 ms 4428 KB Output is correct
37 Correct 13 ms 4412 KB Output is correct
38 Correct 45 ms 4428 KB Output is correct
39 Correct 13 ms 4648 KB Output is correct
40 Correct 15 ms 4684 KB Output is correct
41 Correct 56 ms 4696 KB Output is correct
42 Correct 17 ms 5120 KB Output is correct
43 Correct 18 ms 5084 KB Output is correct
44 Correct 69 ms 5068 KB Output is correct
45 Correct 22 ms 5324 KB Output is correct
46 Correct 22 ms 5420 KB Output is correct
47 Correct 82 ms 5324 KB Output is correct
48 Correct 23 ms 5568 KB Output is correct
49 Correct 25 ms 5676 KB Output is correct
50 Correct 106 ms 5588 KB Output is correct
51 Correct 29 ms 5956 KB Output is correct
52 Correct 26 ms 5928 KB Output is correct
53 Correct 121 ms 5936 KB Output is correct
54 Correct 30 ms 6176 KB Output is correct
55 Correct 29 ms 6212 KB Output is correct
56 Correct 139 ms 6084 KB Output is correct
57 Correct 35 ms 6424 KB Output is correct
58 Correct 38 ms 6436 KB Output is correct
59 Correct 165 ms 6664 KB Output is correct
60 Correct 43 ms 6692 KB Output is correct
61 Correct 45 ms 6676 KB Output is correct
62 Correct 183 ms 6728 KB Output is correct
63 Correct 136 ms 6760 KB Output is correct
64 Correct 267 ms 6756 KB Output is correct
65 Correct 201 ms 6724 KB Output is correct
66 Correct 182 ms 6764 KB Output is correct
67 Correct 158 ms 6736 KB Output is correct
68 Correct 72 ms 6724 KB Output is correct
69 Correct 68 ms 6724 KB Output is correct
70 Correct 55 ms 6704 KB Output is correct
71 Correct 58 ms 6724 KB Output is correct
72 Incorrect 93 ms 6708 KB Output isn't correct
73 Incorrect 131 ms 7108 KB Output isn't correct
74 Correct 94 ms 7056 KB Output is correct
75 Correct 120 ms 6980 KB Output is correct
76 Correct 108 ms 6952 KB Output is correct
77 Correct 123 ms 7280 KB Output is correct
78 Correct 119 ms 7020 KB Output is correct
79 Correct 80 ms 6932 KB Output is correct
80 Correct 97 ms 6988 KB Output is correct
81 Correct 123 ms 6940 KB Output is correct
82 Correct 105 ms 6996 KB Output is correct
83 Correct 122 ms 6980 KB Output is correct
84 Correct 119 ms 6900 KB Output is correct
85 Correct 140 ms 6980 KB Output is correct
86 Correct 126 ms 7036 KB Output is correct
87 Correct 144 ms 7012 KB Output is correct
88 Correct 124 ms 6840 KB Output is correct
89 Correct 141 ms 6808 KB Output is correct
90 Correct 137 ms 6932 KB Output is correct
91 Correct 168 ms 6816 KB Output is correct
92 Correct 135 ms 6876 KB Output is correct