답안 #312965

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
312965	2020-10-14T20:28:28 Z	fergonzgut21	Mecho (IOI09_mecho)	C++14	94 / 100	1000 ms	9164 KB

mecho

#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 (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()
{
    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;
}

Subtask #1

94.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	0 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	87 ms	8692 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	384 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	Correct	1 ms	512 KB	Output is correct
16	Correct	1 ms	512 KB	Output is correct
17	Correct	1 ms	512 KB	Output is correct
18	Correct	1 ms	512 KB	Output is correct
19	Correct	1 ms	512 KB	Output is correct
20	Correct	1 ms	512 KB	Output is correct
21	Correct	1 ms	640 KB	Output is correct
22	Correct	1 ms	640 KB	Output is correct
23	Correct	1 ms	768 KB	Output is correct
24	Correct	1 ms	768 KB	Output is correct
25	Correct	1 ms	896 KB	Output is correct
26	Correct	1 ms	896 KB	Output is correct
27	Correct	1 ms	896 KB	Output is correct
28	Correct	1 ms	896 KB	Output is correct
29	Correct	1 ms	896 KB	Output is correct
30	Correct	1 ms	896 KB	Output is correct
31	Correct	2 ms	1024 KB	Output is correct
32	Correct	1 ms	1024 KB	Output is correct
33	Correct	14 ms	3952 KB	Output is correct
34	Correct	13 ms	3840 KB	Output is correct
35	Correct	108 ms	4112 KB	Output is correct
36	Correct	17 ms	4480 KB	Output is correct
37	Correct	17 ms	4352 KB	Output is correct
38	Correct	159 ms	4556 KB	Output is correct
39	Correct	22 ms	4864 KB	Output is correct
40	Correct	21 ms	4856 KB	Output is correct
41	Correct	225 ms	5276 KB	Output is correct
42	Correct	27 ms	5496 KB	Output is correct
43	Correct	25 ms	5368 KB	Output is correct
44	Correct	307 ms	5628 KB	Output is correct
45	Correct	32 ms	5888 KB	Output is correct
46	Correct	31 ms	5880 KB	Output is correct
47	Correct	409 ms	6264 KB	Output is correct
48	Correct	37 ms	6392 KB	Output is correct
49	Correct	36 ms	6392 KB	Output is correct
50	Correct	536 ms	6844 KB	Output is correct
51	Correct	44 ms	6912 KB	Output is correct
52	Correct	42 ms	6904 KB	Output is correct
53	Correct	679 ms	7544 KB	Output is correct
54	Correct	50 ms	7416 KB	Output is correct
55	Correct	49 ms	7416 KB	Output is correct
56	Correct	855 ms	8180 KB	Output is correct
57	Correct	57 ms	7928 KB	Output is correct
58	Correct	55 ms	7928 KB	Output is correct
59	Execution timed out	1083 ms	8804 KB	Time limit exceeded
60	Correct	66 ms	8440 KB	Output is correct
61	Correct	62 ms	8440 KB	Output is correct
62	Execution timed out	1038 ms	9164 KB	Time limit exceeded
63	Correct	86 ms	8444 KB	Output is correct
64	Correct	89 ms	8536 KB	Output is correct
65	Correct	87 ms	8500 KB	Output is correct
66	Correct	86 ms	8440 KB	Output is correct
67	Correct	81 ms	8440 KB	Output is correct
68	Correct	79 ms	8568 KB	Output is correct
69	Correct	81 ms	8696 KB	Output is correct
70	Correct	80 ms	8568 KB	Output is correct
71	Correct	77 ms	8568 KB	Output is correct
72	Correct	76 ms	8516 KB	Output is correct
73	Correct	77 ms	8952 KB	Output is correct
74	Correct	96 ms	8824 KB	Output is correct
75	Correct	78 ms	9056 KB	Output is correct
76	Correct	80 ms	8824 KB	Output is correct
77	Correct	79 ms	8824 KB	Output is correct
78	Correct	80 ms	8828 KB	Output is correct
79	Correct	236 ms	8952 KB	Output is correct
80	Correct	90 ms	8824 KB	Output is correct
81	Correct	80 ms	8824 KB	Output is correct
82	Correct	108 ms	8824 KB	Output is correct
83	Correct	84 ms	8824 KB	Output is correct
84	Correct	112 ms	8824 KB	Output is correct
85	Correct	155 ms	8952 KB	Output is correct
86	Correct	182 ms	8944 KB	Output is correct
87	Correct	92 ms	8824 KB	Output is correct
88	Correct	132 ms	8696 KB	Output is correct
89	Correct	312 ms	8824 KB	Output is correct
90	Correct	84 ms	8696 KB	Output is correct
91	Correct	99 ms	8700 KB	Output is correct
92	Correct	85 ms	8696 KB	Output is correct