Submission #839379

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
839379	2023-08-29T22:50:39 Z	ArashJafariyan	Mecho (IOI09_mecho)	C++17	54 / 100	189 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 = 1e9;

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];
        if (ret && a[x][y] == 'D') {
            d[x][y] = inf;
            vis[x][y] = 1;
            return 0;
        }
        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];
    }

    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;
            }
        }
    }

    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

54.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 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	0 ms	340 KB	Output is correct
7	Correct	127 ms	6232 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	Correct	1 ms	724 KB	Output is correct
13	Correct	1 ms	596 KB	Output is correct
14	Correct	1 ms	724 KB	Output is correct
15	Incorrect	0 ms	468 KB	Output isn't correct
16	Correct	0 ms	468 KB	Output is correct
17	Incorrect	0 ms	468 KB	Output isn't correct
18	Correct	0 ms	468 KB	Output is correct
19	Incorrect	0 ms	468 KB	Output isn't correct
20	Correct	0 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	10 ms	2724 KB	Output isn't correct
34	Correct	11 ms	2728 KB	Output is correct
35	Correct	28 ms	2724 KB	Output is correct
36	Incorrect	12 ms	3028 KB	Output isn't correct
37	Correct	12 ms	3084 KB	Output is correct
38	Correct	38 ms	3068 KB	Output is correct
39	Incorrect	16 ms	3452 KB	Output isn't correct
40	Correct	16 ms	3452 KB	Output is correct
41	Correct	47 ms	3444 KB	Output is correct
42	Incorrect	17 ms	3812 KB	Output isn't correct
43	Correct	17 ms	3796 KB	Output is correct
44	Correct	60 ms	3800 KB	Output is correct
45	Incorrect	23 ms	4180 KB	Output isn't correct
46	Correct	21 ms	4052 KB	Output is correct
47	Correct	73 ms	4188 KB	Output is correct
48	Incorrect	27 ms	4564 KB	Output isn't correct
49	Correct	27 ms	4580 KB	Output is correct
50	Correct	90 ms	4564 KB	Output is correct
51	Incorrect	31 ms	4884 KB	Output isn't correct
52	Correct	32 ms	4972 KB	Output is correct
53	Correct	104 ms	4940 KB	Output is correct
54	Incorrect	38 ms	5376 KB	Output isn't correct
55	Correct	40 ms	5348 KB	Output is correct
56	Correct	124 ms	5320 KB	Output is correct
57	Incorrect	38 ms	5720 KB	Output isn't correct
58	Correct	38 ms	5716 KB	Output is correct
59	Correct	137 ms	5736 KB	Output is correct
60	Incorrect	46 ms	6128 KB	Output isn't correct
61	Correct	49 ms	6128 KB	Output is correct
62	Correct	159 ms	6100 KB	Output is correct
63	Correct	123 ms	6052 KB	Output is correct
64	Correct	177 ms	6124 KB	Output is correct
65	Correct	189 ms	6124 KB	Output is correct
66	Incorrect	132 ms	6036 KB	Output isn't correct
67	Correct	121 ms	6128 KB	Output is correct
68	Correct	69 ms	6220 KB	Output is correct
69	Correct	68 ms	6152 KB	Output is correct
70	Correct	55 ms	6148 KB	Output is correct
71	Correct	60 ms	6148 KB	Output is correct
72	Correct	54 ms	6172 KB	Output is correct
73	Correct	69 ms	6404 KB	Output is correct
74	Correct	88 ms	6400 KB	Output is correct
75	Correct	99 ms	6396 KB	Output is correct
76	Correct	89 ms	6356 KB	Output is correct
77	Correct	98 ms	6404 KB	Output is correct
78	Correct	99 ms	6356 KB	Output is correct
79	Correct	88 ms	6292 KB	Output is correct
80	Correct	91 ms	6376 KB	Output is correct
81	Correct	100 ms	6380 KB	Output is correct
82	Correct	92 ms	6372 KB	Output is correct
83	Correct	122 ms	6344 KB	Output is correct
84	Correct	99 ms	6340 KB	Output is correct
85	Correct	100 ms	6356 KB	Output is correct
86	Correct	110 ms	6340 KB	Output is correct
87	Correct	111 ms	6372 KB	Output is correct
88	Correct	118 ms	6288 KB	Output is correct
89	Correct	110 ms	6292 KB	Output is correct
90	Correct	115 ms	6284 KB	Output is correct
91	Correct	113 ms	6284 KB	Output is correct
92	Correct	113 ms	6228 KB	Output is correct