Submission #839390

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
839390	2023-08-29T23:21:18 Z	ArashJafariyan	Mecho (IOI09_mecho)	C++17	54 / 100	186 ms	6484 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], savevis[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) || !savevis[x][y]);
    }
    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();

    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];
            savevis[i][j] = vis[i][j];
        }
    }

    int l, r;
    l = -1;
    r = save[mx][my];

    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	1 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	94 ms	6256 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	1 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	1 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	760 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	852 KB	Output isn't correct
32	Correct	1 ms	852 KB	Output is correct
33	Incorrect	7 ms	2644 KB	Output isn't correct
34	Correct	8 ms	2764 KB	Output is correct
35	Correct	21 ms	2644 KB	Output is correct
36	Incorrect	10 ms	3128 KB	Output isn't correct
37	Correct	10 ms	3132 KB	Output is correct
38	Correct	31 ms	3028 KB	Output is correct
39	Incorrect	12 ms	3396 KB	Output isn't correct
40	Correct	13 ms	3376 KB	Output is correct
41	Correct	40 ms	3492 KB	Output is correct
42	Incorrect	15 ms	3924 KB	Output isn't correct
43	Correct	18 ms	3972 KB	Output is correct
44	Correct	48 ms	3820 KB	Output is correct
45	Incorrect	18 ms	4248 KB	Output isn't correct
46	Correct	19 ms	4248 KB	Output is correct
47	Correct	60 ms	4240 KB	Output is correct
48	Incorrect	21 ms	4564 KB	Output isn't correct
49	Correct	23 ms	4564 KB	Output is correct
50	Correct	74 ms	4624 KB	Output is correct
51	Incorrect	26 ms	4948 KB	Output isn't correct
52	Correct	27 ms	4992 KB	Output is correct
53	Correct	83 ms	5016 KB	Output is correct
54	Incorrect	29 ms	5332 KB	Output isn't correct
55	Correct	29 ms	5304 KB	Output is correct
56	Correct	102 ms	5408 KB	Output is correct
57	Incorrect	34 ms	5716 KB	Output isn't correct
58	Correct	35 ms	5716 KB	Output is correct
59	Correct	110 ms	5820 KB	Output is correct
60	Incorrect	38 ms	6224 KB	Output isn't correct
61	Correct	39 ms	6200 KB	Output is correct
62	Correct	136 ms	6196 KB	Output is correct
63	Correct	112 ms	6200 KB	Output is correct
64	Correct	185 ms	6204 KB	Output is correct
65	Correct	186 ms	6204 KB	Output is correct
66	Incorrect	139 ms	6100 KB	Output isn't correct
67	Correct	122 ms	6196 KB	Output is correct
68	Correct	52 ms	6208 KB	Output is correct
69	Correct	41 ms	6224 KB	Output is correct
70	Correct	37 ms	6224 KB	Output is correct
71	Correct	30 ms	6224 KB	Output is correct
72	Correct	31 ms	6232 KB	Output is correct
73	Correct	35 ms	6468 KB	Output is correct
74	Correct	70 ms	6480 KB	Output is correct
75	Correct	66 ms	6464 KB	Output is correct
76	Correct	70 ms	6484 KB	Output is correct
77	Correct	73 ms	6476 KB	Output is correct
78	Correct	80 ms	6452 KB	Output is correct
79	Correct	62 ms	6464 KB	Output is correct
80	Correct	70 ms	6452 KB	Output is correct
81	Correct	71 ms	6452 KB	Output is correct
82	Correct	68 ms	6356 KB	Output is correct
83	Correct	92 ms	6344 KB	Output is correct
84	Correct	72 ms	6424 KB	Output is correct
85	Correct	72 ms	6420 KB	Output is correct
86	Correct	86 ms	6356 KB	Output is correct
87	Correct	75 ms	6412 KB	Output is correct
88	Correct	97 ms	6368 KB	Output is correct
89	Correct	85 ms	6360 KB	Output is correct
90	Correct	94 ms	6360 KB	Output is correct
91	Correct	100 ms	6364 KB	Output is correct
92	Correct	94 ms	6352 KB	Output is correct