oj.uz

답안 #535725

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
535725 2022-03-11T03:22:40 Z louiskwok Mecho (IOI09_mecho) C++17
84 / 100
 193 ms 7000 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;
    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
84.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 135 ms 6712 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 Incorrect 1 ms 1364 KB Output isn't correct
13 Incorrect 1 ms 1108 KB Output isn't 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 1 ms 1108 KB Output is correct
22 Correct 1 ms 1236 KB Output is correct
23 Correct 2 ms 1108 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 2 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 1 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 12 ms 2960 KB Output is correct
34 Correct 14 ms 3368 KB Output is correct
35 Correct 29 ms 3384 KB Output is correct
36 Correct 15 ms 3160 KB Output is correct
37 Correct 18 ms 3668 KB Output is correct
38 Correct 39 ms 3668 KB Output is correct
39 Correct 18 ms 3412 KB Output is correct
40 Correct 20 ms 4056 KB Output is correct
41 Correct 51 ms 4112 KB Output is correct
42 Correct 21 ms 3700 KB Output is correct
43 Correct 23 ms 4464 KB Output is correct
44 Correct 73 ms 4476 KB Output is correct
45 Correct 29 ms 3864 KB Output is correct
46 Correct 40 ms 4756 KB Output is correct
47 Correct 82 ms 4828 KB Output is correct
48 Correct 30 ms 4172 KB Output is correct
49 Correct 32 ms 5068 KB Output is correct
50 Correct 88 ms 5188 KB Output is correct
51 Correct 39 ms 4524 KB Output is correct
52 Correct 43 ms 5528 KB Output is correct
53 Correct 123 ms 5540 KB Output is correct
54 Correct 41 ms 4684 KB Output is correct
55 Correct 43 ms 5820 KB Output is correct
56 Correct 115 ms 5892 KB Output is correct
57 Correct 46 ms 5064 KB Output is correct
58 Correct 58 ms 6224 KB Output is correct
59 Correct 173 ms 6176 KB Output is correct
60 Correct 52 ms 5304 KB Output is correct
61 Correct 56 ms 6532 KB Output is correct
62 Correct 168 ms 6508 KB Output is correct
63 Correct 150 ms 6508 KB Output is correct
64 Correct 193 ms 6604 KB Output is correct
65 Correct 180 ms 6528 KB Output is correct
66 Correct 177 ms 6604 KB Output is correct
67 Correct 139 ms 6600 KB Output is correct
68 Correct 81 ms 6532 KB Output is correct
69 Correct 89 ms 6516 KB Output is correct
70 Correct 72 ms 6564 KB Output is correct
71 Correct 65 ms 6604 KB Output is correct
72 Incorrect 64 ms 6644 KB Output isn't correct
73 Incorrect 69 ms 6800 KB Output isn't correct
74 Correct 143 ms 6872 KB Output is correct
75 Correct 92 ms 6824 KB Output is correct
76 Correct 84 ms 6868 KB Output is correct
77 Correct 99 ms 7000 KB Output is correct
78 Correct 117 ms 5620 KB Output is correct
79 Correct 87 ms 6740 KB Output is correct
80 Correct 83 ms 5456 KB Output is correct
81 Correct 100 ms 5500 KB Output is correct
82 Correct 107 ms 5500 KB Output is correct
83 Correct 104 ms 5548 KB Output is correct
84 Correct 114 ms 6724 KB Output is correct
85 Correct 102 ms 5588 KB Output is correct
86 Correct 152 ms 5608 KB Output is correct
87 Correct 129 ms 5716 KB Output is correct
88 Correct 109 ms 5604 KB Output is correct
89 Correct 124 ms 6748 KB Output is correct
90 Correct 125 ms 6348 KB Output is correct
91 Correct 119 ms 6684 KB Output is correct
92 Correct 111 ms 5836 KB Output is correct