oj.uz

답안 #535608

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
535608 2022-03-10T16:33:54 Z louiskwok Mecho (IOI09_mecho) C++17
84 / 100
 198 ms 9324 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 (success) cout << lo << endl;
    else if (possible(0)) cout << 0 << endl;
    else cout << -1 << endl;
    return 0;
}

Subtask #1
84.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 852 KB Output is correct
2 Incorrect 1 ms 980 KB Output isn't correct
3 Correct 1 ms 852 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 148 ms 7280 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 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 1120 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 1 ms 1108 KB Output is correct
23 Correct 1 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 1236 KB Output is correct
27 Correct 1 ms 1236 KB Output is correct
28 Correct 1 ms 1236 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 1236 KB Output is correct
32 Correct 2 ms 1364 KB Output is correct
33 Correct 13 ms 2688 KB Output is correct
34 Correct 12 ms 3284 KB Output is correct
35 Correct 32 ms 4508 KB Output is correct
36 Correct 15 ms 3028 KB Output is correct
37 Correct 15 ms 3644 KB Output is correct
38 Correct 38 ms 5016 KB Output is correct
39 Correct 17 ms 3284 KB Output is correct
40 Correct 20 ms 4072 KB Output is correct
41 Correct 45 ms 5524 KB Output is correct
42 Correct 22 ms 3444 KB Output is correct
43 Correct 25 ms 4436 KB Output is correct
44 Correct 57 ms 5972 KB Output is correct
45 Correct 24 ms 3744 KB Output is correct
46 Correct 26 ms 4684 KB Output is correct
47 Correct 87 ms 6552 KB Output is correct
48 Correct 28 ms 4044 KB Output is correct
49 Correct 32 ms 5076 KB Output is correct
50 Correct 96 ms 7052 KB Output is correct
51 Correct 36 ms 4320 KB Output is correct
52 Correct 35 ms 5432 KB Output is correct
53 Correct 109 ms 7528 KB Output is correct
54 Correct 37 ms 4560 KB Output is correct
55 Correct 43 ms 5740 KB Output is correct
56 Correct 143 ms 8020 KB Output is correct
57 Correct 44 ms 4916 KB Output is correct
58 Correct 45 ms 5996 KB Output is correct
59 Correct 132 ms 8588 KB Output is correct
60 Correct 54 ms 5068 KB Output is correct
61 Correct 57 ms 6380 KB Output is correct
62 Correct 156 ms 9004 KB Output is correct
63 Correct 126 ms 9084 KB Output is correct
64 Correct 185 ms 9104 KB Output is correct
65 Correct 198 ms 9064 KB Output is correct
66 Correct 159 ms 9136 KB Output is correct
67 Correct 145 ms 8912 KB Output is correct
68 Correct 78 ms 8664 KB Output is correct
69 Correct 72 ms 8712 KB Output is correct
70 Correct 72 ms 8524 KB Output is correct
71 Correct 65 ms 8452 KB Output is correct
72 Correct 58 ms 6532 KB Output is correct
73 Correct 58 ms 9324 KB Output is correct
74 Correct 86 ms 9284 KB Output is correct
75 Correct 95 ms 9068 KB Output is correct
76 Correct 97 ms 8960 KB Output is correct
77 Correct 86 ms 9216 KB Output is correct
78 Correct 96 ms 6744 KB Output is correct
79 Correct 78 ms 6396 KB Output is correct
80 Correct 97 ms 6484 KB Output is correct
81 Correct 105 ms 6524 KB Output is correct
82 Correct 84 ms 6164 KB Output is correct
83 Correct 102 ms 6732 KB Output is correct
84 Correct 86 ms 6576 KB Output is correct
85 Correct 104 ms 6668 KB Output is correct
86 Correct 142 ms 6624 KB Output is correct
87 Correct 92 ms 6600 KB Output is correct
88 Correct 103 ms 6988 KB Output is correct
89 Correct 129 ms 6672 KB Output is correct
90 Correct 136 ms 6940 KB Output is correct
91 Correct 111 ms 6812 KB Output is correct
92 Correct 117 ms 6928 KB Output is correct