답안 #1073915

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1073915	2024-08-25T03:09:28 Z	gavangno01	Mecho (IOI09_mecho)	C++17	23 / 100	61 ms	8324 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;
                if (loangbee[i][j] <= original_value) q.pop();
            }
            else {
                loangpl[i][j] = inf;
            }
        }
    }
    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 (loangpl[u][v] == inf && grid[u][v] == 1) {
                    if ((loangpl[x][y] + 1) / s < loangbee[u][v] - original_value) {
                        q.push({u, v});
                        loangpl[u][v] = loangpl[x][y] + 1;
                    };
                }
            }
        }
    }
    for (int i = 0; i < 4; i++) {
        int u = xe + dx[i];
        int v = ye + dy[i];
        if (exceed(u, v)) continue;
        if (loangpl[u][v] / s < loangbee[u][v] - original_value) return 1;
    }
    return 0;
}

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

23.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Incorrect	0 ms	348 KB	Output isn't correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	61 ms	8140 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Incorrect	0 ms	348 KB	Output isn't correct
11	Correct	0 ms	348 KB	Output is correct
12	Incorrect	1 ms	860 KB	Output isn't correct
13	Incorrect	0 ms	860 KB	Output isn't correct
14	Incorrect	1 ms	860 KB	Output isn't correct
15	Correct	0 ms	604 KB	Output is correct
16	Incorrect	0 ms	600 KB	Output isn't correct
17	Correct	0 ms	604 KB	Output is correct
18	Incorrect	0 ms	604 KB	Output isn't correct
19	Correct	1 ms	604 KB	Output is correct
20	Incorrect	0 ms	604 KB	Output isn't correct
21	Correct	0 ms	604 KB	Output is correct
22	Incorrect	1 ms	604 KB	Output isn't correct
23	Correct	0 ms	860 KB	Output is correct
24	Incorrect	1 ms	856 KB	Output isn't correct
25	Correct	1 ms	860 KB	Output is correct
26	Incorrect	1 ms	860 KB	Output isn't correct
27	Correct	0 ms	860 KB	Output is correct
28	Incorrect	1 ms	860 KB	Output isn't correct
29	Correct	1 ms	1116 KB	Output is correct
30	Incorrect	1 ms	1116 KB	Output isn't correct
31	Correct	1 ms	1116 KB	Output is correct
32	Incorrect	1 ms	1116 KB	Output isn't correct
33	Correct	7 ms	3672 KB	Output is correct
34	Incorrect	5 ms	3676 KB	Output isn't correct
35	Incorrect	6 ms	3624 KB	Output isn't correct
36	Correct	7 ms	4100 KB	Output is correct
37	Incorrect	6 ms	4144 KB	Output isn't correct
38	Incorrect	7 ms	4188 KB	Output isn't correct
39	Correct	10 ms	4700 KB	Output is correct
40	Incorrect	11 ms	4736 KB	Output isn't correct
41	Incorrect	15 ms	4696 KB	Output isn't correct
42	Correct	11 ms	5148 KB	Output is correct
43	Incorrect	12 ms	5208 KB	Output isn't correct
44	Incorrect	11 ms	5020 KB	Output isn't correct
45	Correct	14 ms	5688 KB	Output is correct
46	Incorrect	12 ms	5684 KB	Output isn't correct
47	Incorrect	14 ms	5688 KB	Output isn't correct
48	Correct	17 ms	5976 KB	Output is correct
49	Incorrect	14 ms	5976 KB	Output isn't correct
50	Incorrect	16 ms	5980 KB	Output isn't correct
51	Correct	19 ms	6408 KB	Output is correct
52	Incorrect	16 ms	6488 KB	Output isn't correct
53	Incorrect	20 ms	6640 KB	Output isn't correct
54	Correct	21 ms	7052 KB	Output is correct
55	Incorrect	19 ms	7004 KB	Output isn't correct
56	Incorrect	20 ms	7004 KB	Output isn't correct
57	Correct	26 ms	7516 KB	Output is correct
58	Incorrect	21 ms	7516 KB	Output isn't correct
59	Incorrect	23 ms	7516 KB	Output isn't correct
60	Correct	27 ms	7996 KB	Output is correct
61	Incorrect	24 ms	8028 KB	Output isn't correct
62	Incorrect	27 ms	8044 KB	Output isn't correct
63	Incorrect	33 ms	8028 KB	Output isn't correct
64	Incorrect	38 ms	8024 KB	Output isn't correct
65	Incorrect	34 ms	8028 KB	Output isn't correct
66	Incorrect	33 ms	8028 KB	Output isn't correct
67	Incorrect	34 ms	8024 KB	Output isn't correct
68	Incorrect	35 ms	8028 KB	Output isn't correct
69	Incorrect	35 ms	8028 KB	Output isn't correct
70	Incorrect	38 ms	8028 KB	Output isn't correct
71	Incorrect	35 ms	8024 KB	Output isn't correct
72	Incorrect	44 ms	8028 KB	Output isn't correct
73	Incorrect	33 ms	8284 KB	Output isn't correct
74	Incorrect	33 ms	8284 KB	Output isn't correct
75	Incorrect	31 ms	8284 KB	Output isn't correct
76	Incorrect	31 ms	8324 KB	Output isn't correct
77	Incorrect	33 ms	8292 KB	Output isn't correct
78	Incorrect	31 ms	8284 KB	Output isn't correct
79	Incorrect	31 ms	8284 KB	Output isn't correct
80	Incorrect	30 ms	8280 KB	Output isn't correct
81	Incorrect	31 ms	8284 KB	Output isn't correct
82	Incorrect	30 ms	8284 KB	Output isn't correct
83	Incorrect	30 ms	8028 KB	Output isn't correct
84	Incorrect	30 ms	8024 KB	Output isn't correct
85	Incorrect	32 ms	8028 KB	Output isn't correct
86	Incorrect	30 ms	8028 KB	Output isn't correct
87	Incorrect	41 ms	8108 KB	Output isn't correct
88	Incorrect	30 ms	8028 KB	Output isn't correct
89	Incorrect	31 ms	8028 KB	Output isn't correct
90	Incorrect	30 ms	8028 KB	Output isn't correct
91	Incorrect	31 ms	8024 KB	Output isn't correct
92	Incorrect	29 ms	8024 KB	Output isn't correct