oj.uz

답안 #535628

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
535628 2022-03-10T17:01:43 Z louiskwok Mecho (IOI09_mecho) C++17
81 / 100
 193 ms 9352 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;
            if (g[nr][nc]=='M'||g[nr][nc]=='D') continue;
            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
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 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 116 ms 9084 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 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 1 ms 1492 KB Output is correct
29 Correct 1 ms 1364 KB Output is correct
30 Correct 1 ms 1492 KB Output is correct
31 Correct 2 ms 1364 KB Output is correct
32 Correct 1 ms 1492 KB Output is correct
33 Correct 11 ms 3156 KB Output is correct
34 Correct 14 ms 4268 KB Output is correct
35 Correct 27 ms 4508 KB Output is correct
36 Correct 16 ms 3540 KB Output is correct
37 Correct 16 ms 4820 KB Output is correct
38 Correct 34 ms 5036 KB Output is correct
39 Correct 18 ms 3824 KB Output is correct
40 Correct 20 ms 5348 KB Output is correct
41 Correct 42 ms 5460 KB Output is correct
42 Correct 21 ms 4172 KB Output is correct
43 Correct 25 ms 5972 KB Output is correct
44 Correct 63 ms 5988 KB Output is correct
45 Correct 25 ms 4432 KB Output is correct
46 Correct 32 ms 6404 KB Output is correct
47 Correct 66 ms 6508 KB Output is correct
48 Correct 32 ms 4820 KB Output is correct
49 Correct 34 ms 6920 KB Output is correct
50 Correct 78 ms 7044 KB Output is correct
51 Correct 34 ms 5068 KB Output is correct
52 Correct 40 ms 7288 KB Output is correct
53 Correct 104 ms 7608 KB Output is correct
54 Correct 41 ms 5400 KB Output is correct
55 Correct 45 ms 7756 KB Output is correct
56 Correct 120 ms 8008 KB Output is correct
57 Correct 45 ms 5744 KB Output is correct
58 Correct 50 ms 8216 KB Output is correct
59 Correct 144 ms 8544 KB Output is correct
60 Correct 52 ms 6084 KB Output is correct
61 Correct 57 ms 8616 KB Output is correct
62 Correct 160 ms 9012 KB Output is correct
63 Correct 121 ms 8980 KB Output is correct
64 Correct 193 ms 9164 KB Output is correct
65 Correct 190 ms 9024 KB Output is correct
66 Correct 164 ms 9100 KB Output is correct
67 Correct 144 ms 8928 KB Output is correct
68 Correct 76 ms 8648 KB Output is correct
69 Correct 69 ms 8756 KB Output is correct
70 Correct 67 ms 8536 KB Output is correct
71 Correct 70 ms 8460 KB Output is correct
72 Incorrect 100 ms 8972 KB Output isn't correct
73 Correct 66 ms 9288 KB Output is correct
74 Correct 99 ms 9344 KB Output is correct
75 Correct 87 ms 9352 KB Output is correct
76 Correct 86 ms 9256 KB Output is correct
77 Correct 90 ms 9340 KB Output is correct
78 Correct 117 ms 6688 KB Output is correct
79 Correct 98 ms 9292 KB Output is correct
80 Correct 87 ms 6744 KB Output is correct
81 Correct 98 ms 6556 KB Output is correct
82 Correct 91 ms 6884 KB Output is correct
83 Correct 100 ms 6656 KB Output is correct
84 Correct 107 ms 9284 KB Output is correct
85 Correct 97 ms 6756 KB Output is correct
86 Correct 104 ms 6704 KB Output is correct
87 Correct 95 ms 7020 KB Output is correct
88 Correct 117 ms 7084 KB Output is correct
89 Correct 123 ms 9308 KB Output is correct
90 Correct 114 ms 8252 KB Output is correct
91 Correct 116 ms 9252 KB Output is correct
92 Correct 109 ms 7112 KB Output is correct