oj.uz

Submission #535607

# Submission time Handle Problem Language Result Execution time Memory
535607 2022-03-10T16:30:45 Z louiskwok Mecho (IOI09_mecho) C++17
63 / 100
 192 ms 9356 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 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 cout << -1 << endl;
    return 0;
}

Subtask #1
63.0 / 100.0

# Verdict Execution time Memory 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 130 ms 7328 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 1452 KB Output isn't correct
13 Incorrect 1 ms 468 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 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 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 2 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 2 ms 1436 KB Output is correct
31 Correct 2 ms 1236 KB Output is correct
32 Correct 1 ms 1364 KB Output is correct
33 Correct 14 ms 2756 KB Output is correct
34 Correct 14 ms 3264 KB Output is correct
35 Correct 35 ms 4436 KB Output is correct
36 Correct 15 ms 2952 KB Output is correct
37 Correct 17 ms 3760 KB Output is correct
38 Correct 33 ms 5024 KB Output is correct
39 Correct 20 ms 3240 KB Output is correct
40 Correct 22 ms 4084 KB Output is correct
41 Correct 56 ms 5512 KB Output is correct
42 Correct 22 ms 3540 KB Output is correct
43 Correct 22 ms 4436 KB Output is correct
44 Correct 56 ms 6036 KB Output is correct
45 Correct 27 ms 3804 KB Output is correct
46 Correct 29 ms 4700 KB Output is correct
47 Correct 82 ms 6544 KB Output is correct
48 Correct 34 ms 4044 KB Output is correct
49 Correct 32 ms 5080 KB Output is correct
50 Correct 85 ms 6968 KB Output is correct
51 Correct 35 ms 4312 KB Output is correct
52 Correct 39 ms 5412 KB Output is correct
53 Correct 133 ms 7460 KB Output is correct
54 Correct 36 ms 4576 KB Output is correct
55 Correct 38 ms 5764 KB Output is correct
56 Correct 120 ms 8080 KB Output is correct
57 Correct 44 ms 4856 KB Output is correct
58 Correct 45 ms 6088 KB Output is correct
59 Correct 130 ms 8588 KB Output is correct
60 Correct 47 ms 5112 KB Output is correct
61 Correct 52 ms 6340 KB Output is correct
62 Correct 176 ms 9112 KB Output is correct
63 Incorrect 113 ms 8780 KB Output isn't correct
64 Correct 183 ms 9104 KB Output is correct
65 Correct 192 ms 9060 KB Output is correct
66 Correct 157 ms 9068 KB Output is correct
67 Correct 135 ms 8956 KB Output is correct
68 Incorrect 70 ms 8200 KB Output isn't correct
69 Correct 66 ms 8712 KB Output is correct
70 Correct 71 ms 8456 KB Output is correct
71 Correct 71 ms 8368 KB Output is correct
72 Correct 60 ms 6536 KB Output is correct
73 Correct 57 ms 9356 KB Output is correct
74 Correct 85 ms 9284 KB Output is correct
75 Correct 84 ms 9068 KB Output is correct
76 Correct 82 ms 9008 KB Output is correct
77 Correct 85 ms 9212 KB Output is correct
78 Correct 95 ms 6732 KB Output is correct
79 Correct 84 ms 6300 KB Output is correct
80 Correct 94 ms 6468 KB Output is correct
81 Correct 90 ms 6480 KB Output is correct
82 Correct 79 ms 6220 KB Output is correct
83 Incorrect 97 ms 6672 KB Output isn't correct
84 Correct 89 ms 6648 KB Output is correct
85 Correct 109 ms 6584 KB Output is correct
86 Correct 126 ms 6720 KB Output is correct
87 Correct 89 ms 6588 KB Output is correct
88 Incorrect 116 ms 6908 KB Output isn't correct
89 Correct 119 ms 6740 KB Output is correct
90 Correct 132 ms 6884 KB Output is correct
91 Correct 100 ms 6732 KB Output is correct
92 Correct 116 ms 7116 KB Output is correct