oj.uz

답안 #535615

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
535615 2022-03-10T16:44:59 Z louiskwok Mecho (IOI09_mecho) C++17
81 / 100
 193 ms 9344 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]);
            if (nr!=sr||nc!=sc) 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
81.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 105 ms 7212 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 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 2 ms 1236 KB Output is correct
29 Correct 2 ms 1236 KB Output is correct
30 Correct 2 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 11 ms 2772 KB Output is correct
34 Correct 11 ms 3284 KB Output is correct
35 Correct 24 ms 4516 KB Output is correct
36 Correct 13 ms 3028 KB Output is correct
37 Correct 15 ms 3732 KB Output is correct
38 Correct 32 ms 5020 KB Output is correct
39 Correct 16 ms 3284 KB Output is correct
40 Correct 18 ms 4052 KB Output is correct
41 Correct 39 ms 5524 KB Output is correct
42 Correct 19 ms 3484 KB Output is correct
43 Correct 21 ms 4444 KB Output is correct
44 Correct 51 ms 6008 KB Output is correct
45 Correct 24 ms 3808 KB Output is correct
46 Correct 25 ms 4820 KB Output is correct
47 Correct 70 ms 6540 KB Output is correct
48 Correct 31 ms 4024 KB Output is correct
49 Correct 34 ms 5096 KB Output is correct
50 Correct 79 ms 6988 KB Output is correct
51 Correct 33 ms 4300 KB Output is correct
52 Correct 35 ms 5456 KB Output is correct
53 Correct 102 ms 7492 KB Output is correct
54 Correct 37 ms 4496 KB Output is correct
55 Correct 38 ms 5760 KB Output is correct
56 Correct 115 ms 8012 KB Output is correct
57 Correct 42 ms 4820 KB Output is correct
58 Correct 45 ms 6012 KB Output is correct
59 Correct 127 ms 8576 KB Output is correct
60 Correct 47 ms 5068 KB Output is correct
61 Correct 51 ms 6332 KB Output is correct
62 Correct 160 ms 9200 KB Output is correct
63 Correct 135 ms 8984 KB Output is correct
64 Correct 193 ms 9060 KB Output is correct
65 Correct 187 ms 9072 KB Output is correct
66 Correct 156 ms 9036 KB Output is correct
67 Correct 140 ms 8884 KB Output is correct
68 Correct 82 ms 8668 KB Output is correct
69 Correct 72 ms 8640 KB Output is correct
70 Correct 72 ms 8448 KB Output is correct
71 Correct 65 ms 8436 KB Output is correct
72 Incorrect 92 ms 8956 KB Output isn't correct
73 Correct 58 ms 9344 KB Output is correct
74 Correct 82 ms 9196 KB Output is correct
75 Correct 84 ms 9088 KB Output is correct
76 Correct 91 ms 8956 KB Output is correct
77 Correct 95 ms 9272 KB Output is correct
78 Correct 108 ms 6848 KB Output is correct
79 Correct 79 ms 6364 KB Output is correct
80 Correct 83 ms 6384 KB Output is correct
81 Correct 96 ms 6524 KB Output is correct
82 Correct 84 ms 6204 KB Output is correct
83 Correct 107 ms 6752 KB Output is correct
84 Correct 100 ms 6652 KB Output is correct
85 Correct 86 ms 6556 KB Output is correct
86 Correct 97 ms 6716 KB Output is correct
87 Correct 105 ms 6532 KB Output is correct
88 Correct 102 ms 6996 KB Output is correct
89 Correct 99 ms 6728 KB Output is correct
90 Correct 102 ms 6912 KB Output is correct
91 Correct 107 ms 6768 KB Output is correct
92 Correct 102 ms 6860 KB Output is correct