oj.uz

답안 #535612

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
535612 2022-03-10T16:38:20 Z louiskwok Mecho (IOI09_mecho) C++17
84 / 100
 209 ms 9292 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;
            else if (distBear[curR][curC]+(double)1/s==distBee[nr][nc]&&(nr!=er||nc!=ec)) 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 (lo==hi&&possible(lo)) cout << lo << 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 852 KB Output isn't correct
5 Correct 1 ms 980 KB Output is correct
6 Incorrect 1 ms 928 KB Output isn't correct
7 Incorrect 124 ms 7312 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 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 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 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 1236 KB Output is correct
32 Correct 2 ms 1364 KB Output is correct
33 Correct 10 ms 2752 KB Output is correct
34 Correct 11 ms 3284 KB Output is correct
35 Correct 26 ms 4400 KB Output is correct
36 Correct 14 ms 3028 KB Output is correct
37 Correct 15 ms 3616 KB Output is correct
38 Correct 35 ms 5016 KB Output is correct
39 Correct 17 ms 3196 KB Output is correct
40 Correct 17 ms 4036 KB Output is correct
41 Correct 42 ms 5540 KB Output is correct
42 Correct 21 ms 3564 KB Output is correct
43 Correct 21 ms 4352 KB Output is correct
44 Correct 52 ms 6028 KB Output is correct
45 Correct 25 ms 3792 KB Output is correct
46 Correct 25 ms 4804 KB Output is correct
47 Correct 63 ms 6484 KB Output is correct
48 Correct 28 ms 4044 KB Output is correct
49 Correct 30 ms 5076 KB Output is correct
50 Correct 72 ms 6984 KB Output is correct
51 Correct 33 ms 4344 KB Output is correct
52 Correct 33 ms 5408 KB Output is correct
53 Correct 100 ms 7596 KB Output is correct
54 Correct 37 ms 4492 KB Output is correct
55 Correct 38 ms 5712 KB Output is correct
56 Correct 114 ms 8012 KB Output is correct
57 Correct 43 ms 4808 KB Output is correct
58 Correct 47 ms 6024 KB Output is correct
59 Correct 132 ms 8584 KB Output is correct
60 Correct 47 ms 5148 KB Output is correct
61 Correct 55 ms 6320 KB Output is correct
62 Correct 165 ms 9096 KB Output is correct
63 Correct 144 ms 9040 KB Output is correct
64 Correct 209 ms 9008 KB Output is correct
65 Correct 198 ms 8996 KB Output is correct
66 Correct 168 ms 8944 KB Output is correct
67 Correct 172 ms 8848 KB Output is correct
68 Correct 87 ms 8572 KB Output is correct
69 Correct 70 ms 8860 KB Output is correct
70 Correct 69 ms 8540 KB Output is correct
71 Correct 67 ms 8360 KB Output is correct
72 Correct 61 ms 6616 KB Output is correct
73 Correct 66 ms 9276 KB Output is correct
74 Correct 93 ms 9292 KB Output is correct
75 Correct 90 ms 9084 KB Output is correct
76 Correct 88 ms 8908 KB Output is correct
77 Correct 108 ms 9272 KB Output is correct
78 Correct 124 ms 6720 KB Output is correct
79 Correct 100 ms 6296 KB Output is correct
80 Correct 106 ms 6488 KB Output is correct
81 Correct 121 ms 6512 KB Output is correct
82 Correct 96 ms 6180 KB Output is correct
83 Correct 131 ms 6796 KB Output is correct
84 Correct 113 ms 6556 KB Output is correct
85 Correct 114 ms 6624 KB Output is correct
86 Correct 128 ms 6644 KB Output is correct
87 Correct 120 ms 6544 KB Output is correct
88 Correct 135 ms 7004 KB Output is correct
89 Correct 136 ms 6760 KB Output is correct
90 Correct 140 ms 6948 KB Output is correct
91 Correct 137 ms 6660 KB Output is correct
92 Correct 132 ms 6956 KB Output is correct