oj.uz

답안 #535624

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
535624 2022-03-10T16:57:54 Z louiskwok Mecho (IOI09_mecho) C++17
84 / 100
 220 ms 9320 KB 
#include <bits/stdc++.h>
using namespace std;
bool visited[805][805];
int distBee[805][805];
double distBear[805][805];
char g[805][805];
int dr[] = {-1,0,1,0};
int dc[] = {0,1,0,-1};
int n,sr,sc,er,ec,mxtime;
double s;
bool success;
bool possible(double t) {
    memset(visited,0,sizeof visited);
    queue < pair<int,int> > bfs;
    distBear[sr][sc] = t;
    bfs.push({sr,sc});
    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'||distBear[curR][curC]+(double)1/s>=(double)distBee[nr][nc]) continue;
            visited[nr][nc] = true;
            distBear[nr][nc] = distBear[curR][curC]+1/s;
            bfs.push({nr,nc});
        }
    }
    if (visited[er][ec]) {
        success = true;
        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];
            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;
                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') 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 = distBee[sr][sc]-1;
    while (lo<hi) {
        int mid = (lo+hi+1)/2;
        if (possible((double)mid)) 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 980 KB Output is correct
2 Incorrect 1 ms 980 KB Output isn't correct
3 Correct 1 ms 980 KB Output is correct
4 Incorrect 1 ms 980 KB Output isn't correct
5 Correct 1 ms 980 KB Output is correct
6 Incorrect 1 ms 980 KB Output isn't correct
7 Incorrect 114 ms 9084 KB Output isn't 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 Correct 1 ms 1236 KB Output is correct
14 Correct 2 ms 1236 KB Output is correct
15 Correct 1 ms 980 KB Output is correct
16 Correct 1 ms 1108 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 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 2 ms 1364 KB Output is correct
27 Correct 1 ms 1236 KB Output is correct
28 Correct 1 ms 1492 KB Output is correct
29 Correct 2 ms 1364 KB Output is correct
30 Correct 2 ms 1492 KB Output is correct
31 Correct 1 ms 1364 KB Output is correct
32 Correct 2 ms 1492 KB Output is correct
33 Correct 13 ms 3156 KB Output is correct
34 Correct 14 ms 4336 KB Output is correct
35 Correct 27 ms 4436 KB Output is correct
36 Correct 14 ms 3540 KB Output is correct
37 Correct 18 ms 4856 KB Output is correct
38 Correct 39 ms 4948 KB Output is correct
39 Correct 20 ms 3844 KB Output is correct
40 Correct 21 ms 5404 KB Output is correct
41 Correct 54 ms 5512 KB Output is correct
42 Correct 22 ms 4272 KB Output is correct
43 Correct 24 ms 5964 KB Output is correct
44 Correct 60 ms 6120 KB Output is correct
45 Correct 28 ms 4456 KB Output is correct
46 Correct 30 ms 6408 KB Output is correct
47 Correct 80 ms 6492 KB Output is correct
48 Correct 31 ms 4776 KB Output is correct
49 Correct 33 ms 6860 KB Output is correct
50 Correct 79 ms 7048 KB Output is correct
51 Correct 40 ms 5160 KB Output is correct
52 Correct 44 ms 7308 KB Output is correct
53 Correct 120 ms 7488 KB Output is correct
54 Correct 41 ms 5440 KB Output is correct
55 Correct 44 ms 7808 KB Output is correct
56 Correct 141 ms 8052 KB Output is correct
57 Correct 53 ms 5784 KB Output is correct
58 Correct 57 ms 8172 KB Output is correct
59 Correct 139 ms 8524 KB Output is correct
60 Correct 53 ms 6072 KB Output is correct
61 Correct 66 ms 8580 KB Output is correct
62 Correct 187 ms 9076 KB Output is correct
63 Correct 133 ms 8928 KB Output is correct
64 Correct 206 ms 9104 KB Output is correct
65 Correct 220 ms 9012 KB Output is correct
66 Correct 188 ms 9060 KB Output is correct
67 Correct 143 ms 8908 KB Output is correct
68 Correct 81 ms 8616 KB Output is correct
69 Correct 71 ms 8840 KB Output is correct
70 Correct 73 ms 8524 KB Output is correct
71 Correct 71 ms 8556 KB Output is correct
72 Correct 70 ms 8932 KB Output is correct
73 Correct 72 ms 9292 KB Output is correct
74 Correct 111 ms 9320 KB Output is correct
75 Correct 96 ms 9292 KB Output is correct
76 Correct 92 ms 9220 KB Output is correct
77 Correct 98 ms 9292 KB Output is correct
78 Correct 109 ms 6700 KB Output is correct
79 Correct 102 ms 9296 KB Output is correct
80 Correct 96 ms 6732 KB Output is correct
81 Correct 100 ms 6656 KB Output is correct
82 Correct 100 ms 6868 KB Output is correct
83 Correct 114 ms 6676 KB Output is correct
84 Correct 115 ms 9196 KB Output is correct
85 Correct 107 ms 6756 KB Output is correct
86 Correct 128 ms 6852 KB Output is correct
87 Correct 103 ms 7080 KB Output is correct
88 Correct 96 ms 6996 KB Output is correct
89 Correct 127 ms 9232 KB Output is correct
90 Correct 137 ms 8456 KB Output is correct
91 Correct 163 ms 9208 KB Output is correct
92 Correct 124 ms 7080 KB Output is correct