oj.uz

답안 #1101375

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1101375 2024-10-16T07:32:46 Z jadai007 Mecho (IOI09_mecho) C++17
84 / 100
 125 ms 9252 KB 
#include<bits/stdc++.h>

using namespace std;

int n, s, disH[1010][1010], dis[1010][1010], xx[] = {0, 0, -1, 1}, xy[] = {-1, 1, 0, 0};
char mp[1010][1010];
queue<tuple<int, int, int>> q;

bool solve(int mid){
    for(int i = 1; i <= n; ++i){
        for(int j = 1; j <= n; ++j){
            if(mp[i][j] == 'M') q.emplace(i, j, 0), dis[i][j] = 0;
            else dis[i][j] = 1e9;
        }
    }
    while(!q.empty()){
        int x = get<0>(q.front()), y = get<1>(q.front()), w = get<2>(q.front()); q.pop();
        if(dis[x][y] < w || (dis[x][y] / s >= disH[x][y] - mid && disH[x][y] != 1e9)) continue;
        if(mp[x][y] == 'D') return true;
        for(int i = 0; i < 4; ++i){
            int nx = x + xx[i];
            int ny = y + xy[i];
            if(nx < 1 || nx > n || ny < 1 || ny > n || mp[nx][ny] == 'T') continue;
            if(dis[nx][ny] > w + 1){
                dis[nx][ny] = w + 1;
                q.emplace(nx, ny, w + 1);
            }
        }
    }
    return false;
}

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n >> s;
    for(int i = 1; i<=n; ++i) for(int j = 1; j <= n; ++j) cin >> mp[i][j];
    for(int i = 1; i <= n; ++i){
        for(int j = 1; j <=n; ++j){
            if(mp[i][j] == 'H') q.emplace(i, j, 0), disH[i][j] = 0;
            else disH[i][j] = 1e9;
        }
    }
    while(!q.empty()){
        int x = get<0>(q.front()), y = get<1>(q.front()), w = get<2>(q.front()); q.pop();
        if(disH[x][y] < w) continue;
        for(int i = 0; i < 4; ++i){
            int nx = x + xx[i];
            int ny = y + xy[i];
            if(nx < 1 || nx > n || ny < 1 || ny > n || mp[nx][ny] == 'T') continue;
            if(disH[nx][ny] > w + 1){
                disH[nx][ny] = w + 1;
                q.emplace(nx, ny, w + 1);
            }
        }   
    }
    int l = 0, r = 1e6, ans = -1;
    while(l <= r){
        int mid = (l + r) >> 1;
        if(solve(mid)) ans = mid, l = mid + 1;
        else r = mid - 1;
    }
    cout << ans;
}

Subtask #1
84.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4432 KB Output is correct
2 Incorrect 1 ms 4432 KB Output isn't correct
3 Correct 1 ms 4432 KB Output is correct
4 Incorrect 1 ms 4432 KB Output isn't correct
5 Correct 1 ms 4432 KB Output is correct
6 Incorrect 1 ms 4432 KB Output isn't correct
7 Incorrect 68 ms 8784 KB Output isn't correct
8 Correct 1 ms 4432 KB Output is correct
9 Correct 1 ms 4432 KB Output is correct
10 Correct 1 ms 4432 KB Output is correct
11 Correct 1 ms 4432 KB Output is correct
12 Incorrect 1 ms 4432 KB Output isn't correct
13 Correct 1 ms 4452 KB Output is correct
14 Correct 1 ms 4432 KB Output is correct
15 Correct 1 ms 4432 KB Output is correct
16 Correct 1 ms 4432 KB Output is correct
17 Correct 1 ms 4432 KB Output is correct
18 Correct 1 ms 4604 KB Output is correct
19 Correct 1 ms 4432 KB Output is correct
20 Correct 1 ms 4432 KB Output is correct
21 Correct 1 ms 4432 KB Output is correct
22 Correct 1 ms 4432 KB Output is correct
23 Correct 1 ms 4604 KB Output is correct
24 Correct 1 ms 4432 KB Output is correct
25 Correct 1 ms 4432 KB Output is correct
26 Correct 2 ms 4432 KB Output is correct
27 Correct 1 ms 4432 KB Output is correct
28 Correct 1 ms 4432 KB Output is correct
29 Correct 1 ms 4432 KB Output is correct
30 Correct 1 ms 4432 KB Output is correct
31 Correct 1 ms 4432 KB Output is correct
32 Correct 1 ms 4432 KB Output is correct
33 Correct 6 ms 8784 KB Output is correct
34 Correct 6 ms 8784 KB Output is correct
35 Correct 15 ms 8864 KB Output is correct
36 Correct 7 ms 8784 KB Output is correct
37 Correct 7 ms 8952 KB Output is correct
38 Correct 26 ms 8784 KB Output is correct
39 Correct 8 ms 8784 KB Output is correct
40 Correct 8 ms 8860 KB Output is correct
41 Correct 24 ms 8784 KB Output is correct
42 Correct 9 ms 8784 KB Output is correct
43 Correct 9 ms 8784 KB Output is correct
44 Correct 31 ms 8784 KB Output is correct
45 Correct 11 ms 8784 KB Output is correct
46 Correct 11 ms 8784 KB Output is correct
47 Correct 38 ms 8784 KB Output is correct
48 Correct 13 ms 8784 KB Output is correct
49 Correct 13 ms 8784 KB Output is correct
50 Correct 45 ms 8784 KB Output is correct
51 Correct 14 ms 8784 KB Output is correct
52 Correct 15 ms 8784 KB Output is correct
53 Correct 54 ms 8724 KB Output is correct
54 Correct 17 ms 8784 KB Output is correct
55 Correct 17 ms 8784 KB Output is correct
56 Correct 69 ms 8784 KB Output is correct
57 Correct 20 ms 8784 KB Output is correct
58 Correct 19 ms 8784 KB Output is correct
59 Correct 81 ms 8784 KB Output is correct
60 Correct 22 ms 8952 KB Output is correct
61 Correct 22 ms 8784 KB Output is correct
62 Correct 79 ms 8784 KB Output is correct
63 Correct 83 ms 8784 KB Output is correct
64 Correct 120 ms 8784 KB Output is correct
65 Correct 125 ms 8848 KB Output is correct
66 Correct 100 ms 8784 KB Output is correct
67 Correct 82 ms 8784 KB Output is correct
68 Correct 43 ms 8952 KB Output is correct
69 Correct 44 ms 8916 KB Output is correct
70 Correct 40 ms 8784 KB Output is correct
71 Correct 35 ms 8916 KB Output is correct
72 Correct 32 ms 8796 KB Output is correct
73 Correct 36 ms 9040 KB Output is correct
74 Correct 48 ms 9040 KB Output is correct
75 Correct 52 ms 9040 KB Output is correct
76 Correct 50 ms 9252 KB Output is correct
77 Correct 51 ms 9040 KB Output is correct
78 Correct 53 ms 9216 KB Output is correct
79 Correct 45 ms 9040 KB Output is correct
80 Correct 56 ms 9040 KB Output is correct
81 Correct 57 ms 9040 KB Output is correct
82 Correct 45 ms 9052 KB Output is correct
83 Correct 63 ms 9032 KB Output is correct
84 Correct 54 ms 9040 KB Output is correct
85 Correct 57 ms 8896 KB Output is correct
86 Correct 58 ms 9052 KB Output is correct
87 Correct 68 ms 8992 KB Output is correct
88 Correct 62 ms 9040 KB Output is correct
89 Correct 61 ms 9040 KB Output is correct
90 Correct 62 ms 9040 KB Output is correct
91 Correct 61 ms 9092 KB Output is correct
92 Correct 61 ms 9040 KB Output is correct