oj.uz

답안 #535602

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
535602 2022-03-10T16:26:01 Z louiskwok Mecho (IOI09_mecho) C++17
58 / 100
 194 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;
            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 cnt = 0;
    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 cout << -1 << endl;
    return 0;
}

Compilation message

mecho.cpp: In function 'int main()':
mecho.cpp:64:9: warning: unused variable 'cnt' [-Wunused-variable]
   64 |     int cnt = 0;
      |         ^~~

Subtask #1
58.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 Incorrect 1 ms 980 KB Output isn't correct
6 Incorrect 1 ms 980 KB Output isn't correct
7 Incorrect 107 ms 7144 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 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 980 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 1236 KB Output is correct
29 Correct 1 ms 1236 KB Output is correct
30 Correct 2 ms 1304 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 2728 KB Output is correct
34 Correct 11 ms 3244 KB Output is correct
35 Correct 24 ms 4480 KB Output is correct
36 Correct 14 ms 3048 KB Output is correct
37 Correct 14 ms 3692 KB Output is correct
38 Correct 35 ms 4916 KB Output is correct
39 Correct 18 ms 3228 KB Output is correct
40 Correct 19 ms 4024 KB Output is correct
41 Correct 50 ms 5516 KB Output is correct
42 Correct 21 ms 3472 KB Output is correct
43 Correct 22 ms 4492 KB Output is correct
44 Correct 55 ms 6092 KB Output is correct
45 Correct 23 ms 3784 KB Output is correct
46 Correct 25 ms 4704 KB Output is correct
47 Correct 85 ms 6544 KB Output is correct
48 Correct 30 ms 4004 KB Output is correct
49 Correct 29 ms 5076 KB Output is correct
50 Correct 83 ms 6988 KB Output is correct
51 Correct 32 ms 4296 KB Output is correct
52 Correct 38 ms 5392 KB Output is correct
53 Correct 115 ms 7548 KB Output is correct
54 Correct 38 ms 4580 KB Output is correct
55 Correct 41 ms 5708 KB Output is correct
56 Correct 112 ms 8084 KB Output is correct
57 Correct 44 ms 4760 KB Output is correct
58 Correct 45 ms 6048 KB Output is correct
59 Correct 146 ms 8624 KB Output is correct
60 Correct 48 ms 5064 KB Output is correct
61 Correct 50 ms 6356 KB Output is correct
62 Correct 150 ms 9092 KB Output is correct
63 Incorrect 120 ms 8872 KB Output isn't correct
64 Correct 194 ms 9104 KB Output is correct
65 Correct 177 ms 9012 KB Output is correct
66 Correct 137 ms 9020 KB Output is correct
67 Correct 135 ms 8812 KB Output is correct
68 Incorrect 74 ms 8264 KB Output isn't correct
69 Correct 72 ms 8780 KB Output is correct
70 Correct 62 ms 8408 KB Output is correct
71 Correct 64 ms 8372 KB Output is correct
72 Incorrect 55 ms 4840 KB Output isn't correct
73 Incorrect 63 ms 9292 KB Output isn't correct
74 Correct 80 ms 9292 KB Output is correct
75 Correct 91 ms 9292 KB Output is correct
76 Correct 80 ms 8988 KB Output is correct
77 Correct 89 ms 9164 KB Output is correct
78 Correct 90 ms 6692 KB Output is correct
79 Correct 71 ms 6228 KB Output is correct
80 Correct 79 ms 6340 KB Output is correct
81 Correct 93 ms 6608 KB Output is correct
82 Correct 80 ms 6224 KB Output is correct
83 Incorrect 91 ms 6620 KB Output isn't correct
84 Correct 98 ms 6732 KB Output is correct
85 Correct 100 ms 6604 KB Output is correct
86 Correct 98 ms 6644 KB Output is correct
87 Correct 94 ms 6568 KB Output is correct
88 Incorrect 98 ms 6904 KB Output isn't correct
89 Correct 104 ms 6940 KB Output is correct
90 Correct 107 ms 6856 KB Output is correct
91 Correct 104 ms 6736 KB Output is correct
92 Correct 105 ms 6952 KB Output is correct