Submission #839371

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
839371	2023-08-29T22:17:18 Z	ArashJafariyan	Mecho (IOI09_mecho)	C++17	32 / 100	159 ms	6408 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) {
    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') || a[x][y] == 'D');
    }
    return ret;
}

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

    if (check0(x - 1, y)) {
        vis[x - 1][y] = 1;
        d[x - 1][y] = dis;
        q.push({x - 1, y});
    }
    if (check0(x + 1, y)) {
        vis[x + 1][y] = 1;
        d[x + 1][y] = dis;
        q.push({x + 1, y});
    }
    if (check0(x, y - 1)) {
        vis[x][y - 1] = 1;
        d[x][y - 1] = dis;
        q.push({x, y - 1});
    }
    if (check0(x, y + 1)) {
        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();

    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 = save[mx][my] - 1;

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

    return 0;
}

Subtask #1

32.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	Correct	0 ms	340 KB	Output is correct
4	Incorrect	0 ms	340 KB	Output isn't correct
5	Correct	0 ms	340 KB	Output is correct
6	Incorrect	1 ms	340 KB	Output isn't correct
7	Incorrect	85 ms	6240 KB	Output isn't correct
8	Incorrect	0 ms	340 KB	Output isn't correct
9	Incorrect	0 ms	340 KB	Output isn't correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Incorrect	0 ms	724 KB	Output isn't correct
13	Incorrect	1 ms	596 KB	Output isn't correct
14	Correct	2 ms	724 KB	Output is correct
15	Incorrect	1 ms	468 KB	Output isn't correct
16	Correct	0 ms	468 KB	Output is correct
17	Incorrect	1 ms	468 KB	Output isn't correct
18	Correct	1 ms	468 KB	Output is correct
19	Incorrect	0 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	852 KB	Output is correct
33	Incorrect	8 ms	2644 KB	Output isn't correct
34	Correct	8 ms	2724 KB	Output is correct
35	Correct	22 ms	2724 KB	Output is correct
36	Incorrect	10 ms	3080 KB	Output isn't correct
37	Correct	10 ms	3092 KB	Output is correct
38	Correct	36 ms	3068 KB	Output is correct
39	Incorrect	12 ms	3412 KB	Output isn't correct
40	Correct	14 ms	3452 KB	Output is correct
41	Correct	39 ms	3412 KB	Output is correct
42	Incorrect	14 ms	3820 KB	Output isn't correct
43	Correct	15 ms	3816 KB	Output is correct
44	Correct	48 ms	3796 KB	Output is correct
45	Incorrect	19 ms	4192 KB	Output isn't correct
46	Correct	18 ms	4180 KB	Output is correct
47	Correct	61 ms	4176 KB	Output is correct
48	Incorrect	21 ms	4564 KB	Output isn't correct
49	Correct	21 ms	4468 KB	Output is correct
50	Correct	76 ms	4568 KB	Output is correct
51	Incorrect	24 ms	4948 KB	Output isn't correct
52	Correct	26 ms	4948 KB	Output is correct
53	Correct	82 ms	4948 KB	Output is correct
54	Incorrect	27 ms	5332 KB	Output isn't correct
55	Correct	29 ms	5348 KB	Output is correct
56	Correct	105 ms	5328 KB	Output is correct
57	Incorrect	34 ms	5716 KB	Output isn't correct
58	Correct	35 ms	5724 KB	Output is correct
59	Correct	115 ms	5916 KB	Output is correct
60	Incorrect	36 ms	6100 KB	Output isn't correct
61	Correct	38 ms	6120 KB	Output is correct
62	Correct	136 ms	6128 KB	Output is correct
63	Correct	102 ms	6124 KB	Output is correct
64	Correct	157 ms	6040 KB	Output is correct
65	Correct	159 ms	6128 KB	Output is correct
66	Incorrect	124 ms	6120 KB	Output isn't correct
67	Correct	109 ms	6124 KB	Output is correct
68	Correct	46 ms	6100 KB	Output is correct
69	Correct	40 ms	6088 KB	Output is correct
70	Correct	43 ms	6080 KB	Output is correct
71	Correct	38 ms	6152 KB	Output is correct
72	Incorrect	36 ms	6152 KB	Output isn't correct
73	Incorrect	27 ms	6356 KB	Output isn't correct
74	Correct	68 ms	6324 KB	Output is correct
75	Correct	64 ms	6404 KB	Output is correct
76	Correct	68 ms	6408 KB	Output is correct
77	Correct	73 ms	6400 KB	Output is correct
78	Correct	82 ms	6376 KB	Output is correct
79	Correct	61 ms	6352 KB	Output is correct
80	Correct	69 ms	6368 KB	Output is correct
81	Correct	72 ms	6380 KB	Output is correct
82	Correct	68 ms	6372 KB	Output is correct
83	Correct	90 ms	6296 KB	Output is correct
84	Correct	78 ms	6336 KB	Output is correct
85	Correct	80 ms	6264 KB	Output is correct
86	Correct	86 ms	6336 KB	Output is correct
87	Correct	85 ms	6356 KB	Output is correct
88	Correct	93 ms	6280 KB	Output is correct
89	Correct	86 ms	6176 KB	Output is correct
90	Correct	98 ms	6284 KB	Output is correct
91	Correct	92 ms	6228 KB	Output is correct
92	Correct	91 ms	6292 KB	Output is correct