oj.uz

답안 #739770

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
739770 2023-05-11T09:05:30 Z gigabuffoon Mecho (IOI09_mecho) C++17
100 / 100
 205 ms 8736 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)
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] = INT_MAX;

    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;
        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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 444 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 102 ms 7296 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 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 724 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 724 KB Output is correct
15 Correct 1 ms 340 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 468 KB Output is correct
21 Correct 1 ms 468 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 720 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 1 ms 724 KB Output is correct
27 Correct 1 ms 596 KB Output is correct
28 Correct 1 ms 724 KB Output is correct
29 Correct 1 ms 724 KB Output is correct
30 Correct 1 ms 724 KB Output is correct
31 Correct 1 ms 724 KB Output is correct
32 Correct 1 ms 852 KB Output is correct
33 Correct 6 ms 3064 KB Output is correct
34 Correct 6 ms 3160 KB Output is correct
35 Correct 24 ms 3220 KB Output is correct
36 Correct 7 ms 3520 KB Output is correct
37 Correct 8 ms 3736 KB Output is correct
38 Correct 34 ms 3732 KB Output is correct
39 Correct 11 ms 4080 KB Output is correct
40 Correct 10 ms 4236 KB Output is correct
41 Correct 43 ms 4180 KB Output is correct
42 Correct 12 ms 4676 KB Output is correct
43 Correct 12 ms 4808 KB Output is correct
44 Correct 46 ms 4772 KB Output is correct
45 Correct 14 ms 5228 KB Output is correct
46 Correct 14 ms 5300 KB Output is correct
47 Correct 61 ms 5348 KB Output is correct
48 Correct 16 ms 5924 KB Output is correct
49 Correct 16 ms 5984 KB Output is correct
50 Correct 81 ms 6012 KB Output is correct
51 Correct 19 ms 6596 KB Output is correct
52 Correct 19 ms 6596 KB Output is correct
53 Correct 90 ms 6564 KB Output is correct
54 Correct 22 ms 7264 KB Output is correct
55 Correct 22 ms 7252 KB Output is correct
56 Correct 102 ms 7196 KB Output is correct
57 Correct 25 ms 7940 KB Output is correct
58 Correct 25 ms 7936 KB Output is correct
59 Correct 121 ms 7908 KB Output is correct
60 Correct 29 ms 8600 KB Output is correct
61 Correct 29 ms 8612 KB Output is correct
62 Correct 138 ms 8736 KB Output is correct
63 Correct 126 ms 8584 KB Output is correct
64 Correct 205 ms 8592 KB Output is correct
65 Correct 188 ms 8580 KB Output is correct
66 Correct 144 ms 8640 KB Output is correct
67 Correct 140 ms 8636 KB Output is correct
68 Correct 73 ms 8728 KB Output is correct
69 Correct 67 ms 8616 KB Output is correct
70 Correct 54 ms 8680 KB Output is correct
71 Correct 50 ms 8684 KB Output is correct
72 Correct 43 ms 8608 KB Output is correct
73 Correct 46 ms 8628 KB Output is correct
74 Correct 71 ms 8588 KB Output is correct
75 Correct 81 ms 8604 KB Output is correct
76 Correct 92 ms 8616 KB Output is correct
77 Correct 79 ms 8644 KB Output is correct
78 Correct 93 ms 8628 KB Output is correct
79 Correct 74 ms 8608 KB Output is correct
80 Correct 80 ms 8696 KB Output is correct
81 Correct 85 ms 8668 KB Output is correct
82 Correct 82 ms 8624 KB Output is correct
83 Correct 93 ms 8608 KB Output is correct
84 Correct 89 ms 8656 KB Output is correct
85 Correct 83 ms 8604 KB Output is correct
86 Correct 91 ms 8620 KB Output is correct
87 Correct 88 ms 8596 KB Output is correct
88 Correct 95 ms 8628 KB Output is correct
89 Correct 123 ms 8620 KB Output is correct
90 Correct 103 ms 8596 KB Output is correct
91 Correct 102 ms 8692 KB Output is correct
92 Correct 98 ms 8584 KB Output is correct