oj.uz

답안 #1101374

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1101374 2024-10-16T07:31:46 Z jadai007 Mecho (IOI09_mecho) C++17
63 / 100
 131 ms 9296 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 = 1, r = 1e9, 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
63.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4432 KB Output is correct
2 Incorrect 1 ms 4564 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 Incorrect 1 ms 4432 KB Output isn't correct
6 Incorrect 1 ms 4580 KB Output isn't correct
7 Incorrect 67 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 4444 KB Output isn't correct
13 Incorrect 1 ms 4432 KB Output isn't 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 4600 KB Output is correct
18 Correct 2 ms 4432 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 2 ms 4600 KB Output is correct
23 Correct 1 ms 4432 KB Output is correct
24 Correct 1 ms 4432 KB Output is correct
25 Correct 1 ms 4432 KB Output is correct
26 Correct 1 ms 4432 KB Output is correct
27 Correct 2 ms 4432 KB Output is correct
28 Correct 2 ms 4432 KB Output is correct
29 Correct 1 ms 4432 KB Output is correct
30 Correct 2 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 7 ms 8784 KB Output is correct
34 Correct 8 ms 8784 KB Output is correct
35 Correct 16 ms 8784 KB Output is correct
36 Correct 8 ms 8784 KB Output is correct
37 Correct 8 ms 8784 KB Output is correct
38 Correct 21 ms 9032 KB Output is correct
39 Correct 10 ms 8784 KB Output is correct
40 Correct 10 ms 8784 KB Output is correct
41 Correct 25 ms 8784 KB Output is correct
42 Correct 11 ms 8784 KB Output is correct
43 Correct 12 ms 8840 KB Output is correct
44 Correct 34 ms 8784 KB Output is correct
45 Correct 18 ms 8856 KB Output is correct
46 Correct 14 ms 8784 KB Output is correct
47 Correct 39 ms 8784 KB Output is correct
48 Correct 16 ms 8784 KB Output is correct
49 Correct 16 ms 8784 KB Output is correct
50 Correct 48 ms 8784 KB Output is correct
51 Correct 19 ms 8784 KB Output is correct
52 Correct 19 ms 8784 KB Output is correct
53 Correct 55 ms 8784 KB Output is correct
54 Correct 25 ms 8784 KB Output is correct
55 Correct 21 ms 8960 KB Output is correct
56 Correct 67 ms 8784 KB Output is correct
57 Correct 24 ms 8784 KB Output is correct
58 Correct 25 ms 8856 KB Output is correct
59 Correct 82 ms 8784 KB Output is correct
60 Correct 28 ms 8852 KB Output is correct
61 Correct 27 ms 8784 KB Output is correct
62 Correct 86 ms 8796 KB Output is correct
63 Incorrect 77 ms 8784 KB Output isn't correct
64 Correct 131 ms 8868 KB Output is correct
65 Correct 127 ms 9020 KB Output is correct
66 Correct 97 ms 8784 KB Output is correct
67 Correct 97 ms 8784 KB Output is correct
68 Incorrect 48 ms 8920 KB Output isn't correct
69 Correct 49 ms 8796 KB Output is correct
70 Correct 45 ms 8952 KB Output is correct
71 Correct 38 ms 8784 KB Output is correct
72 Correct 37 ms 8784 KB Output is correct
73 Correct 40 ms 9052 KB Output is correct
74 Correct 54 ms 9040 KB Output is correct
75 Correct 62 ms 9040 KB Output is correct
76 Correct 62 ms 9176 KB Output is correct
77 Correct 56 ms 9040 KB Output is correct
78 Correct 60 ms 9040 KB Output is correct
79 Correct 57 ms 9040 KB Output is correct
80 Correct 57 ms 9040 KB Output is correct
81 Correct 58 ms 9224 KB Output is correct
82 Correct 56 ms 9216 KB Output is correct
83 Incorrect 61 ms 9040 KB Output isn't correct
84 Correct 61 ms 9040 KB Output is correct
85 Correct 59 ms 9040 KB Output is correct
86 Correct 65 ms 9296 KB Output is correct
87 Correct 61 ms 9208 KB Output is correct
88 Incorrect 61 ms 9040 KB Output isn't correct
89 Correct 68 ms 9040 KB Output is correct
90 Correct 66 ms 9040 KB Output is correct
91 Correct 70 ms 9100 KB Output is correct
92 Correct 67 ms 9040 KB Output is correct