oj.uz

답안 #535605

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
535605 2022-03-10T16:28:25 Z louiskwok Mecho (IOI09_mecho) C++17
58 / 100
 187 ms 9408 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 = distBee[sr][sc];
    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 852 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 103 ms 7300 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 1052 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 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 12 ms 2784 KB Output is correct
34 Correct 13 ms 3260 KB Output is correct
35 Correct 36 ms 4400 KB Output is correct
36 Correct 14 ms 2956 KB Output is correct
37 Correct 14 ms 3668 KB Output is correct
38 Correct 38 ms 5016 KB Output is correct
39 Correct 16 ms 3284 KB Output is correct
40 Correct 18 ms 4052 KB Output is correct
41 Correct 44 ms 5516 KB Output is correct
42 Correct 22 ms 3452 KB Output is correct
43 Correct 21 ms 4356 KB Output is correct
44 Correct 67 ms 5972 KB Output is correct
45 Correct 28 ms 3744 KB Output is correct
46 Correct 29 ms 4748 KB Output is correct
47 Correct 69 ms 6656 KB Output is correct
48 Correct 27 ms 3968 KB Output is correct
49 Correct 30 ms 5076 KB Output is correct
50 Correct 86 ms 7036 KB Output is correct
51 Correct 36 ms 4232 KB Output is correct
52 Correct 40 ms 5396 KB Output is correct
53 Correct 98 ms 7648 KB Output is correct
54 Correct 40 ms 4592 KB Output is correct
55 Correct 42 ms 5744 KB Output is correct
56 Correct 120 ms 8052 KB Output is correct
57 Correct 52 ms 4816 KB Output is correct
58 Correct 50 ms 6092 KB Output is correct
59 Correct 141 ms 8580 KB Output is correct
60 Correct 49 ms 5036 KB Output is correct
61 Correct 55 ms 6380 KB Output is correct
62 Correct 170 ms 9076 KB Output is correct
63 Incorrect 126 ms 8800 KB Output isn't correct
64 Correct 179 ms 9072 KB Output is correct
65 Correct 187 ms 9172 KB Output is correct
66 Correct 180 ms 9060 KB Output is correct
67 Correct 138 ms 8940 KB Output is correct
68 Incorrect 75 ms 8192 KB Output isn't correct
69 Correct 62 ms 8728 KB Output is correct
70 Correct 73 ms 8452 KB Output is correct
71 Correct 69 ms 8456 KB Output is correct
72 Incorrect 59 ms 6576 KB Output isn't correct
73 Incorrect 66 ms 9408 KB Output isn't correct
74 Correct 85 ms 9292 KB Output is correct
75 Correct 97 ms 9112 KB Output is correct
76 Correct 95 ms 8884 KB Output is correct
77 Correct 87 ms 9164 KB Output is correct
78 Correct 97 ms 6692 KB Output is correct
79 Correct 78 ms 6380 KB Output is correct
80 Correct 92 ms 6476 KB Output is correct
81 Correct 103 ms 6528 KB Output is correct
82 Correct 81 ms 6188 KB Output is correct
83 Incorrect 111 ms 6696 KB Output isn't correct
84 Correct 114 ms 6604 KB Output is correct
85 Correct 90 ms 6692 KB Output is correct
86 Correct 108 ms 6724 KB Output is correct
87 Correct 142 ms 6596 KB Output is correct
88 Incorrect 114 ms 6848 KB Output isn't correct
89 Correct 107 ms 6756 KB Output is correct
90 Correct 130 ms 7032 KB Output is correct
91 Correct 138 ms 6728 KB Output is correct
92 Correct 104 ms 6948 KB Output is correct