답안 #399453

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
399453	2021-05-05T20:33:25 Z	ruadhan	Mecho (IOI09_mecho)	C++17	73 / 100	276 ms	6500 KB

mecho

#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] = 0;
    }
    queue<array<int, 4>> q;
    processed[mecho.x][mecho.y] = 1;
    q.push({mecho.x, mecho.y, t, 0});
    while (!q.empty())
    {
        auto curr = q.front();
        // cout << "new queue top " << '\n';
        // cout << curr[X] << " " << curr[Y] << " " << curr[TIME] << " " << curr[STEPS] << '\n';
        q.pop();
        for (auto d : dirs)
        {
            int i = curr[X] + d.x, j = curr[Y] + d.y;
            int new_steps = (curr[STEPS] + 1) % S;
            int time = curr[TIME] + (new_steps == 0);
            if (i < 0 || i >= N || j < 0 || j >= N || grid[i][j] == 'T' || bees_time[i][j] <= time || processed[i][j] == 1)
                continue;
            // cout << "we can go to " << i << ", " << j << ", with time = " << time << ", and stps = " << new_steps << '\n';
            processed[i][j] = 1;
            q.push({i, j, time, new_steps});
        }
    }
    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(3) << '\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	2764 KB	Output isn't correct
5	Correct	2 ms	2764 KB	Output is correct
6	Incorrect	2 ms	2764 KB	Output isn't correct
7	Incorrect	159 ms	6244 KB	Output isn't correct
8	Correct	2 ms	2896 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	2 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	3 ms	2892 KB	Output is correct
22	Correct	2 ms	2892 KB	Output is correct
23	Correct	2 ms	2892 KB	Output is correct
24	Correct	2 ms	3020 KB	Output is correct
25	Correct	2 ms	3020 KB	Output is correct
26	Correct	2 ms	3020 KB	Output is correct
27	Correct	2 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	3020 KB	Output is correct
32	Correct	3 ms	3020 KB	Output is correct
33	Correct	10 ms	4044 KB	Output is correct
34	Correct	13 ms	4024 KB	Output is correct
35	Correct	38 ms	4056 KB	Output is correct
36	Correct	14 ms	4312 KB	Output is correct
37	Correct	16 ms	4300 KB	Output is correct
38	Correct	47 ms	4300 KB	Output is correct
39	Correct	16 ms	4428 KB	Output is correct
40	Correct	18 ms	4428 KB	Output is correct
41	Correct	59 ms	4492 KB	Output is correct
42	Correct	19 ms	4812 KB	Output is correct
43	Correct	20 ms	4812 KB	Output is correct
44	Correct	75 ms	4908 KB	Output is correct
45	Correct	26 ms	5124 KB	Output is correct
46	Correct	30 ms	5052 KB	Output is correct
47	Correct	88 ms	5120 KB	Output is correct
48	Correct	26 ms	5324 KB	Output is correct
49	Correct	28 ms	5196 KB	Output is correct
50	Correct	108 ms	5328 KB	Output is correct
51	Correct	30 ms	5400 KB	Output is correct
52	Correct	34 ms	5524 KB	Output is correct
53	Correct	136 ms	5572 KB	Output is correct
54	Correct	34 ms	5708 KB	Output is correct
55	Correct	37 ms	5708 KB	Output is correct
56	Correct	153 ms	5696 KB	Output is correct
57	Correct	39 ms	5828 KB	Output is correct
58	Correct	46 ms	5880 KB	Output is correct
59	Correct	173 ms	5892 KB	Output is correct
60	Correct	52 ms	6052 KB	Output is correct
61	Correct	56 ms	6084 KB	Output is correct
62	Correct	205 ms	6136 KB	Output is correct
63	Correct	145 ms	6140 KB	Output is correct
64	Correct	276 ms	6212 KB	Output is correct
65	Correct	211 ms	6052 KB	Output is correct
66	Correct	194 ms	6132 KB	Output is correct
67	Correct	167 ms	6140 KB	Output is correct
68	Correct	78 ms	6160 KB	Output is correct
69	Correct	75 ms	6076 KB	Output is correct
70	Correct	61 ms	6084 KB	Output is correct
71	Correct	65 ms	6132 KB	Output is correct
72	Incorrect	97 ms	6080 KB	Output isn't correct
73	Incorrect	138 ms	6468 KB	Output isn't correct
74	Correct	99 ms	6340 KB	Output is correct
75	Correct	127 ms	6340 KB	Output is correct
76	Correct	114 ms	6340 KB	Output is correct
77	Correct	131 ms	6476 KB	Output is correct
78	Correct	126 ms	6396 KB	Output is correct
79	Correct	87 ms	6312 KB	Output is correct
80	Correct	104 ms	6340 KB	Output is correct
81	Correct	134 ms	6500 KB	Output is correct
82	Correct	111 ms	6316 KB	Output is correct
83	Correct	128 ms	6352 KB	Output is correct
84	Correct	126 ms	6228 KB	Output is correct
85	Correct	143 ms	6472 KB	Output is correct
86	Correct	135 ms	6344 KB	Output is correct
87	Correct	148 ms	6368 KB	Output is correct
88	Correct	134 ms	6292 KB	Output is correct
89	Correct	156 ms	6272 KB	Output is correct
90	Correct	147 ms	6272 KB	Output is correct
91	Correct	176 ms	6220 KB	Output is correct
92	Correct	142 ms	6212 KB	Output is correct