oj.uz

답안 #535616

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
535616 2022-03-10T16:46:10 Z louiskwok Mecho (IOI09_mecho) C++17
73 / 100
 218 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'||g[nr][nc]=='M') 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;
        if (possible((double)mid)) lo = mid;
        else hi = mid-1;
    }
    if (success) cout << lo << endl;
    else if (lo==hi&&possible(lo)) cout << lo << endl;
    else cout << -1 << endl;
    return 0;
}

Subtask #1
73.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 852 KB Output is correct
2 Incorrect 1 ms 916 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 114 ms 7236 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 Incorrect 1 ms 1236 KB Output isn't correct
14 Correct 2 ms 1236 KB Output is correct
15 Correct 2 ms 980 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 2 ms 980 KB Output is correct
18 Correct 1 ms 980 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 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 1320 KB Output is correct
29 Correct 1 ms 1236 KB Output is correct
30 Correct 1 ms 1364 KB Output is correct
31 Correct 2 ms 1236 KB Output is correct
32 Correct 2 ms 1364 KB Output is correct
33 Correct 12 ms 2772 KB Output is correct
34 Correct 12 ms 3284 KB Output is correct
35 Correct 28 ms 4508 KB Output is correct
36 Correct 14 ms 3020 KB Output is correct
37 Correct 14 ms 3624 KB Output is correct
38 Correct 33 ms 4948 KB Output is correct
39 Correct 16 ms 3268 KB Output is correct
40 Correct 18 ms 4052 KB Output is correct
41 Correct 48 ms 5512 KB Output is correct
42 Correct 19 ms 3540 KB Output is correct
43 Correct 23 ms 4376 KB Output is correct
44 Correct 75 ms 6028 KB Output is correct
45 Correct 31 ms 3784 KB Output is correct
46 Correct 26 ms 4748 KB Output is correct
47 Correct 64 ms 6480 KB Output is correct
48 Correct 29 ms 4024 KB Output is correct
49 Correct 29 ms 5076 KB Output is correct
50 Correct 91 ms 7052 KB Output is correct
51 Correct 36 ms 4336 KB Output is correct
52 Correct 46 ms 5384 KB Output is correct
53 Correct 137 ms 7460 KB Output is correct
54 Correct 36 ms 4492 KB Output is correct
55 Correct 40 ms 5768 KB Output is correct
56 Correct 108 ms 8080 KB Output is correct
57 Correct 47 ms 4792 KB Output is correct
58 Correct 48 ms 5996 KB Output is correct
59 Correct 200 ms 8616 KB Output is correct
60 Correct 49 ms 5124 KB Output is correct
61 Correct 54 ms 6244 KB Output is correct
62 Correct 176 ms 9092 KB Output is correct
63 Correct 148 ms 8960 KB Output is correct
64 Correct 186 ms 9100 KB Output is correct
65 Correct 218 ms 9036 KB Output is correct
66 Correct 177 ms 9056 KB Output is correct
67 Correct 158 ms 8872 KB Output is correct
68 Correct 83 ms 8580 KB Output is correct
69 Correct 75 ms 8744 KB Output is correct
70 Correct 69 ms 8456 KB Output is correct
71 Correct 72 ms 8396 KB Output is correct
72 Incorrect 100 ms 8968 KB Output isn't correct
73 Incorrect 104 ms 9212 KB Output isn't correct
74 Correct 91 ms 9292 KB Output is correct
75 Correct 102 ms 9320 KB Output is correct
76 Correct 104 ms 8916 KB Output is correct
77 Correct 95 ms 9216 KB Output is correct
78 Correct 95 ms 6732 KB Output is correct
79 Correct 84 ms 6240 KB Output is correct
80 Correct 101 ms 6332 KB Output is correct
81 Correct 103 ms 6504 KB Output is correct
82 Correct 93 ms 6296 KB Output is correct
83 Correct 106 ms 6712 KB Output is correct
84 Correct 106 ms 6668 KB Output is correct
85 Correct 139 ms 6648 KB Output is correct
86 Correct 103 ms 6720 KB Output is correct
87 Correct 105 ms 6596 KB Output is correct
88 Correct 109 ms 7000 KB Output is correct
89 Correct 146 ms 6832 KB Output is correct
90 Correct 108 ms 6904 KB Output is correct
91 Correct 111 ms 6768 KB Output is correct
92 Correct 113 ms 6948 KB Output is correct