Submission #312967

# Submission time Handle Problem Language Result Execution time Memory
312967 2020-10-14T20:31:12 Z fergonzgut21 Mecho (IOI09_mecho) C++14
67 / 100
1000 ms 9336 KB
#include <iostream>
#include <queue>
#define MAX 802
using namespace std;

struct bee
{
    short int x;
    short int y;
    int t;
    int r;
};

int N, S, sx, sy, ex, ey, B[MAX][MAX], vis[MAX][MAX][2], rilres = -1;
char A[MAX][MAX];
queue <bee> qiu;
bee temp;

void solve ()
{
    while (!qiu.empty())
    {
        temp = qiu.front();
        qiu.pop();
        temp.t++;
        if (temp.t > N * N / 3)
        {
            return;
        }
        if (B[temp.x - 1][temp.y] == -1 && A[temp.x - 1][temp.y] != 'T' && A[temp.x - 1][temp.y] != 'D')
        {
            B[temp.x - 1][temp.y] = temp.t;
            temp.x--;
            qiu.push(temp);
            temp.x++;
        }
        if (B[temp.x + 1][temp.y] == -1 && A[temp.x + 1][temp.y] != 'T' && A[temp.x + 1][temp.y] != 'D')
        {
            B[temp.x + 1][temp.y] = temp.t;
            temp.x++;
            qiu.push(temp);
            temp.x--;
        }
        if (B[temp.x][temp.y - 1] == -1 && A[temp.x][temp.y - 1] != 'T' && A[temp.x][temp.y - 1] != 'D')
        {
            B[temp.x][temp.y - 1] = temp.t;
            temp.y--;
            qiu.push(temp);
            temp.y++;
        }
        if (B[temp.x][temp.y + 1] == -1 && A[temp.x][temp.y + 1] != 'T' && A[temp.x][temp.y + 1] != 'D')
        {
            B[temp.x][temp.y + 1] = temp.t;
            temp.y++;
            qiu.push(temp);
            temp.y--;
        }
    }
}

int solve2(int x, int y, int t, int r)
{
    temp.x = x;
    temp.y = y;
    temp.t = t;
    temp.r = r;
    qiu.push(temp);
    while (!qiu.empty())
    {
        temp = qiu.front();
        qiu.pop();
        if (temp.x == ex && temp.y == ey)
            rilres = max(rilres,temp.r);
        if (vis[temp.x][temp.y][1] != temp.r && (temp.x != sx || temp.y != sy))
            continue;
        if (vis[temp.x][temp.y][0] != temp.t && (temp.x != sx || temp.y != sy))
            continue;
        if (temp.r + (temp.t / S) >= B[temp.x][temp.y])
            temp.r -= ((temp.r + (temp.t / S)) - B[temp.x][temp.y] + 1);
        if (temp.r < 0 || temp.r <= rilres)
            continue;
        temp.t++;
        if (vis[temp.x + 1][temp.y][1] < temp.r && A[temp.x + 1][temp.y] != 'T')
        {
                vis[temp.x + 1][temp.y][1] = temp.r;
                vis[temp.x + 1][temp.y][0] = temp.t;
                temp.x++;
                qiu.push(temp);
                temp.x--;
        }
        if (vis[temp.x - 1][temp.y][1] < temp.r && A[temp.x - 1][temp.y] != 'T')
        {
                vis[temp.x - 1][temp.y][1] = temp.r;
                vis[temp.x - 1][temp.y][0] = temp.t;
                temp.x--;
                qiu.push(temp);
                temp.x++;
        }
        if (vis[temp.x][temp.y + 1][1] < temp.r && A[temp.x][temp.y + 1] != 'T')
        {
                vis[temp.x][temp.y + 1][1] = temp.r;
                vis[temp.x][temp.y + 1][0] = temp.t;
                temp.y++;
                qiu.push(temp);
                temp.y--;
        }
        if (vis[temp.x][temp.y - 1][1] < temp.r && A[temp.x][temp.y - 1] != 'T')
        {
                vis[temp.x][temp.y - 1][1] = temp.r;
                vis[temp.x][temp.y - 1][0] = temp.t;
                temp.y--;
                qiu.push(temp);
                temp.y++;
        }
    }
    return -1;
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> S;
    for (int i = 1; i <= N; i++)
        for (int j = 1; j <= N; j++)
        {
            cin >> A[i][j];
            vis[i][j][1] = -1;
            vis[i][j][0] = 32700;
            B[i][j] = -1;
            if (A[i][j] == 'M')
            {
                sx = i;
                sy = j;
            }
            if (A[i][j] == 'D')
            {
                ex = i;
                ey = j;
            }
            if (A[i][j] == 'H')
            {
                temp.x = i;
                temp.y = j;
                temp.t = 0;
                B[i][j] = 0;
                qiu.push(temp);
            }
        }
    solve();
    vis[sx][sy][1] = 32700;
    vis[sx][sy][0] = 0;
    solve2(sx, sy, 0, B[sx][sy] - 1);
    cout << rilres;
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 45 ms 8704 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 0 ms 512 KB Output is correct
12 Correct 1 ms 896 KB Output is correct
13 Correct 1 ms 768 KB Output is correct
14 Correct 1 ms 896 KB Output is correct
15 Incorrect 0 ms 512 KB Output isn't correct
16 Correct 0 ms 512 KB Output is correct
17 Incorrect 0 ms 512 KB Output isn't correct
18 Correct 1 ms 512 KB Output is correct
19 Incorrect 1 ms 640 KB Output isn't correct
20 Correct 1 ms 640 KB Output is correct
21 Incorrect 1 ms 640 KB Output isn't correct
22 Correct 1 ms 640 KB Output is correct
23 Incorrect 1 ms 768 KB Output isn't correct
24 Correct 1 ms 768 KB Output is correct
25 Incorrect 1 ms 896 KB Output isn't correct
26 Correct 1 ms 896 KB Output is correct
27 Incorrect 1 ms 896 KB Output isn't correct
28 Correct 1 ms 896 KB Output is correct
29 Incorrect 1 ms 896 KB Output isn't correct
30 Correct 1 ms 896 KB Output is correct
31 Incorrect 1 ms 1024 KB Output isn't correct
32 Correct 1 ms 1024 KB Output is correct
33 Incorrect 5 ms 3968 KB Output isn't correct
34 Correct 5 ms 3968 KB Output is correct
35 Correct 99 ms 4088 KB Output is correct
36 Incorrect 6 ms 4480 KB Output isn't correct
37 Correct 6 ms 4480 KB Output is correct
38 Correct 148 ms 4728 KB Output is correct
39 Incorrect 8 ms 4992 KB Output isn't correct
40 Correct 8 ms 4992 KB Output is correct
41 Correct 212 ms 5112 KB Output is correct
42 Incorrect 9 ms 5504 KB Output isn't correct
43 Correct 9 ms 5504 KB Output is correct
44 Correct 292 ms 5752 KB Output is correct
45 Incorrect 10 ms 5888 KB Output isn't correct
46 Correct 10 ms 6016 KB Output is correct
47 Correct 394 ms 6392 KB Output is correct
48 Incorrect 14 ms 6400 KB Output isn't correct
49 Correct 12 ms 6528 KB Output is correct
50 Correct 511 ms 7068 KB Output is correct
51 Incorrect 15 ms 6912 KB Output isn't correct
52 Correct 16 ms 7040 KB Output is correct
53 Correct 659 ms 7568 KB Output is correct
54 Incorrect 16 ms 7424 KB Output isn't correct
55 Correct 16 ms 7552 KB Output is correct
56 Correct 822 ms 8184 KB Output is correct
57 Incorrect 18 ms 7936 KB Output isn't correct
58 Correct 18 ms 7936 KB Output is correct
59 Execution timed out 1026 ms 8696 KB Time limit exceeded
60 Incorrect 20 ms 8576 KB Output isn't correct
61 Correct 20 ms 8448 KB Output is correct
62 Execution timed out 1094 ms 9336 KB Time limit exceeded
63 Correct 44 ms 8448 KB Output is correct
64 Correct 48 ms 8696 KB Output is correct
65 Correct 46 ms 8576 KB Output is correct
66 Correct 45 ms 8556 KB Output is correct
67 Correct 42 ms 8448 KB Output is correct
68 Correct 37 ms 8696 KB Output is correct
69 Correct 38 ms 8576 KB Output is correct
70 Correct 37 ms 8576 KB Output is correct
71 Correct 35 ms 8576 KB Output is correct
72 Correct 32 ms 8576 KB Output is correct
73 Correct 37 ms 8960 KB Output is correct
74 Correct 54 ms 8960 KB Output is correct
75 Correct 37 ms 8960 KB Output is correct
76 Correct 36 ms 8960 KB Output is correct
77 Correct 36 ms 8960 KB Output is correct
78 Correct 38 ms 8832 KB Output is correct
79 Correct 198 ms 8832 KB Output is correct
80 Correct 50 ms 8952 KB Output is correct
81 Correct 38 ms 8832 KB Output is correct
82 Correct 66 ms 8832 KB Output is correct
83 Correct 40 ms 8832 KB Output is correct
84 Correct 69 ms 8832 KB Output is correct
85 Correct 115 ms 8944 KB Output is correct
86 Correct 143 ms 8832 KB Output is correct
87 Correct 52 ms 8824 KB Output is correct
88 Correct 88 ms 8704 KB Output is correct
89 Correct 270 ms 8952 KB Output is correct
90 Correct 42 ms 8704 KB Output is correct
91 Correct 57 ms 8704 KB Output is correct
92 Correct 44 ms 8704 KB Output is correct