oj.uz

Submission #739768

# Submission time Handle Problem Language Result Execution time Memory
739768 2023-05-11T09:04:47 Z gigabuffoon Mecho (IOI09_mecho) C++17
100 / 100
 242 ms 16304 KB 
#include<bits/stdc++.h>
using namespace std;
#define all(a) begin(a), end(a)
#define sz(a) (int)(size(a))
#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define int long long
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int,int>;

#define CASES 0

int N, S;
int dr[4] = {1, 0, -1, 0};
int dc[4] = {0, 1, 0, -1};

const int MAXN = 800;
string grid[MAXN];
pii start, finish;
int wall[MAXN][MAXN];
int bee[MAXN][MAXN];

inline bool inBounds(const int r, const int c) {
    return 0 <= r and r < N and 0 <= c and c < N and !wall[r][c];
}

void solve(int tc) {
    cin >> N >> S;
    
    rep(i,0,N) cin >> grid[i];

    rep(i,0,N) rep(j,0,N) bee[i][j] = 1L << 40;

    queue<pii> bq;
    rep(i,0,N) rep(j,0,N) switch(grid[i][j]) {
        case 'T':
            wall[i][j] = 1;
            break;
        case 'M':
            start = {i, j};
            break;
        case 'D':
            wall[i][j] = 1;
            finish = {i, j};
            break;
        case 'H':
            bee[i][j] = 0;
            bq.emplace(i, j);
            break;
    }

    // bee-FS
    while(sz(bq)) {
        int r, c, rr, cc;
        tie(r, c) = bq.front(); bq.pop();
        rep(d,0,4) if(inBounds(rr = r + dr[d], cc = c+dc[d]))
            if(bee[r][c] + S < bee[rr][cc])
                bee[rr][cc] = bee[r][c] + S,
                bq.emplace(rr, cc);
    }

    wall[finish.first][finish.second] = 0;

    auto test = [&](int delay) {
        vvi dist(N, vi(N, 1L << 40));
        queue<pii> mq; mq.push(start);
        dist[start.first][start.second] = delay * S;
        if(delay * S >= bee[start.first][start.second]) return false;

        while(sz(mq)) {
            if(mq.front() == finish) return true;

            int r, c, rr, cc;
            tie(r, c) = mq.front(); mq.pop();
            rep(d,0,4) if(inBounds(rr = r + dr[d], cc = c+dc[d]))
            if(dist[r][c]+1 < dist[rr][cc] and dist[r][c]+1 < bee[rr][cc])
                dist[rr][cc] = dist[r][c] + 1,
                mq.emplace(rr, cc);
        }

        return false;
    };

    int res = -1;
    for(int x = 1 << 21; x; x >>= 1)
        if(test(res+x)) res += x;
    cout << res << '\n';

}

signed main() {
    ios::sync_with_stdio(false), cin.tie(0);
    int T = 1, t = 0; if(CASES) cin >> T;
    while(t++ < T) solve(t);
    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 133 ms 12472 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 852 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 1 ms 852 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 0 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 724 KB Output is correct
25 Correct 1 ms 724 KB Output is correct
26 Correct 1 ms 852 KB Output is correct
27 Correct 1 ms 724 KB Output is correct
28 Correct 1 ms 852 KB Output is correct
29 Correct 1 ms 852 KB Output is correct
30 Correct 1 ms 980 KB Output is correct
31 Correct 1 ms 852 KB Output is correct
32 Correct 1 ms 980 KB Output is correct
33 Correct 10 ms 4960 KB Output is correct
34 Correct 12 ms 5564 KB Output is correct
35 Correct 28 ms 5348 KB Output is correct
36 Correct 12 ms 5700 KB Output is correct
37 Correct 17 ms 6496 KB Output is correct
38 Correct 39 ms 6260 KB Output is correct
39 Correct 16 ms 6736 KB Output is correct
40 Correct 16 ms 7632 KB Output is correct
41 Correct 46 ms 7124 KB Output is correct
42 Correct 23 ms 7792 KB Output is correct
43 Correct 21 ms 8764 KB Output is correct
44 Correct 56 ms 8176 KB Output is correct
45 Correct 33 ms 8908 KB Output is correct
46 Correct 28 ms 10024 KB Output is correct
47 Correct 80 ms 9240 KB Output is correct
48 Correct 30 ms 9972 KB Output is correct
49 Correct 44 ms 11136 KB Output is correct
50 Correct 94 ms 10316 KB Output is correct
51 Correct 36 ms 11276 KB Output is correct
52 Correct 35 ms 12348 KB Output is correct
53 Correct 115 ms 11448 KB Output is correct
54 Correct 44 ms 12460 KB Output is correct
55 Correct 42 ms 13596 KB Output is correct
56 Correct 138 ms 12616 KB Output is correct
57 Correct 49 ms 13924 KB Output is correct
58 Correct 46 ms 14940 KB Output is correct
59 Correct 182 ms 13836 KB Output is correct
60 Correct 57 ms 15516 KB Output is correct
61 Correct 56 ms 16136 KB Output is correct
62 Correct 184 ms 15156 KB Output is correct
63 Correct 164 ms 16204 KB Output is correct
64 Correct 242 ms 16304 KB Output is correct
65 Correct 230 ms 16180 KB Output is correct
66 Correct 192 ms 16104 KB Output is correct
67 Correct 185 ms 16128 KB Output is correct
68 Correct 99 ms 16200 KB Output is correct
69 Correct 96 ms 16176 KB Output is correct
70 Correct 84 ms 16184 KB Output is correct
71 Correct 76 ms 16228 KB Output is correct
72 Correct 81 ms 16160 KB Output is correct
73 Correct 73 ms 16096 KB Output is correct
74 Correct 109 ms 16060 KB Output is correct
75 Correct 119 ms 16064 KB Output is correct
76 Correct 129 ms 16060 KB Output is correct
77 Correct 110 ms 16080 KB Output is correct
78 Correct 123 ms 16096 KB Output is correct
79 Correct 103 ms 16036 KB Output is correct
80 Correct 105 ms 15960 KB Output is correct
81 Correct 123 ms 16016 KB Output is correct
82 Correct 115 ms 16032 KB Output is correct
83 Correct 131 ms 16120 KB Output is correct
84 Correct 120 ms 16144 KB Output is correct
85 Correct 122 ms 16152 KB Output is correct
86 Correct 136 ms 16196 KB Output is correct
87 Correct 126 ms 16168 KB Output is correct
88 Correct 124 ms 15960 KB Output is correct
89 Correct 129 ms 16120 KB Output is correct
90 Correct 146 ms 15988 KB Output is correct
91 Correct 135 ms 15968 KB Output is correct
92 Correct 125 ms 15976 KB Output is correct