oj.uz

Submission #739761

# Submission time Handle Problem Language Result Execution time Memory
739761 2023-05-11T08:49:28 Z gigabuffoon Mecho (IOI09_mecho) C++17
84 / 100
 227 ms 16252 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 << 19; 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 1 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 123 ms 12576 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 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 852 KB Output isn't 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 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 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 9 ms 4932 KB Output is correct
34 Correct 9 ms 5564 KB Output is correct
35 Correct 26 ms 5344 KB Output is correct
36 Correct 12 ms 5768 KB Output is correct
37 Correct 12 ms 6560 KB Output is correct
38 Correct 37 ms 6256 KB Output is correct
39 Correct 15 ms 6744 KB Output is correct
40 Correct 16 ms 7632 KB Output is correct
41 Correct 50 ms 7196 KB Output is correct
42 Correct 18 ms 7780 KB Output is correct
43 Correct 18 ms 8788 KB Output is correct
44 Correct 59 ms 8172 KB Output is correct
45 Correct 22 ms 8908 KB Output is correct
46 Correct 27 ms 9980 KB Output is correct
47 Correct 74 ms 9216 KB Output is correct
48 Correct 25 ms 10004 KB Output is correct
49 Correct 29 ms 11224 KB Output is correct
50 Correct 92 ms 10336 KB Output is correct
51 Correct 31 ms 11220 KB Output is correct
52 Correct 32 ms 12376 KB Output is correct
53 Correct 111 ms 11428 KB Output is correct
54 Correct 37 ms 12568 KB Output is correct
55 Correct 34 ms 13608 KB Output is correct
56 Correct 140 ms 12624 KB Output is correct
57 Correct 40 ms 13904 KB Output is correct
58 Correct 41 ms 14820 KB Output is correct
59 Correct 150 ms 13860 KB Output is correct
60 Correct 47 ms 15444 KB Output is correct
61 Correct 47 ms 16192 KB Output is correct
62 Correct 175 ms 15164 KB Output is correct
63 Correct 153 ms 16096 KB Output is correct
64 Correct 227 ms 16160 KB Output is correct
65 Correct 226 ms 16152 KB Output is correct
66 Correct 182 ms 16140 KB Output is correct
67 Correct 165 ms 16160 KB Output is correct
68 Correct 89 ms 16176 KB Output is correct
69 Correct 90 ms 16248 KB Output is correct
70 Correct 80 ms 16252 KB Output is correct
71 Correct 67 ms 16176 KB Output is correct
72 Incorrect 65 ms 16160 KB Output isn't correct
73 Incorrect 77 ms 16092 KB Output isn't correct
74 Correct 95 ms 16052 KB Output is correct
75 Correct 114 ms 16060 KB Output is correct
76 Correct 109 ms 16056 KB Output is correct
77 Correct 105 ms 16080 KB Output is correct
78 Correct 118 ms 16028 KB Output is correct
79 Correct 96 ms 16152 KB Output is correct
80 Correct 108 ms 15940 KB Output is correct
81 Correct 107 ms 15976 KB Output is correct
82 Correct 100 ms 16028 KB Output is correct
83 Correct 117 ms 16132 KB Output is correct
84 Correct 111 ms 16208 KB Output is correct
85 Correct 110 ms 16200 KB Output is correct
86 Correct 118 ms 16156 KB Output is correct
87 Correct 115 ms 16124 KB Output is correct
88 Correct 116 ms 15968 KB Output is correct
89 Correct 117 ms 15964 KB Output is correct
90 Correct 131 ms 15980 KB Output is correct
91 Correct 126 ms 15940 KB Output is correct
92 Correct 122 ms 15964 KB Output is correct