답안 #1073896

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1073896	2024-08-25T02:33:46 Z	gavangno01	Mecho (IOI09_mecho)	C++17	73 / 100	147 ms	8288 KB

mecho

#include<bits/stdc++.h>
#define pii pair<int, int>
#define fi first
#define se second
using namespace std;

const int dx[] = {1, 0, 0, -1};
const int dy[] = {0, 1, -1, 0};
const int MAXN = 8e2 + 10;
const int inf = 1e9 + 7;
int n, s;
int xe, ye;
int grid[MAXN][MAXN];
int loangbee[MAXN][MAXN];
int loangpl[MAXN][MAXN];

bool exceed(int x, int y) {
    return (x > n || x < 1 || y > n || y < 1);
}
void bfsbee() {
    queue<pair<int, int>> q;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (grid[i][j] == 4) {
                q.push({i, j});
                loangbee[i][j] = 0;
            }
        }
    }
    while (!q.empty()) {
        pii temp = q.front();
        q.pop();
        int x = temp.fi;
        int y = temp.se;
        for (int i = 0; i < 4; i++) {
            int u = x + dx[i];
            int v = y + dy[i];
            if (!exceed(u, v)) {
                if (loangbee[u][v] == inf && grid[u][v] == 1) {
                    loangbee[u][v] = loangbee[x][y] + 1;
                    q.push({u, v});
                }
            }
        }
    }
}
int bfspl(int original_value) {
    queue<pair<int, int>> q;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (grid[i][j] == 2) {
                q.push({i, j});
                loangpl[i][j] = 0;
            }
            else {
                loangpl[i][j] = inf;
            }
        }
    }
    while (!q.empty()) {
        pii temp = q.front();
        q.pop();
        int x = temp.fi;
        int y = temp.se;
        int time = loangpl[x][y] / s;
        //if (loangpl[x][y] % s != 0) time++;
        time += original_value;
        if (time >= loangbee[x][y]) {
            loangpl[x][y] = -1;
            continue;
        }
        for (int i = 0; i < 4; i++) {
            int u = x + dx[i];
            int v = y + dy[i];
            if (!exceed(u, v)) {
                if (loangpl[u][v] == inf && grid[u][v] == 1) {
                    q.push({u, v});
                    loangpl[u][v] = loangpl[x][y] + 1;
                }
            }
        }
    }
    if (loangpl[xe][ye] == -1 || loangpl[xe][ye] == inf) return 0;
    int timedi = loangpl[xe][ye] / s;
    if (loangpl[xe][ye] % s != 0) timedi++;
    return timedi <= loangbee[xe][ye] - original_value;
}

int main() {
    cin >> n >> s;

    for (int i = 1; i <= n; i++) {
        string str;
        cin >> str;
        for (int j = 1; j <= n; j++) {
            char c = str[j-1];
            loangpl[i][j] = inf;
            loangbee[i][j] = inf;
            if (c == 'T') {
                grid[i][j] = 0;
            }
            if (c == 'G') grid[i][j] = 1;
            if (c == 'M') grid[i][j] = 2;
            if (c == 'D') {
                grid[i][j] = 1;
                xe = i;
                ye = j;
            }
            if (c == 'H') grid[i][j] = 4;
        }
    }
    bfsbee();
//    for (int i = 1; i <= n; i++) {
//        for (int j = 1; j <= n; j++) {
//            cout << loangbee[i][j] << " ";
//        }
//        cout << endl;
//    }
//    cout << "map nguoi" << endl;
//    for (int i = 1; i <= n; i++) {
//        for (int j = 1; j <= n; j++) {
//            cout << loangpl[i][j] << " ";
//        }
//        cout << endl;
//
    int l = 0, r = n * n;
    while (l <= r) {
        int mid = (l + r) / 2;
        if (bfspl(mid) == 1) {
            l = mid + 1;
        }
        else r = mid - 1;
    }
    cout << l - 1;
    return 0;
}

Subtask #1

73.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	2396 KB	Output is correct
2	Incorrect	0 ms	2396 KB	Output isn't correct
3	Correct	0 ms	2396 KB	Output is correct
4	Incorrect	0 ms	2396 KB	Output isn't correct
5	Correct	1 ms	2396 KB	Output is correct
6	Incorrect	1 ms	2396 KB	Output isn't correct
7	Incorrect	60 ms	8180 KB	Output isn't correct
8	Correct	0 ms	2396 KB	Output is correct
9	Correct	0 ms	2396 KB	Output is correct
10	Correct	0 ms	2396 KB	Output is correct
11	Correct	1 ms	2392 KB	Output is correct
12	Incorrect	1 ms	2648 KB	Output isn't correct
13	Incorrect	1 ms	2648 KB	Output isn't correct
14	Correct	1 ms	2652 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2652 KB	Output is correct
18	Correct	1 ms	2652 KB	Output is correct
19	Correct	1 ms	2652 KB	Output is correct
20	Correct	1 ms	2652 KB	Output is correct
21	Correct	1 ms	2652 KB	Output is correct
22	Correct	1 ms	2652 KB	Output is correct
23	Correct	1 ms	2652 KB	Output is correct
24	Correct	1 ms	2652 KB	Output is correct
25	Correct	1 ms	2652 KB	Output is correct
26	Correct	1 ms	2652 KB	Output is correct
27	Correct	1 ms	2908 KB	Output is correct
28	Correct	1 ms	2904 KB	Output is correct
29	Correct	1 ms	2908 KB	Output is correct
30	Correct	1 ms	2908 KB	Output is correct
31	Correct	1 ms	2908 KB	Output is correct
32	Correct	1 ms	2908 KB	Output is correct
33	Correct	7 ms	4696 KB	Output is correct
34	Correct	6 ms	4712 KB	Output is correct
35	Correct	16 ms	4700 KB	Output is correct
36	Correct	7 ms	4956 KB	Output is correct
37	Correct	8 ms	4956 KB	Output is correct
38	Correct	20 ms	4952 KB	Output is correct
39	Correct	9 ms	5212 KB	Output is correct
40	Correct	9 ms	5188 KB	Output is correct
41	Correct	29 ms	5212 KB	Output is correct
42	Correct	14 ms	5672 KB	Output is correct
43	Correct	12 ms	5468 KB	Output is correct
44	Correct	34 ms	5672 KB	Output is correct
45	Correct	18 ms	5980 KB	Output is correct
46	Correct	14 ms	5976 KB	Output is correct
47	Correct	38 ms	5980 KB	Output is correct
48	Correct	16 ms	6492 KB	Output is correct
49	Correct	17 ms	6504 KB	Output is correct
50	Correct	48 ms	6492 KB	Output is correct
51	Correct	18 ms	6748 KB	Output is correct
52	Correct	18 ms	6748 KB	Output is correct
53	Correct	62 ms	6956 KB	Output is correct
54	Correct	22 ms	7256 KB	Output is correct
55	Correct	22 ms	7260 KB	Output is correct
56	Correct	70 ms	7260 KB	Output is correct
57	Correct	23 ms	7768 KB	Output is correct
58	Correct	24 ms	7772 KB	Output is correct
59	Correct	84 ms	7772 KB	Output is correct
60	Correct	27 ms	8024 KB	Output is correct
61	Correct	27 ms	7884 KB	Output is correct
62	Correct	88 ms	8024 KB	Output is correct
63	Correct	86 ms	8024 KB	Output is correct
64	Correct	147 ms	8024 KB	Output is correct
65	Correct	114 ms	8028 KB	Output is correct
66	Correct	94 ms	8028 KB	Output is correct
67	Correct	91 ms	8028 KB	Output is correct
68	Correct	48 ms	8028 KB	Output is correct
69	Correct	48 ms	7996 KB	Output is correct
70	Correct	50 ms	8124 KB	Output is correct
71	Correct	47 ms	8012 KB	Output is correct
72	Incorrect	47 ms	8028 KB	Output isn't correct
73	Incorrect	56 ms	8280 KB	Output isn't correct
74	Correct	46 ms	8284 KB	Output is correct
75	Correct	74 ms	8256 KB	Output is correct
76	Correct	51 ms	8280 KB	Output is correct
77	Correct	50 ms	8280 KB	Output is correct
78	Correct	62 ms	8280 KB	Output is correct
79	Correct	43 ms	8284 KB	Output is correct
80	Correct	67 ms	8284 KB	Output is correct
81	Correct	53 ms	8284 KB	Output is correct
82	Correct	54 ms	8284 KB	Output is correct
83	Correct	58 ms	8280 KB	Output is correct
84	Correct	67 ms	8284 KB	Output is correct
85	Correct	62 ms	8288 KB	Output is correct
86	Correct	58 ms	8280 KB	Output is correct
87	Correct	59 ms	8280 KB	Output is correct
88	Correct	60 ms	8028 KB	Output is correct
89	Correct	61 ms	8028 KB	Output is correct
90	Correct	63 ms	8028 KB	Output is correct
91	Correct	67 ms	8028 KB	Output is correct
92	Correct	70 ms	8028 KB	Output is correct