oj.uz

Submission #739762

# Submission time Handle Problem Language Result Execution time Memory
739762 2023-05-11T08:50:03 Z gigabuffoon Mecho (IOI09_mecho) C++17
84 / 100
 236 ms 16260 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;

        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
84.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 123 ms 12532 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Incorrect 1 ms 852 KB Output isn't correct
13 Incorrect 1 ms 724 KB Output isn't correct
14 Correct 1 ms 852 KB Output is correct
15 Correct 0 ms 468 KB Output is correct
16 Correct 0 ms 468 KB Output is correct
17 Correct 1 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 0 ms 596 KB Output is correct
21 Correct 1 ms 608 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 9 ms 4868 KB Output is correct
34 Correct 11 ms 5556 KB Output is correct
35 Correct 33 ms 5412 KB Output is correct
36 Correct 12 ms 5764 KB Output is correct
37 Correct 13 ms 6496 KB Output is correct
38 Correct 36 ms 6192 KB Output is correct
39 Correct 17 ms 6740 KB Output is correct
40 Correct 16 ms 7576 KB Output is correct
41 Correct 46 ms 7124 KB Output is correct
42 Correct 19 ms 7796 KB Output is correct
43 Correct 19 ms 8788 KB Output is correct
44 Correct 63 ms 8204 KB Output is correct
45 Correct 24 ms 8984 KB Output is correct
46 Correct 23 ms 10020 KB Output is correct
47 Correct 79 ms 9244 KB Output is correct
48 Correct 26 ms 10000 KB Output is correct
49 Correct 26 ms 11144 KB Output is correct
50 Correct 94 ms 10316 KB Output is correct
51 Correct 34 ms 11232 KB Output is correct
52 Correct 33 ms 12304 KB Output is correct
53 Correct 119 ms 11480 KB Output is correct
54 Correct 36 ms 12580 KB Output is correct
55 Correct 39 ms 13720 KB Output is correct
56 Correct 131 ms 12636 KB Output is correct
57 Correct 43 ms 13940 KB Output is correct
58 Correct 45 ms 14884 KB Output is correct
59 Correct 157 ms 13984 KB Output is correct
60 Correct 47 ms 15496 KB Output is correct
61 Correct 51 ms 16204 KB Output is correct
62 Correct 173 ms 15068 KB Output is correct
63 Correct 154 ms 16148 KB Output is correct
64 Correct 225 ms 16136 KB Output is correct
65 Correct 236 ms 16188 KB Output is correct
66 Correct 177 ms 16192 KB Output is correct
67 Correct 166 ms 16128 KB Output is correct
68 Correct 93 ms 16224 KB Output is correct
69 Correct 98 ms 16260 KB Output is correct
70 Correct 86 ms 16232 KB Output is correct
71 Correct 72 ms 16172 KB Output is correct
72 Incorrect 71 ms 16156 KB Output isn't correct
73 Incorrect 80 ms 16228 KB Output isn't correct
74 Correct 97 ms 16060 KB Output is correct
75 Correct 105 ms 16140 KB Output is correct
76 Correct 107 ms 16128 KB Output is correct
77 Correct 103 ms 16036 KB Output is correct
78 Correct 117 ms 15988 KB Output is correct
79 Correct 95 ms 16020 KB Output is correct
80 Correct 97 ms 16048 KB Output is correct
81 Correct 107 ms 16000 KB Output is correct
82 Correct 98 ms 16100 KB Output is correct
83 Correct 125 ms 16144 KB Output is correct
84 Correct 110 ms 16148 KB Output is correct
85 Correct 108 ms 16164 KB Output is correct
86 Correct 120 ms 16260 KB Output is correct
87 Correct 118 ms 16200 KB Output is correct
88 Correct 119 ms 16016 KB Output is correct
89 Correct 118 ms 16028 KB Output is correct
90 Correct 134 ms 16204 KB Output is correct
91 Correct 118 ms 16048 KB Output is correct
92 Correct 120 ms 16036 KB Output is correct