oj.uz

답안 #535719

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
535719 2022-03-11T03:01:12 Z louiskwok Mecho (IOI09_mecho) C++17
89 / 100
 220 ms 6928 KB 
#include <bits/stdc++.h>
using namespace std;
bool visited[805][805];
int distBee[805][805];
int distBear[805][805];
char g[805][805];
int dr[] = {-1,0,1,0};
int dc[] = {0,1,0,-1};
int n,s,sr,sc,er,ec,mxtime;
bool possible(int t) {
    memset(visited,0,sizeof visited);
    queue < pair <pair<int,int>,int> > bfs;
    bfs.push({{sr,sc},0});
    visited[sr][sc] = true;
    distBear[sr][sc] = t;
    while (!bfs.empty()) {
        int curR = bfs.front().first.first;
        int curC = bfs.front().first.second;
        int steps = 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]+((steps+1)%s==0?1:0)>=distBee[nr][nc]) continue;
            visited[nr][nc] = true;
            distBear[nr][nc] = distBear[curR][curC] + ((steps+1)%s==0?1:0);
            bfs.push({{nr,nc},steps+1});
        }
    }
    if (visited[er][ec]) 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];
            distBee[i][j]=1000000;
            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;
                distBee[i][j] = 0;
                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]!='G') 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 = mxtime;
    while (lo<hi) {
        int mid = (lo+hi+1)/2;
        bool poss = possible(mid);
        if (poss) lo = mid;
        else hi = mid-1;
    }
    if (!possible(0)) cout << -1 << endl;
    else cout << lo << endl;
    return 0;
}

Subtask #1
89.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 852 KB Output is correct
2 Correct 1 ms 852 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 130 ms 6660 KB Output is 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 Correct 1 ms 1364 KB Output is correct
13 Incorrect 1 ms 1108 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 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 2 ms 1364 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 1364 KB Output is correct
32 Correct 1 ms 1364 KB Output is correct
33 Correct 11 ms 2772 KB Output is correct
34 Correct 12 ms 3392 KB Output is correct
35 Correct 27 ms 3412 KB Output is correct
36 Correct 15 ms 3064 KB Output is correct
37 Correct 18 ms 3784 KB Output is correct
38 Correct 36 ms 3668 KB Output is correct
39 Correct 19 ms 3344 KB Output is correct
40 Correct 19 ms 4104 KB Output is correct
41 Correct 51 ms 4104 KB Output is correct
42 Correct 24 ms 3668 KB Output is correct
43 Correct 23 ms 4436 KB Output is correct
44 Correct 63 ms 4472 KB Output is correct
45 Correct 26 ms 3944 KB Output is correct
46 Correct 31 ms 4736 KB Output is correct
47 Correct 76 ms 4828 KB Output is correct
48 Correct 32 ms 4180 KB Output is correct
49 Correct 35 ms 5112 KB Output is correct
50 Correct 102 ms 5180 KB Output is correct
51 Correct 38 ms 4492 KB Output is correct
52 Correct 43 ms 5488 KB Output is correct
53 Correct 112 ms 5448 KB Output is correct
54 Correct 41 ms 4684 KB Output is correct
55 Correct 47 ms 5812 KB Output is correct
56 Correct 143 ms 5916 KB Output is correct
57 Correct 47 ms 4968 KB Output is correct
58 Correct 55 ms 6208 KB Output is correct
59 Correct 185 ms 6224 KB Output is correct
60 Correct 63 ms 5324 KB Output is correct
61 Correct 66 ms 6568 KB Output is correct
62 Correct 174 ms 6596 KB Output is correct
63 Correct 150 ms 6600 KB Output is correct
64 Correct 220 ms 6608 KB Output is correct
65 Correct 204 ms 6604 KB Output is correct
66 Correct 151 ms 6516 KB Output is correct
67 Correct 177 ms 6608 KB Output is correct
68 Correct 73 ms 6540 KB Output is correct
69 Correct 77 ms 6724 KB Output is correct
70 Correct 67 ms 6564 KB Output is correct
71 Correct 70 ms 6628 KB Output is correct
72 Incorrect 69 ms 6548 KB Output isn't correct
73 Incorrect 96 ms 6872 KB Output isn't correct
74 Correct 100 ms 6860 KB Output is correct
75 Correct 101 ms 6928 KB Output is correct
76 Correct 83 ms 6880 KB Output is correct
77 Correct 95 ms 6868 KB Output is correct
78 Correct 95 ms 5644 KB Output is correct
79 Correct 97 ms 6760 KB Output is correct
80 Correct 91 ms 5524 KB Output is correct
81 Correct 92 ms 5440 KB Output is correct
82 Correct 85 ms 5604 KB Output is correct
83 Correct 127 ms 5496 KB Output is correct
84 Correct 117 ms 6728 KB Output is correct
85 Correct 101 ms 5612 KB Output is correct
86 Correct 118 ms 5452 KB Output is correct
87 Correct 116 ms 5700 KB Output is correct
88 Correct 99 ms 5816 KB Output is correct
89 Correct 116 ms 6632 KB Output is correct
90 Correct 135 ms 6384 KB Output is correct
91 Correct 137 ms 6668 KB Output is correct
92 Correct 109 ms 5708 KB Output is correct