답안 #312938

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
312938	2020-10-14T19:11:17 Z	fergonzgut21	Mecho (IOI09_mecho)	C++14	11 / 100	46 ms	6656 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];
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();
        if (temp.x == ex && temp.y == ey)
            return temp.r;
        //cout << temp.x << " " << temp.y << " " << temp.t << " " << temp.r << endl;
        if (temp.r + (temp.t / S) >= B[x][y])
            temp.r = (temp.r + (temp.t / S)) - B[x][y] + 1;
        if (temp.r < 0)
            continue;
        temp.t++;
        if (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++;
            qiu2.push(temp);
            temp.x--;
        }
        if (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--;
            qiu2.push(temp);
            temp.x++;
        }
        if (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++;
            qiu2.push(temp);
            temp.y--;
        }
        if (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--;
            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] =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] = 0;
    cout << solve2(sx, sy, 0, B[sx][sy] - 1);
    return 0;
}

Subtask #1

11.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Incorrect	1 ms	384 KB	Output isn't correct
4	Incorrect	0 ms	384 KB	Output isn't correct
5	Incorrect	0 ms	384 KB	Output isn't correct
6	Correct	0 ms	384 KB	Output is correct
7	Incorrect	36 ms	6272 KB	Output isn't correct
8	Incorrect	0 ms	512 KB	Output isn't correct
9	Incorrect	1 ms	512 KB	Output isn't correct
10	Incorrect	0 ms	512 KB	Output isn't correct
11	Incorrect	1 ms	384 KB	Output isn't correct
12	Correct	1 ms	768 KB	Output is correct
13	Incorrect	1 ms	768 KB	Output isn't correct
14	Incorrect	1 ms	768 KB	Output isn't correct
15	Incorrect	0 ms	512 KB	Output isn't correct
16	Incorrect	1 ms	512 KB	Output isn't correct
17	Incorrect	0 ms	512 KB	Output isn't correct
18	Incorrect	1 ms	512 KB	Output isn't correct
19	Incorrect	1 ms	512 KB	Output isn't correct
20	Incorrect	1 ms	512 KB	Output isn't correct
21	Incorrect	1 ms	640 KB	Output isn't correct
22	Incorrect	1 ms	640 KB	Output isn't correct
23	Incorrect	1 ms	768 KB	Output isn't correct
24	Incorrect	1 ms	768 KB	Output isn't correct
25	Incorrect	1 ms	768 KB	Output isn't correct
26	Incorrect	1 ms	768 KB	Output isn't correct
27	Incorrect	1 ms	768 KB	Output isn't correct
28	Incorrect	1 ms	896 KB	Output isn't correct
29	Incorrect	1 ms	896 KB	Output isn't correct
30	Incorrect	1 ms	896 KB	Output isn't correct
31	Incorrect	1 ms	896 KB	Output isn't correct
32	Incorrect	1 ms	896 KB	Output isn't correct
33	Incorrect	5 ms	2944 KB	Output isn't correct
34	Incorrect	5 ms	2816 KB	Output isn't correct
35	Incorrect	6 ms	2816 KB	Output isn't correct
36	Incorrect	6 ms	3200 KB	Output isn't correct
37	Incorrect	6 ms	3200 KB	Output isn't correct
38	Incorrect	8 ms	3200 KB	Output isn't correct
39	Incorrect	7 ms	3584 KB	Output isn't correct
40	Incorrect	6 ms	3584 KB	Output isn't correct
41	Incorrect	10 ms	3584 KB	Output isn't correct
42	Incorrect	9 ms	3968 KB	Output isn't correct
43	Incorrect	8 ms	3840 KB	Output isn't correct
44	Incorrect	12 ms	3968 KB	Output isn't correct
45	Incorrect	10 ms	4224 KB	Output isn't correct
46	Incorrect	9 ms	4224 KB	Output isn't correct
47	Incorrect	15 ms	4224 KB	Output isn't correct
48	Incorrect	12 ms	4608 KB	Output isn't correct
49	Incorrect	11 ms	4608 KB	Output isn't correct
50	Incorrect	17 ms	4608 KB	Output isn't correct
51	Incorrect	14 ms	4992 KB	Output isn't correct
52	Incorrect	12 ms	4992 KB	Output isn't correct
53	Incorrect	20 ms	4992 KB	Output isn't correct
54	Incorrect	16 ms	5376 KB	Output isn't correct
55	Incorrect	14 ms	5376 KB	Output isn't correct
56	Incorrect	22 ms	5376 KB	Output isn't correct
57	Incorrect	18 ms	5760 KB	Output isn't correct
58	Incorrect	16 ms	5632 KB	Output isn't correct
59	Incorrect	27 ms	5632 KB	Output isn't correct
60	Incorrect	20 ms	6016 KB	Output isn't correct
61	Incorrect	17 ms	6016 KB	Output isn't correct
62	Incorrect	30 ms	6016 KB	Output isn't correct
63	Incorrect	43 ms	6016 KB	Output isn't correct
64	Incorrect	46 ms	6136 KB	Output isn't correct
65	Incorrect	44 ms	6016 KB	Output isn't correct
66	Incorrect	43 ms	6016 KB	Output isn't correct
67	Incorrect	43 ms	6016 KB	Output isn't correct
68	Incorrect	46 ms	6144 KB	Output isn't correct
69	Incorrect	45 ms	6144 KB	Output isn't correct
70	Incorrect	45 ms	6136 KB	Output isn't correct
71	Incorrect	44 ms	6144 KB	Output isn't correct
72	Incorrect	30 ms	6140 KB	Output isn't correct
73	Incorrect	33 ms	6528 KB	Output isn't correct
74	Incorrect	39 ms	6528 KB	Output isn't correct
75	Incorrect	33 ms	6528 KB	Output isn't correct
76	Incorrect	34 ms	6528 KB	Output isn't correct
77	Incorrect	34 ms	6528 KB	Output isn't correct
78	Incorrect	36 ms	6528 KB	Output isn't correct
79	Incorrect	40 ms	6648 KB	Output isn't correct
80	Incorrect	35 ms	6528 KB	Output isn't correct
81	Incorrect	37 ms	6656 KB	Output isn't correct
82	Incorrect	36 ms	6528 KB	Output isn't correct
83	Incorrect	37 ms	6400 KB	Output isn't correct
84	Incorrect	42 ms	6400 KB	Output isn't correct
85	Incorrect	38 ms	6400 KB	Output isn't correct
86	Incorrect	37 ms	6400 KB	Output isn't correct
87	Incorrect	38 ms	6400 KB	Output isn't correct
88	Incorrect	39 ms	6400 KB	Output isn't correct
89	Incorrect	42 ms	6400 KB	Output isn't correct
90	Incorrect	38 ms	6400 KB	Output isn't correct
91	Incorrect	37 ms	6400 KB	Output isn't correct
92	Incorrect	37 ms	6400 KB	Output isn't correct