oj.uz

답안 #399470

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
399470 2021-05-05T21:05:05 Z ruadhan Mecho (IOI09_mecho) C++17
73 / 100
 252 ms 7184 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 || 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
73.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2764 KB Output is correct
2 Incorrect 2 ms 2764 KB Output isn't correct
3 Correct 2 ms 2764 KB Output is correct
4 Incorrect 2 ms 2768 KB Output isn't correct
5 Correct 2 ms 2764 KB Output is correct
6 Incorrect 2 ms 2892 KB Output isn't correct
7 Incorrect 149 ms 6812 KB Output isn't 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 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 2 ms 2892 KB Output is correct
23 Correct 2 ms 3020 KB Output is correct
24 Correct 3 ms 2892 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 3020 KB Output is correct
31 Correct 3 ms 3028 KB Output is correct
32 Correct 3 ms 3020 KB Output is correct
33 Correct 10 ms 4256 KB Output is correct
34 Correct 9 ms 4172 KB Output is correct
35 Correct 34 ms 4256 KB Output is correct
36 Correct 13 ms 4476 KB Output is correct
37 Correct 13 ms 4376 KB Output is correct
38 Correct 43 ms 4380 KB Output is correct
39 Correct 14 ms 4648 KB Output is correct
40 Correct 15 ms 4684 KB Output is correct
41 Correct 55 ms 4684 KB Output is correct
42 Correct 17 ms 5172 KB Output is correct
43 Correct 17 ms 5068 KB Output is correct
44 Correct 67 ms 5068 KB Output is correct
45 Correct 24 ms 5452 KB Output is correct
46 Correct 23 ms 5296 KB Output is correct
47 Correct 81 ms 5396 KB Output is correct
48 Correct 22 ms 5584 KB Output is correct
49 Correct 25 ms 5572 KB Output is correct
50 Correct 96 ms 5584 KB Output is correct
51 Correct 26 ms 5944 KB Output is correct
52 Correct 27 ms 5864 KB Output is correct
53 Correct 130 ms 5832 KB Output is correct
54 Correct 29 ms 6192 KB Output is correct
55 Correct 30 ms 6100 KB Output is correct
56 Correct 139 ms 6084 KB Output is correct
57 Correct 34 ms 6420 KB Output is correct
58 Correct 38 ms 6468 KB Output is correct
59 Correct 163 ms 6568 KB Output is correct
60 Correct 41 ms 6732 KB Output is correct
61 Correct 46 ms 6752 KB Output is correct
62 Correct 180 ms 6764 KB Output is correct
63 Correct 136 ms 6756 KB Output is correct
64 Correct 252 ms 6672 KB Output is correct
65 Correct 195 ms 6756 KB Output is correct
66 Correct 179 ms 6724 KB Output is correct
67 Correct 147 ms 6672 KB Output is correct
68 Correct 71 ms 6776 KB Output is correct
69 Correct 67 ms 6764 KB Output is correct
70 Correct 55 ms 6724 KB Output is correct
71 Correct 57 ms 6724 KB Output is correct
72 Incorrect 95 ms 6700 KB Output isn't correct
73 Incorrect 128 ms 6964 KB Output isn't correct
74 Correct 93 ms 6956 KB Output is correct
75 Correct 121 ms 6944 KB Output is correct
76 Correct 110 ms 6980 KB Output is correct
77 Correct 125 ms 7184 KB Output is correct
78 Correct 120 ms 7028 KB Output is correct
79 Correct 78 ms 6980 KB Output is correct
80 Correct 99 ms 7028 KB Output is correct
81 Correct 120 ms 7024 KB Output is correct
82 Correct 105 ms 7132 KB Output is correct
83 Correct 120 ms 6980 KB Output is correct
84 Correct 115 ms 6956 KB Output is correct
85 Correct 140 ms 6980 KB Output is correct
86 Correct 126 ms 6984 KB Output is correct
87 Correct 139 ms 6932 KB Output is correct
88 Correct 122 ms 6872 KB Output is correct
89 Correct 136 ms 6836 KB Output is correct
90 Correct 142 ms 6980 KB Output is correct
91 Correct 160 ms 6864 KB Output is correct
92 Correct 132 ms 6860 KB Output is correct