oj.uz

답안 #535726

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
535726 2022-03-11T03:39:19 Z louiskwok Mecho (IOI09_mecho) C++17
100 / 100
 222 ms 6880 KB 
#include <bits/stdc++.h>
using namespace std;
bool visited[805][805];
int distBee[805][805];
int distBear[805][805];
char g[805][805];
int dr[] = {-1,0,1,0};
int dc[] = {0,1,0,-1};
int n,s,sr,sc,er,ec,mxtime;
bool possible(int t) {
    memset(visited,0,sizeof visited);
    queue < pair <pair<int,int>,int> > bfs;
    bfs.push({{sr,sc},0});
    visited[sr][sc] = true;
    distBear[sr][sc] = t;
    if (distBear[sr][sc]>=distBee[sr][sc]) return false;
    while (!bfs.empty()) {
        int curR = bfs.front().first.first;
        int curC = bfs.front().first.second;
        int steps = bfs.front().second;
        bfs.pop();
        for (int i=0;i<4;i++) {
            int nr = curR + dr[i];
            int nc = curC + dc[i];
            if (nr<1||nr>n||nc<1||nc>n||visited[nr][nc]||g[nr][nc]=='T'||distBear[curR][curC]+((steps+1)%s==0?1:0)>=distBee[nr][nc]) continue;
            visited[nr][nc] = true;
            distBear[nr][nc] = distBear[curR][curC] + ((steps+1)%s==0?1:0);
            bfs.push({{nr,nc},steps+1});
        }
    }
    if (visited[er][ec]) return true;
    return false;
}
int main() {
    queue < pair<int,int> > bfs;
    cin >> n >> s;
    for (int i=1;i<=n;i++) {
        for (int j=1;j<=n;j++) {
            cin >> g[i][j];
            distBee[i][j]=1000000;
            if (g[i][j]=='M') sr = i,sc = j;
            else if (g[i][j]=='D') er = i,ec = j;
            else if (g[i][j]=='H') {
                visited[i][j] = true;
                distBee[i][j] = 0;
                bfs.push({i,j});
            }
        }
    }
    while (!bfs.empty()) {
        int curR = bfs.front().first;
        int curC = bfs.front().second;
        bfs.pop();
        for (int i=0;i<4;i++) {
            int nr = curR + dr[i];
            int nc = curC + dc[i];
            if (nr<1||nr>n||nc<1||nc>n||visited[nr][nc]||g[nr][nc]=='T'||g[nr][nc]=='D') continue;
            visited[nr][nc] = true;
            distBee[nr][nc] = distBee[curR][curC]+1;
            mxtime = max(mxtime,distBee[nr][nc]);
            bfs.push({nr,nc});
        }
    }
    int lo = 0,hi = mxtime;
    while (lo<hi) {
        int mid = (lo+hi+1)/2;
        bool poss = possible(mid);
        if (poss) lo = mid;
        else hi = mid-1;
    }
    if (!possible(0)) cout << -1 << endl;
    else cout << lo << endl;
    return 0;
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 852 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 131 ms 6664 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 1 ms 980 KB Output is correct
12 Correct 1 ms 1364 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct
14 Correct 1 ms 1236 KB Output is correct
15 Correct 1 ms 980 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 1 ms 980 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 1 ms 1108 KB Output is correct
20 Correct 1 ms 1108 KB Output is correct
21 Correct 2 ms 1108 KB Output is correct
22 Correct 1 ms 1236 KB Output is correct
23 Correct 1 ms 1236 KB Output is correct
24 Correct 1 ms 1236 KB Output is correct
25 Correct 1 ms 1236 KB Output is correct
26 Correct 1 ms 1364 KB Output is correct
27 Correct 1 ms 1236 KB Output is correct
28 Correct 1 ms 1364 KB Output is correct
29 Correct 1 ms 1236 KB Output is correct
30 Correct 2 ms 1364 KB Output is correct
31 Correct 1 ms 1364 KB Output is correct
32 Correct 2 ms 1364 KB Output is correct
33 Correct 13 ms 2848 KB Output is correct
34 Correct 16 ms 3412 KB Output is correct
35 Correct 36 ms 3400 KB Output is correct
36 Correct 17 ms 3156 KB Output is correct
37 Correct 16 ms 3764 KB Output is correct
38 Correct 34 ms 3792 KB Output is correct
39 Correct 17 ms 3428 KB Output is correct
40 Correct 19 ms 4052 KB Output is correct
41 Correct 45 ms 4132 KB Output is correct
42 Correct 27 ms 3596 KB Output is correct
43 Correct 25 ms 4436 KB Output is correct
44 Correct 84 ms 4364 KB Output is correct
45 Correct 26 ms 3980 KB Output is correct
46 Correct 30 ms 4732 KB Output is correct
47 Correct 83 ms 4824 KB Output is correct
48 Correct 31 ms 4136 KB Output is correct
49 Correct 38 ms 5100 KB Output is correct
50 Correct 109 ms 5160 KB Output is correct
51 Correct 38 ms 4476 KB Output is correct
52 Correct 41 ms 5448 KB Output is correct
53 Correct 101 ms 5544 KB Output is correct
54 Correct 40 ms 4752 KB Output is correct
55 Correct 46 ms 5800 KB Output is correct
56 Correct 130 ms 5812 KB Output is correct
57 Correct 46 ms 5036 KB Output is correct
58 Correct 50 ms 6176 KB Output is correct
59 Correct 154 ms 6244 KB Output is correct
60 Correct 59 ms 5352 KB Output is correct
61 Correct 60 ms 6532 KB Output is correct
62 Correct 152 ms 6516 KB Output is correct
63 Correct 131 ms 6552 KB Output is correct
64 Correct 222 ms 6568 KB Output is correct
65 Correct 184 ms 6520 KB Output is correct
66 Correct 170 ms 6604 KB Output is correct
67 Correct 165 ms 6556 KB Output is correct
68 Correct 75 ms 6504 KB Output is correct
69 Correct 75 ms 6540 KB Output is correct
70 Correct 64 ms 6536 KB Output is correct
71 Correct 68 ms 6624 KB Output is correct
72 Correct 74 ms 6604 KB Output is correct
73 Correct 66 ms 6748 KB Output is correct
74 Correct 94 ms 6780 KB Output is correct
75 Correct 98 ms 6872 KB Output is correct
76 Correct 94 ms 6872 KB Output is correct
77 Correct 103 ms 6880 KB Output is correct
78 Correct 97 ms 5476 KB Output is correct
79 Correct 85 ms 6748 KB Output is correct
80 Correct 85 ms 5448 KB Output is correct
81 Correct 97 ms 5484 KB Output is correct
82 Correct 94 ms 5552 KB Output is correct
83 Correct 103 ms 5480 KB Output is correct
84 Correct 111 ms 6764 KB Output is correct
85 Correct 120 ms 5576 KB Output is correct
86 Correct 114 ms 5516 KB Output is correct
87 Correct 105 ms 5700 KB Output is correct
88 Correct 135 ms 5744 KB Output is correct
89 Correct 134 ms 6752 KB Output is correct
90 Correct 109 ms 6376 KB Output is correct
91 Correct 113 ms 6656 KB Output is correct
92 Correct 138 ms 5732 KB Output is correct