oj.uz

답안 #535620

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
535620 2022-03-10T16:50:08 Z louiskwok Mecho (IOI09_mecho) C++17
73 / 100
 216 ms 9420 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==sr&&nc==sc) distBee[nr][nc] = distBee[curR][curC]+1;
            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 = 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
73.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 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 119 ms 9148 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 1 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 1108 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 1 ms 1364 KB Output is correct
27 Correct 1 ms 1236 KB Output is correct
28 Correct 2 ms 1492 KB Output is correct
29 Correct 1 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 1 ms 1492 KB Output is correct
33 Correct 11 ms 3136 KB Output is correct
34 Correct 12 ms 4308 KB Output is correct
35 Correct 28 ms 4508 KB Output is correct
36 Correct 15 ms 3544 KB Output is correct
37 Correct 16 ms 4836 KB Output is correct
38 Correct 34 ms 5028 KB Output is correct
39 Correct 17 ms 3812 KB Output is correct
40 Correct 21 ms 5348 KB Output is correct
41 Correct 45 ms 5440 KB Output is correct
42 Correct 21 ms 4308 KB Output is correct
43 Correct 24 ms 5964 KB Output is correct
44 Correct 53 ms 6032 KB Output is correct
45 Correct 25 ms 4460 KB Output is correct
46 Correct 29 ms 6360 KB Output is correct
47 Correct 68 ms 6484 KB Output is correct
48 Correct 33 ms 4756 KB Output is correct
49 Correct 39 ms 6928 KB Output is correct
50 Correct 82 ms 7028 KB Output is correct
51 Correct 35 ms 5096 KB Output is correct
52 Correct 43 ms 7396 KB Output is correct
53 Correct 110 ms 7572 KB Output is correct
54 Correct 40 ms 5396 KB Output is correct
55 Correct 45 ms 7828 KB Output is correct
56 Correct 138 ms 8016 KB Output is correct
57 Correct 46 ms 5756 KB Output is correct
58 Correct 52 ms 8248 KB Output is correct
59 Correct 140 ms 8588 KB Output is correct
60 Correct 53 ms 6116 KB Output is correct
61 Correct 60 ms 8616 KB Output is correct
62 Correct 161 ms 9152 KB Output is correct
63 Correct 126 ms 9164 KB Output is correct
64 Correct 194 ms 9052 KB Output is correct
65 Correct 216 ms 9068 KB Output is correct
66 Correct 182 ms 9236 KB Output is correct
67 Correct 154 ms 8908 KB Output is correct
68 Correct 76 ms 8636 KB Output is correct
69 Correct 70 ms 8840 KB Output is correct
70 Correct 74 ms 8456 KB Output is correct
71 Correct 67 ms 8372 KB Output is correct
72 Incorrect 101 ms 8964 KB Output isn't correct
73 Incorrect 96 ms 9384 KB Output isn't correct
74 Correct 98 ms 9288 KB Output is correct
75 Correct 94 ms 9360 KB Output is correct
76 Correct 87 ms 9216 KB Output is correct
77 Correct 91 ms 9420 KB Output is correct
78 Correct 100 ms 6660 KB Output is correct
79 Correct 95 ms 9336 KB Output is correct
80 Correct 84 ms 6732 KB Output is correct
81 Correct 96 ms 6564 KB Output is correct
82 Correct 91 ms 6776 KB Output is correct
83 Correct 101 ms 6680 KB Output is correct
84 Correct 107 ms 9248 KB Output is correct
85 Correct 96 ms 6736 KB Output is correct
86 Correct 110 ms 6724 KB Output is correct
87 Correct 101 ms 6984 KB Output is correct
88 Correct 107 ms 7004 KB Output is correct
89 Correct 117 ms 9212 KB Output is correct
90 Correct 114 ms 8332 KB Output is correct
91 Correct 125 ms 9208 KB Output is correct
92 Correct 114 ms 7212 KB Output is correct