답안 #312937

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
312937	2020-10-14T19:07:32 Z	fergonzgut21	Mecho (IOI09_mecho)	C++14	18 / 100	1000 ms	7728 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, 1, B[sx][sy] - 1);
    return 0;
}

Subtask #1

18.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	384 KB	Output isn't correct
2	Incorrect	0 ms	384 KB	Output isn't correct
3	Incorrect	0 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	Incorrect	1 ms	384 KB	Output isn't correct
7	Incorrect	146 ms	6368 KB	Output isn't correct
8	Correct	1 ms	512 KB	Output is correct
9	Incorrect	1 ms	512 KB	Output isn't correct
10	Incorrect	0 ms	512 KB	Output isn't correct
11	Incorrect	0 ms	512 KB	Output isn't correct
12	Incorrect	1 ms	768 KB	Output isn't correct
13	Incorrect	1 ms	768 KB	Output isn't correct
14	Incorrect	1 ms	768 KB	Output isn't correct
15	Correct	1 ms	512 KB	Output is correct
16	Correct	1 ms	512 KB	Output is correct
17	Correct	0 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	Incorrect	7 ms	2816 KB	Output isn't correct
36	Correct	6 ms	3200 KB	Output is correct
37	Correct	6 ms	3200 KB	Output is correct
38	Incorrect	8 ms	3200 KB	Output isn't correct
39	Correct	7 ms	3584 KB	Output is correct
40	Correct	7 ms	3584 KB	Output is correct
41	Incorrect	10 ms	3584 KB	Output isn't correct
42	Correct	9 ms	3840 KB	Output is correct
43	Correct	8 ms	3968 KB	Output is correct
44	Incorrect	16 ms	3968 KB	Output isn't correct
45	Correct	11 ms	4224 KB	Output is correct
46	Correct	11 ms	4224 KB	Output is correct
47	Incorrect	16 ms	4224 KB	Output isn't correct
48	Correct	12 ms	4608 KB	Output is correct
49	Correct	11 ms	4640 KB	Output is correct
50	Incorrect	18 ms	4608 KB	Output isn't correct
51	Correct	14 ms	4992 KB	Output is correct
52	Correct	13 ms	4992 KB	Output is correct
53	Incorrect	20 ms	4992 KB	Output isn't correct
54	Correct	16 ms	5376 KB	Output is correct
55	Correct	14 ms	5376 KB	Output is correct
56	Incorrect	23 ms	5376 KB	Output isn't correct
57	Correct	17 ms	5632 KB	Output is correct
58	Correct	16 ms	5632 KB	Output is correct
59	Incorrect	27 ms	5632 KB	Output isn't correct
60	Correct	20 ms	6016 KB	Output is correct
61	Correct	18 ms	6016 KB	Output is correct
62	Incorrect	30 ms	6016 KB	Output isn't correct
63	Execution timed out	1091 ms	7040 KB	Time limit exceeded
64	Incorrect	53 ms	6016 KB	Output isn't correct
65	Execution timed out	1094 ms	7328 KB	Time limit exceeded
66	Execution timed out	1086 ms	7448 KB	Time limit exceeded
67	Execution timed out	1089 ms	7032 KB	Time limit exceeded
68	Incorrect	366 ms	6264 KB	Output isn't correct
69	Incorrect	90 ms	6264 KB	Output isn't correct
70	Incorrect	771 ms	6872 KB	Output isn't correct
71	Execution timed out	1098 ms	6836 KB	Time limit exceeded
72	Incorrect	30 ms	6136 KB	Output isn't correct
73	Incorrect	26 ms	6528 KB	Output isn't correct
74	Incorrect	38 ms	6528 KB	Output isn't correct
75	Incorrect	341 ms	7252 KB	Output isn't correct
76	Incorrect	448 ms	7728 KB	Output isn't correct
77	Incorrect	210 ms	6680 KB	Output isn't correct
78	Incorrect	300 ms	7116 KB	Output isn't correct
79	Incorrect	40 ms	6528 KB	Output isn't correct
80	Incorrect	302 ms	7184 KB	Output isn't correct
81	Incorrect	417 ms	7460 KB	Output isn't correct
82	Incorrect	180 ms	6528 KB	Output isn't correct
83	Incorrect	403 ms	7132 KB	Output isn't correct
84	Incorrect	41 ms	6400 KB	Output isn't correct
85	Incorrect	231 ms	6596 KB	Output isn't correct
86	Incorrect	337 ms	6872 KB	Output isn't correct
87	Incorrect	146 ms	6520 KB	Output isn't correct
88	Incorrect	253 ms	6608 KB	Output isn't correct
89	Incorrect	42 ms	6400 KB	Output isn't correct
90	Incorrect	154 ms	6400 KB	Output isn't correct
91	Incorrect	101 ms	6400 KB	Output isn't correct
92	Incorrect	207 ms	6588 KB	Output isn't correct