oj.uz

답안 #839370

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
839370 2023-08-29T22:14:07 Z ArashJafariyan Mecho (IOI09_mecho) C++17
32 / 100
 164 ms 7040 KB 
#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 = 1e7;

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

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Incorrect 1 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 348 KB Output isn't correct
7 Incorrect 86 ms 6768 KB Output isn't correct
8 Incorrect 1 ms 340 KB Output isn't correct
9 Incorrect 1 ms 352 KB Output isn't correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 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 468 KB Output is correct
17 Incorrect 1 ms 484 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 480 KB Output is correct
21 Incorrect 1 ms 596 KB Output isn't correct
22 Correct 1 ms 724 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 740 KB Output isn't correct
30 Correct 1 ms 740 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 8 ms 2792 KB Output isn't correct
34 Correct 8 ms 2840 KB Output is correct
35 Correct 22 ms 2840 KB Output is correct
36 Incorrect 10 ms 3180 KB Output isn't correct
37 Correct 10 ms 3240 KB Output is correct
38 Correct 31 ms 3228 KB Output is correct
39 Incorrect 12 ms 3528 KB Output isn't correct
40 Correct 12 ms 3540 KB Output is correct
41 Correct 41 ms 3644 KB Output is correct
42 Incorrect 14 ms 4060 KB Output isn't correct
43 Correct 15 ms 4052 KB Output is correct
44 Correct 48 ms 4044 KB Output is correct
45 Incorrect 19 ms 4592 KB Output isn't correct
46 Correct 18 ms 4456 KB Output is correct
47 Correct 58 ms 4472 KB Output is correct
48 Incorrect 21 ms 4820 KB Output isn't correct
49 Correct 21 ms 4836 KB Output is correct
50 Correct 70 ms 4916 KB Output is correct
51 Incorrect 24 ms 5332 KB Output isn't correct
52 Correct 25 ms 5332 KB Output is correct
53 Correct 81 ms 5364 KB Output is correct
54 Incorrect 28 ms 5732 KB Output isn't correct
55 Correct 28 ms 5716 KB Output is correct
56 Correct 95 ms 5824 KB Output is correct
57 Incorrect 34 ms 6288 KB Output isn't correct
58 Correct 36 ms 6356 KB Output is correct
59 Correct 113 ms 6284 KB Output is correct
60 Incorrect 37 ms 6836 KB Output isn't correct
61 Correct 38 ms 6760 KB Output is correct
62 Correct 142 ms 6760 KB Output is correct
63 Correct 103 ms 6752 KB Output is correct
64 Correct 163 ms 6804 KB Output is correct
65 Correct 164 ms 6764 KB Output is correct
66 Incorrect 122 ms 6752 KB Output isn't correct
67 Correct 110 ms 6760 KB Output is correct
68 Correct 48 ms 6700 KB Output is correct
69 Correct 42 ms 6704 KB Output is correct
70 Correct 39 ms 6688 KB Output is correct
71 Correct 33 ms 6776 KB Output is correct
72 Incorrect 35 ms 6700 KB Output isn't correct
73 Incorrect 27 ms 6988 KB Output isn't correct
74 Correct 73 ms 7028 KB Output is correct
75 Correct 70 ms 7040 KB Output is correct
76 Correct 72 ms 7032 KB Output is correct
77 Correct 72 ms 7036 KB Output is correct
78 Correct 78 ms 6992 KB Output is correct
79 Correct 62 ms 6956 KB Output is correct
80 Correct 69 ms 7000 KB Output is correct
81 Correct 71 ms 6992 KB Output is correct
82 Correct 73 ms 7004 KB Output is correct
83 Correct 109 ms 6860 KB Output is correct
84 Correct 84 ms 6924 KB Output is correct
85 Correct 73 ms 6964 KB Output is correct
86 Correct 84 ms 6964 KB Output is correct
87 Correct 89 ms 6964 KB Output is correct
88 Correct 89 ms 6932 KB Output is correct
89 Correct 84 ms 6884 KB Output is correct
90 Correct 94 ms 6916 KB Output is correct
91 Correct 94 ms 6908 KB Output is correct
92 Correct 92 ms 6788 KB Output is correct