답안 #312942

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
312942	2020-10-14T19:58:16 Z	fergonzgut21	Mecho (IOI09_mecho)	C++14	91 / 100	1000 ms	9724 KB

mecho

#include <iostream>
#include <queue>
#define MAX 805
using namespace std;

struct bee
{
    int x;
    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, qiu2;
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;
    qiu2.push(temp);
    while (!qiu2.empty())
    {
        temp = qiu2.front();
        qiu2.pop();
        //cout << temp.x << " " << temp.y << " " << temp.t << " " << temp.r << endl;
        if (temp.x == ex && temp.y == ey)
            rilres = max(rilres,temp.r);
        if (temp.r + (temp.t / S) >= B[temp.x][temp.y])
            temp.r -= ((temp.r + (temp.t / S)) - B[temp.x][temp.y] + 1);
        //cout << temp.x << " " << temp.y << " " << temp.t << " " << temp.r << endl;
        if (temp.r < 0)
            continue;
        temp.t++;
        //cout << vis[temp.x][temp.y][0] << " " << vis[temp.x][temp.y][1] << endl;
        if (vis[temp.x + 1][temp.y][1] <= temp.r && A[temp.x + 1][temp.y] != 'T')
        {
            if ((vis[temp.x + 1][temp.y][1] == temp.r && vis[temp.x + 1][temp.y][0] > temp.t) || vis[temp.x + 1][temp.y][1] < temp.r)
            {
                //cout << "SI" << endl;
                vis[temp.x + 1][temp.y][1] = temp.r;
                vis[temp.x + 1][temp.y][0] = temp.t;
                temp.x++;
                qiu2.push(temp);
                temp.x--;
            }
        }
        if (vis[temp.x - 1][temp.y][1] <= temp.r && A[temp.x - 1][temp.y] != 'T')
        {
            if ((vis[temp.x - 1][temp.y][1] == temp.r && vis[temp.x - 1][temp.y][0] > temp.t) || vis[temp.x - 1][temp.y][1] < temp.r)
            {
                vis[temp.x - 1][temp.y][1] = temp.r;
                vis[temp.x - 1][temp.y][0] = temp.t;
                temp.x--;
                qiu2.push(temp);
                temp.x++;
            }
        }
        if (vis[temp.x][temp.y + 1][1] <= temp.r && A[temp.x][temp.y + 1] != 'T')
        {
            if ((vis[temp.x][temp.y + 1][1] == temp.r && vis[temp.x][temp.y + 1][0] > temp.t) || vis[temp.x][temp.y + 1][1] < temp.r)
            {
                vis[temp.x][temp.y + 1][1] = temp.r;
                vis[temp.x][temp.y + 1][0] = temp.t;
                temp.y++;
                qiu2.push(temp);
                temp.y--;
            }
        }
        if (vis[temp.x][temp.y - 1][1] <= temp.r && A[temp.x][temp.y - 1] != 'T')
        {
            if ((vis[temp.x][temp.y - 1][1] == temp.r && vis[temp.x][temp.y - 1][0] > temp.t) || vis[temp.x][temp.y - 1][1] < temp.r)
            {
                vis[temp.x][temp.y - 1][1] = temp.r;
                vis[temp.x][temp.y - 1][0] = temp.t;
                temp.y--;
                qiu2.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] = 1073741822;
            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();
    /*cout << endl;
    for (int i = 1; i <= N; i++)
    {
        for (int j = 1; j <= N; j++)
        {
            cout << B[i][j] << " ";
        }
        cout << endl;
    }*/
    vis[sx][sy][1] = 1073741822;
    vis[sx][sy][0] = 0;
    solve2(sx, sy, 0, B[sx][sy] - 1);
    cout << rilres;
    return 0;
}

Subtask #1

91.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	1 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	0 ms	384 KB	Output is correct
7	Correct	149 ms	8832 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	1 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	2 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	640 KB	Output is correct
19	Correct	1 ms	640 KB	Output is correct
20	Correct	1 ms	640 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	912 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	1024 KB	Output is correct
32	Correct	1 ms	1024 KB	Output is correct
33	Correct	6 ms	4096 KB	Output is correct
34	Correct	7 ms	4096 KB	Output is correct
35	Correct	141 ms	4344 KB	Output is correct
36	Correct	8 ms	4480 KB	Output is correct
37	Correct	8 ms	4480 KB	Output is correct
38	Correct	205 ms	4856 KB	Output is correct
39	Correct	10 ms	5120 KB	Output is correct
40	Correct	10 ms	5248 KB	Output is correct
41	Correct	290 ms	5372 KB	Output is correct
42	Correct	12 ms	5632 KB	Output is correct
43	Correct	11 ms	5632 KB	Output is correct
44	Correct	398 ms	6136 KB	Output is correct
45	Correct	13 ms	6144 KB	Output is correct
46	Correct	13 ms	6144 KB	Output is correct
47	Correct	537 ms	6648 KB	Output is correct
48	Correct	16 ms	6528 KB	Output is correct
49	Correct	15 ms	6656 KB	Output is correct
50	Correct	712 ms	7240 KB	Output is correct
51	Correct	19 ms	7168 KB	Output is correct
52	Correct	17 ms	7040 KB	Output is correct
53	Correct	908 ms	7928 KB	Output is correct
54	Correct	21 ms	7552 KB	Output is correct
55	Correct	20 ms	7552 KB	Output is correct
56	Execution timed out	1085 ms	8696 KB	Time limit exceeded
57	Correct	23 ms	8064 KB	Output is correct
58	Correct	22 ms	8192 KB	Output is correct
59	Execution timed out	1091 ms	9208 KB	Time limit exceeded
60	Correct	26 ms	8576 KB	Output is correct
61	Correct	25 ms	8576 KB	Output is correct
62	Execution timed out	1097 ms	9724 KB	Time limit exceeded
63	Correct	45 ms	8696 KB	Output is correct
64	Correct	47 ms	8704 KB	Output is correct
65	Correct	47 ms	8696 KB	Output is correct
66	Correct	45 ms	8692 KB	Output is correct
67	Correct	40 ms	8696 KB	Output is correct
68	Correct	37 ms	8704 KB	Output is correct
69	Correct	38 ms	8704 KB	Output is correct
70	Correct	36 ms	8704 KB	Output is correct
71	Correct	36 ms	8704 KB	Output is correct
72	Correct	38 ms	8704 KB	Output is correct
73	Correct	34 ms	9216 KB	Output is correct
74	Correct	83 ms	9216 KB	Output is correct
75	Correct	35 ms	9216 KB	Output is correct
76	Correct	36 ms	9208 KB	Output is correct
77	Correct	37 ms	9216 KB	Output is correct
78	Correct	66 ms	9088 KB	Output is correct
79	Correct	294 ms	9200 KB	Output is correct
80	Correct	319 ms	9328 KB	Output is correct
81	Correct	211 ms	9200 KB	Output is correct
82	Correct	117 ms	9216 KB	Output is correct
83	Correct	77 ms	9112 KB	Output is correct
84	Correct	262 ms	9208 KB	Output is correct
85	Correct	175 ms	9088 KB	Output is correct
86	Correct	171 ms	9088 KB	Output is correct
87	Correct	126 ms	9208 KB	Output is correct
88	Correct	216 ms	9076 KB	Output is correct
89	Correct	394 ms	9204 KB	Output is correct
90	Correct	121 ms	8960 KB	Output is correct
91	Correct	350 ms	9448 KB	Output is correct
92	Correct	252 ms	9204 KB	Output is correct