oj.uz

Submission #739760

# Submission time Handle Problem Language Result Execution time Memory
739760 2023-05-11T08:48:51 Z gigabuffoon Mecho (IOI09_mecho) C++17
84 / 100
 229 ms 16408 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, INT_MAX));
        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 2 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 126 ms 12692 KB Output is correct
8 Correct 1 ms 340 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 420 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 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 476 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 724 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 4996 KB Output is correct
34 Correct 10 ms 5748 KB Output is correct
35 Correct 26 ms 5472 KB Output is correct
36 Correct 12 ms 5832 KB Output is correct
37 Correct 12 ms 6628 KB Output is correct
38 Correct 35 ms 6344 KB Output is correct
39 Correct 15 ms 6848 KB Output is correct
40 Correct 16 ms 7768 KB Output is correct
41 Correct 49 ms 7280 KB Output is correct
42 Correct 18 ms 7852 KB Output is correct
43 Correct 18 ms 8916 KB Output is correct
44 Correct 57 ms 8316 KB Output is correct
45 Correct 20 ms 9036 KB Output is correct
46 Correct 23 ms 10144 KB Output is correct
47 Correct 73 ms 9400 KB Output is correct
48 Correct 26 ms 10076 KB Output is correct
49 Correct 27 ms 11252 KB Output is correct
50 Correct 100 ms 10428 KB Output is correct
51 Correct 31 ms 11384 KB Output is correct
52 Correct 31 ms 12416 KB Output is correct
53 Correct 114 ms 11596 KB Output is correct
54 Correct 37 ms 12672 KB Output is correct
55 Correct 36 ms 13744 KB Output is correct
56 Correct 141 ms 12704 KB Output is correct
57 Correct 43 ms 14068 KB Output is correct
58 Correct 39 ms 15028 KB Output is correct
59 Correct 152 ms 14036 KB Output is correct
60 Correct 47 ms 15500 KB Output is correct
61 Correct 46 ms 16408 KB Output is correct
62 Correct 181 ms 15268 KB Output is correct
63 Correct 159 ms 16280 KB Output is correct
64 Correct 229 ms 16260 KB Output is correct
65 Correct 228 ms 16236 KB Output is correct
66 Correct 175 ms 16232 KB Output is correct
67 Correct 168 ms 16260 KB Output is correct
68 Correct 88 ms 16360 KB Output is correct
69 Correct 86 ms 16300 KB Output is correct
70 Correct 80 ms 16336 KB Output is correct
71 Correct 68 ms 16372 KB Output is correct
72 Incorrect 69 ms 16304 KB Output isn't correct
73 Incorrect 80 ms 16240 KB Output isn't correct
74 Correct 104 ms 16192 KB Output is correct
75 Correct 109 ms 16208 KB Output is correct
76 Correct 101 ms 16188 KB Output is correct
77 Correct 105 ms 16208 KB Output is correct
78 Correct 116 ms 16156 KB Output is correct
79 Correct 93 ms 16164 KB Output is correct
80 Correct 103 ms 16212 KB Output is correct
81 Correct 102 ms 16132 KB Output is correct
82 Correct 96 ms 16204 KB Output is correct
83 Correct 120 ms 16268 KB Output is correct
84 Correct 116 ms 16268 KB Output is correct
85 Correct 111 ms 16324 KB Output is correct
86 Correct 119 ms 16268 KB Output is correct
87 Correct 109 ms 16280 KB Output is correct
88 Correct 117 ms 16084 KB Output is correct
89 Correct 114 ms 16080 KB Output is correct
90 Correct 125 ms 16136 KB Output is correct
91 Correct 127 ms 16108 KB Output is correct
92 Correct 123 ms 16112 KB Output is correct