답안 #839388

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
839388	2023-08-29T23:11:29 Z	ArashJafariyan	Mecho (IOI09_mecho)	C++17	38 / 100	186 ms	6404 KB

mecho

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;

#define F first
#define S second
#define pb push_back
#define size(a) (int) a.size()
#define all(a) a.begin(), a.end()

const int maxn = 800 + 4, inf = 1e8;

int n, s, mx, my, dx, dy, d[maxn][maxn], save[maxn][maxn];
bitset<maxn> vis[maxn];
string a[maxn];
queue<array<int, 2>> q;

void rest() {
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            vis[i][j] = 0;
            d[i][j] = inf;
        }
    }
    return;
}

bool check0(int x, int y, int dis) {
    bool ret = (0 <= x && x < n);
    ret &= (0 <= y && y < n);
    if (ret) {
        ret &= !vis[x][y];
        ret &= (a[x][y] == 'G' || a[x][y] == 'M');
    }
    return ret;
}

void upd0(int x, int y) { 
    int dis = d[x][y] + 1;

    if (check0(x - 1, y, dis)) {
        vis[x - 1][y] = 1;
        d[x - 1][y] = dis;
        q.push({x - 1, y});
    }
    if (check0(x + 1, y, dis)) {
        vis[x + 1][y] = 1;
        d[x + 1][y] = dis;
        q.push({x + 1, y});
    }
    if (check0(x, y - 1, dis)) {
        vis[x][y - 1] = 1;
        d[x][y - 1] = dis;
        q.push({x, y - 1});
    }
    if (check0(x, y + 1, dis)) {
        vis[x][y + 1] = 1;
        d[x][y + 1] = dis;
        q.push({x, y + 1});
    }
}

bool check1(int x, int y, int dis, int k) {
    bool ret = (0 <= x && x < n);
    ret &= (0 <= y && y < n);
    if (ret) {
        ret &= !vis[x][y];
        ret &= a[x][y] == 'G' || a[x][y] == 'D';
        ret &= (dis + s - 1) / s <= save[x][y] - k;
    }
    return ret;
}

void upd1(int x, int y, int k) {
    int dis = d[x][y] + 1;
    
    if (check1(x - 1, y, dis, k)) {
        vis[x - 1][y] = 1;
        d[x - 1][y] = dis;
        q.push({x - 1, y});
    }
    if (check1(x + 1, y, dis, k)) {
        vis[x + 1][y] = 1;
        d[x + 1][y] = dis;
        q.push({x + 1, y});
    }
    if (check1(x, y - 1, dis, k)) {
        vis[x][y - 1] = 1;
        d[x][y - 1] = dis;
        q.push({x, y - 1});
    }
    if (check1(x, y + 1, dis, k)) {
        vis[x][y + 1] = 1;
        d[x][y + 1] = dis;
        q.push({x, y + 1});
    }
}

bool bfs(int k) {
    rest();

    if (save[mx][my] < k) {
        return 0;
    }

    d[mx][my] = 0;
    vis[mx][my] = 1;
    q.push({mx, my});
    while (!q.empty()) {
        array<int, 2> v = q.front();
        q.pop();
        upd1(v[0], v[1], k);
    }
    
    return d[dx][dy] != inf;
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);

    cin >> n >> s;
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }

    rest();
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            if (a[i][j] == 'H') {
                q.push({i, j});
                vis[i][j] = 1;
                d[i][j] = 0;
            }
        }
    }

    while (!q.empty()) {
        array<int, 2> v = q.front();
        q.pop();
        upd0(v[0], v[1]);
    }

    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            if (a[i][j] == 'M') {
                mx = i;
                my = j;
            }
            if (a[i][j] == 'D') {
                dx = i;
                dy = j;
            }
            save[i][j] = d[i][j];
        }
    }

    int l, r;
    l = -1;
    r = inf;

    while (r - l > 1) {
        int m = (l + r) >> 1;
        if (bfs(m)) {
            l = m;
        }
        else {
            r = m;
        }
    }
    cout << l << '\n';

    return 0;
}

Subtask #1

38.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	340 KB	Output isn't correct
2	Incorrect	0 ms	340 KB	Output isn't correct
3	Incorrect	0 ms	340 KB	Output isn't correct
4	Incorrect	0 ms	340 KB	Output isn't correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	111 ms	6168 KB	Output is correct
8	Incorrect	0 ms	340 KB	Output isn't correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Incorrect	1 ms	724 KB	Output isn't correct
13	Incorrect	1 ms	596 KB	Output isn't correct
14	Correct	1 ms	724 KB	Output is correct
15	Incorrect	1 ms	468 KB	Output isn't correct
16	Correct	1 ms	512 KB	Output is correct
17	Incorrect	0 ms	468 KB	Output isn't correct
18	Correct	1 ms	468 KB	Output is correct
19	Incorrect	1 ms	468 KB	Output isn't correct
20	Correct	1 ms	468 KB	Output is correct
21	Incorrect	1 ms	596 KB	Output isn't correct
22	Correct	1 ms	596 KB	Output is correct
23	Incorrect	1 ms	596 KB	Output isn't correct
24	Correct	1 ms	596 KB	Output is correct
25	Incorrect	1 ms	724 KB	Output isn't correct
26	Correct	1 ms	724 KB	Output is correct
27	Incorrect	1 ms	724 KB	Output isn't correct
28	Correct	1 ms	724 KB	Output is correct
29	Incorrect	1 ms	724 KB	Output isn't correct
30	Correct	1 ms	724 KB	Output is correct
31	Incorrect	1 ms	724 KB	Output isn't correct
32	Correct	1 ms	724 KB	Output is correct
33	Incorrect	9 ms	2644 KB	Output isn't correct
34	Correct	9 ms	2644 KB	Output is correct
35	Correct	25 ms	2644 KB	Output is correct
36	Incorrect	12 ms	3028 KB	Output isn't correct
37	Correct	12 ms	3028 KB	Output is correct
38	Correct	35 ms	3028 KB	Output is correct
39	Incorrect	14 ms	3536 KB	Output isn't correct
40	Correct	14 ms	3412 KB	Output is correct
41	Correct	44 ms	3412 KB	Output is correct
42	Incorrect	17 ms	3796 KB	Output isn't correct
43	Correct	16 ms	3712 KB	Output is correct
44	Correct	55 ms	3800 KB	Output is correct
45	Incorrect	21 ms	4180 KB	Output isn't correct
46	Correct	21 ms	4180 KB	Output is correct
47	Correct	66 ms	4180 KB	Output is correct
48	Incorrect	26 ms	4564 KB	Output isn't correct
49	Correct	27 ms	4564 KB	Output is correct
50	Correct	79 ms	4564 KB	Output is correct
51	Incorrect	27 ms	4948 KB	Output isn't correct
52	Correct	27 ms	4948 KB	Output is correct
53	Correct	94 ms	4948 KB	Output is correct
54	Incorrect	37 ms	5332 KB	Output isn't correct
55	Correct	32 ms	5332 KB	Output is correct
56	Correct	108 ms	5332 KB	Output is correct
57	Incorrect	39 ms	5716 KB	Output isn't correct
58	Correct	40 ms	5736 KB	Output is correct
59	Correct	125 ms	5732 KB	Output is correct
60	Incorrect	42 ms	6100 KB	Output isn't correct
61	Correct	43 ms	6116 KB	Output is correct
62	Correct	178 ms	6188 KB	Output is correct
63	Correct	109 ms	6092 KB	Output is correct
64	Correct	142 ms	6124 KB	Output is correct
65	Correct	186 ms	6132 KB	Output is correct
66	Incorrect	134 ms	6128 KB	Output isn't correct
67	Correct	122 ms	6124 KB	Output is correct
68	Correct	59 ms	6156 KB	Output is correct
69	Correct	59 ms	6100 KB	Output is correct
70	Correct	52 ms	6100 KB	Output is correct
71	Correct	52 ms	6164 KB	Output is correct
72	Incorrect	49 ms	6100 KB	Output isn't correct
73	Incorrect	62 ms	6348 KB	Output isn't correct
74	Correct	85 ms	6404 KB	Output is correct
75	Correct	88 ms	6404 KB	Output is correct
76	Correct	92 ms	6356 KB	Output is correct
77	Correct	92 ms	6356 KB	Output is correct
78	Correct	99 ms	6372 KB	Output is correct
79	Correct	85 ms	6356 KB	Output is correct
80	Correct	89 ms	6380 KB	Output is correct
81	Correct	99 ms	6356 KB	Output is correct
82	Correct	92 ms	6372 KB	Output is correct
83	Correct	107 ms	6252 KB	Output is correct
84	Correct	93 ms	6356 KB	Output is correct
85	Correct	90 ms	6220 KB	Output is correct
86	Correct	104 ms	6332 KB	Output is correct
87	Correct	106 ms	6328 KB	Output is correct
88	Correct	103 ms	6288 KB	Output is correct
89	Correct	118 ms	6308 KB	Output is correct
90	Correct	114 ms	6220 KB	Output is correct
91	Correct	112 ms	6228 KB	Output is correct
92	Correct	112 ms	6284 KB	Output is correct