답안 #1073894

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1073894	2024-08-25T02:29:30 Z	gavangno01	Mecho (IOI09_mecho)	C++17	30 / 100	148 ms	8536 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

30.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	2392 KB	Output isn't correct
2	Incorrect	1 ms	2392 KB	Output isn't correct
3	Incorrect	1 ms	2396 KB	Output isn't correct
4	Incorrect	1 ms	2396 KB	Output isn't correct
5	Correct	1 ms	2396 KB	Output is correct
6	Incorrect	0 ms	2396 KB	Output isn't correct
7	Incorrect	65 ms	8188 KB	Output isn't correct
8	Incorrect	1 ms	2392 KB	Output isn't correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	0 ms	2396 KB	Output is correct
11	Correct	1 ms	2476 KB	Output is correct
12	Incorrect	1 ms	2652 KB	Output isn't correct
13	Incorrect	1 ms	2652 KB	Output isn't correct
14	Correct	1 ms	2652 KB	Output is correct
15	Incorrect	0 ms	2396 KB	Output isn't correct
16	Correct	1 ms	2396 KB	Output is correct
17	Incorrect	1 ms	2652 KB	Output isn't correct
18	Correct	1 ms	2652 KB	Output is correct
19	Incorrect	1 ms	2652 KB	Output isn't correct
20	Correct	0 ms	2652 KB	Output is correct
21	Incorrect	1 ms	2644 KB	Output isn't correct
22	Correct	1 ms	2652 KB	Output is correct
23	Incorrect	1 ms	2648 KB	Output isn't correct
24	Correct	1 ms	2652 KB	Output is correct
25	Incorrect	1 ms	2652 KB	Output isn't correct
26	Correct	1 ms	2652 KB	Output is correct
27	Incorrect	1 ms	2908 KB	Output isn't correct
28	Correct	1 ms	2908 KB	Output is correct
29	Incorrect	1 ms	2908 KB	Output isn't correct
30	Correct	1 ms	2908 KB	Output is correct
31	Incorrect	1 ms	3160 KB	Output isn't correct
32	Correct	1 ms	2908 KB	Output is correct
33	Incorrect	7 ms	4724 KB	Output isn't correct
34	Correct	7 ms	4700 KB	Output is correct
35	Correct	16 ms	4728 KB	Output is correct
36	Incorrect	8 ms	4956 KB	Output isn't correct
37	Correct	8 ms	4900 KB	Output is correct
38	Correct	21 ms	4952 KB	Output is correct
39	Incorrect	11 ms	5212 KB	Output isn't correct
40	Correct	11 ms	5352 KB	Output is correct
41	Correct	28 ms	5208 KB	Output is correct
42	Incorrect	13 ms	5464 KB	Output isn't correct
43	Correct	12 ms	5472 KB	Output is correct
44	Correct	35 ms	5468 KB	Output is correct
45	Incorrect	21 ms	6184 KB	Output isn't correct
46	Correct	16 ms	5976 KB	Output is correct
47	Correct	38 ms	5976 KB	Output is correct
48	Incorrect	24 ms	6488 KB	Output isn't correct
49	Correct	17 ms	6492 KB	Output is correct
50	Correct	45 ms	6492 KB	Output is correct
51	Incorrect	19 ms	6792 KB	Output isn't correct
52	Correct	20 ms	6972 KB	Output is correct
53	Correct	60 ms	6744 KB	Output is correct
54	Incorrect	21 ms	7256 KB	Output isn't correct
55	Correct	24 ms	7456 KB	Output is correct
56	Correct	74 ms	7256 KB	Output is correct
57	Incorrect	24 ms	7772 KB	Output isn't correct
58	Correct	25 ms	7772 KB	Output is correct
59	Correct	80 ms	7768 KB	Output is correct
60	Incorrect	29 ms	8028 KB	Output isn't correct
61	Correct	28 ms	7992 KB	Output is correct
62	Correct	89 ms	8028 KB	Output is correct
63	Correct	82 ms	8024 KB	Output is correct
64	Correct	148 ms	8024 KB	Output is correct
65	Correct	111 ms	8028 KB	Output is correct
66	Incorrect	100 ms	8028 KB	Output isn't correct
67	Correct	90 ms	8028 KB	Output is correct
68	Correct	47 ms	8028 KB	Output is correct
69	Correct	56 ms	8028 KB	Output is correct
70	Correct	38 ms	8024 KB	Output is correct
71	Correct	42 ms	8028 KB	Output is correct
72	Incorrect	37 ms	8028 KB	Output isn't correct
73	Incorrect	54 ms	8284 KB	Output isn't correct
74	Correct	48 ms	8284 KB	Output is correct
75	Correct	55 ms	8280 KB	Output is correct
76	Correct	49 ms	8284 KB	Output is correct
77	Correct	51 ms	8284 KB	Output is correct
78	Correct	57 ms	8280 KB	Output is correct
79	Correct	59 ms	8536 KB	Output is correct
80	Correct	50 ms	8284 KB	Output is correct
81	Correct	55 ms	8284 KB	Output is correct
82	Correct	71 ms	8280 KB	Output is correct
83	Correct	61 ms	8280 KB	Output is correct
84	Correct	54 ms	8284 KB	Output is correct
85	Correct	60 ms	8284 KB	Output is correct
86	Correct	58 ms	8284 KB	Output is correct
87	Correct	64 ms	8284 KB	Output is correct
88	Correct	62 ms	8024 KB	Output is correct
89	Correct	63 ms	8232 KB	Output is correct
90	Correct	62 ms	8024 KB	Output is correct
91	Correct	65 ms	8028 KB	Output is correct
92	Correct	66 ms	8000 KB	Output is correct