답안 #312974

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
312974	2020-10-14T20:52:09 Z	fergonzgut21	Mecho (IOI09_mecho)	C++14	97 / 100	1000 ms	6904 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], 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.x > 0 && 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 (temp.x < N && 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 (temp.y > 0 && 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 (temp.y < N && 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.t > N * N / 2)
        {
            return 0;
        }
        if (temp.x == ex && temp.y == ey)
            rilres = max(rilres,temp.r);
        if (vis[temp.x][temp.y] != temp.r && (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 (temp.x < N && vis[temp.x + 1][temp.y] < temp.r && A[temp.x + 1][temp.y] != 'T')
        {
                vis[temp.x + 1][temp.y] = temp.r;
                temp.x++;
                qiu.push(temp);
                temp.x--;
        }
        if (temp.x > 0 && vis[temp.x - 1][temp.y] < temp.r && A[temp.x - 1][temp.y] != 'T')
        {
                vis[temp.x - 1][temp.y] = temp.r;
                temp.x--;
                qiu.push(temp);
                temp.x++;
        }
        if (temp.y < N && vis[temp.x][temp.y + 1] < temp.r && A[temp.x][temp.y + 1] != 'T')
        {
                vis[temp.x][temp.y + 1] = temp.r;
                temp.y++;
                qiu.push(temp);
                temp.y--;
        }
        if (temp.y > 0 && vis[temp.x][temp.y - 1] < temp.r && A[temp.x][temp.y - 1] != 'T')
        {
                vis[temp.x][temp.y - 1] = temp.r;
                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;
            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] = 32000;
    solve2(sx, sy, 0, B[sx][sy] - 1);
    cout << rilres;
    return 0;
}

Subtask #1

97.0 / 100.0

#	결과	실행 시간	메모리	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	0 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	41 ms	6144 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	416 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	1 ms	768 KB	Output is correct
13	Correct	1 ms	768 KB	Output is correct
14	Correct	1 ms	768 KB	Output is correct
15	Correct	1 ms	512 KB	Output is correct
16	Correct	0 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	768 KB	Output is correct
26	Correct	1 ms	768 KB	Output is correct
27	Correct	1 ms	768 KB	Output is correct
28	Correct	1 ms	768 KB	Output is correct
29	Correct	1 ms	896 KB	Output is correct
30	Correct	1 ms	896 KB	Output is correct
31	Correct	1 ms	896 KB	Output is correct
32	Correct	1 ms	896 KB	Output is correct
33	Correct	5 ms	2816 KB	Output is correct
34	Correct	4 ms	2816 KB	Output is correct
35	Correct	98 ms	3064 KB	Output is correct
36	Correct	6 ms	3200 KB	Output is correct
37	Correct	5 ms	3200 KB	Output is correct
38	Correct	144 ms	3324 KB	Output is correct
39	Correct	7 ms	3584 KB	Output is correct
40	Correct	7 ms	3456 KB	Output is correct
41	Correct	213 ms	3916 KB	Output is correct
42	Correct	9 ms	3840 KB	Output is correct
43	Correct	8 ms	3840 KB	Output is correct
44	Correct	288 ms	4088 KB	Output is correct
45	Correct	10 ms	4224 KB	Output is correct
46	Correct	9 ms	4224 KB	Output is correct
47	Correct	381 ms	4472 KB	Output is correct
48	Correct	12 ms	4608 KB	Output is correct
49	Correct	11 ms	4608 KB	Output is correct
50	Correct	503 ms	5108 KB	Output is correct
51	Correct	14 ms	4992 KB	Output is correct
52	Correct	12 ms	4992 KB	Output is correct
53	Correct	648 ms	5368 KB	Output is correct
54	Correct	16 ms	5248 KB	Output is correct
55	Correct	14 ms	5248 KB	Output is correct
56	Correct	799 ms	5984 KB	Output is correct
57	Correct	18 ms	5632 KB	Output is correct
58	Correct	16 ms	5632 KB	Output is correct
59	Correct	972 ms	6412 KB	Output is correct
60	Correct	20 ms	6016 KB	Output is correct
61	Correct	18 ms	6016 KB	Output is correct
62	Execution timed out	1089 ms	6904 KB	Time limit exceeded
63	Correct	43 ms	6016 KB	Output is correct
64	Correct	45 ms	6016 KB	Output is correct
65	Correct	44 ms	6016 KB	Output is correct
66	Correct	43 ms	6016 KB	Output is correct
67	Correct	37 ms	6016 KB	Output is correct
68	Correct	34 ms	6016 KB	Output is correct
69	Correct	35 ms	6016 KB	Output is correct
70	Correct	33 ms	6016 KB	Output is correct
71	Correct	33 ms	6016 KB	Output is correct
72	Correct	30 ms	6096 KB	Output is correct
73	Correct	32 ms	6400 KB	Output is correct
74	Correct	49 ms	6520 KB	Output is correct
75	Correct	33 ms	6400 KB	Output is correct
76	Correct	33 ms	6400 KB	Output is correct
77	Correct	35 ms	6400 KB	Output is correct
78	Correct	37 ms	6400 KB	Output is correct
79	Correct	185 ms	6400 KB	Output is correct
80	Correct	47 ms	6400 KB	Output is correct
81	Correct	36 ms	6400 KB	Output is correct
82	Correct	62 ms	6400 KB	Output is correct
83	Correct	37 ms	6272 KB	Output is correct
84	Correct	67 ms	6272 KB	Output is correct
85	Correct	110 ms	6272 KB	Output is correct
86	Correct	137 ms	6400 KB	Output is correct
87	Correct	48 ms	6272 KB	Output is correct
88	Correct	86 ms	6400 KB	Output is correct
89	Correct	256 ms	6272 KB	Output is correct
90	Correct	42 ms	6272 KB	Output is correct
91	Correct	54 ms	6228 KB	Output is correct
92	Correct	39 ms	6272 KB	Output is correct