Submission #960588

# Submission time Handle Problem Language Result Execution time Memory
960588 2024-04-10T16:26:17 Z htphong0909 Mecho (IOI09_mecho) C++17
84 / 100
109 ms 8156 KB
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second

using ll = long long;
using ii = pair<int, int>;

const int N = 1e6+5;
const int INF = 1e9;

int d[1000][1000],m[1000][1000],n,s;
char a[1000][1000];
int dx[4]={1,0,0,-1};
int dy[4]={0,1,-1,0};
ii pos,h;

bool bfs(int x) {
    queue<ii> q;
    if (d[pos.fi][pos.se] <= x) return 0;
    q.push(pos);
    for(int i=0;i<n;i++) {
        for(int j=0;j<n;j++) {
            m[i][j]=0;
        }
    }
    while(!q.empty()) {
        ii u=q.front();
        q.pop();
        for(int i=0;i<4;i++) {
            ii v={u.fi+dx[i],u.se+dy[i]};
            if(v.fi<0 || v.fi>=n || v.se<0 || v.se>=n) continue;
            if(m[v.fi][v.se]==0 && a[v.fi][v.se]!='T' &&
               d[v.fi][v.se]-x>(m[u.fi][u.se]+1)/s && a[v.fi][v.se]!='M') {
                m[v.fi][v.se]=m[u.fi][u.se]+1;
                q.push(v);
            }
        }
    }
    if(m[h.fi][h.se]>0) return 1; else return 0;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    queue<ii> q;
    cin >> n >> s;
    for(int i=0;i<n;i++) {
        for(int j=0;j<n;j++) {
            cin >> a[i][j];
            if(a[i][j]=='H') {
                q.push({i,j});
            }
            if(a[i][j]=='M') pos={i,j};
            if(a[i][j]=='D') h={i,j};
        }
    }
    while(!q.empty()) {
        ii u=q.front();
        q.pop();
        for(int i=0;i<4;i++) {
            ii v={u.fi+dx[i],u.se+dy[i]};
            if(v.fi<0 || v.fi>=n || v.se<0 || v.se>=n) continue;
            if(d[v.fi][v.se]==0 && a[v.fi][v.se]!='T' && a[v.fi][v.se]!='H') {
                d[v.fi][v.se]=d[u.fi][u.se]+1;
                q.push(v);
            }
        }
    }
    int l=0,r=1000000,ans=-1;
    while(l<=r) {
        int m=(l+r)/2;
        if(bfs(m)) {
            ans=m;
            l=m+1;
        }
        else {
            r=m-1;
        }
    }
    cout << ans;
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Correct 1 ms 2396 KB Output is correct
4 Incorrect 1 ms 2396 KB Output isn't correct
5 Correct 1 ms 2396 KB Output is correct
6 Incorrect 1 ms 2396 KB Output isn't correct
7 Incorrect 49 ms 7812 KB Output isn't correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 2 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Incorrect 1 ms 2652 KB Output isn't correct
13 Correct 1 ms 2520 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 1 ms 2652 KB Output is correct
21 Correct 1 ms 2560 KB Output is correct
22 Correct 1 ms 2652 KB Output is correct
23 Correct 1 ms 2652 KB Output is correct
24 Correct 1 ms 2652 KB Output is correct
25 Correct 1 ms 2652 KB Output is correct
26 Correct 1 ms 2652 KB Output is correct
27 Correct 1 ms 2652 KB Output is correct
28 Correct 1 ms 2652 KB Output is correct
29 Correct 1 ms 2652 KB Output is correct
30 Correct 1 ms 2652 KB Output is correct
31 Correct 1 ms 2652 KB Output is correct
32 Correct 1 ms 2652 KB Output is correct
33 Correct 4 ms 6016 KB Output is correct
34 Correct 4 ms 5980 KB Output is correct
35 Correct 13 ms 5980 KB Output is correct
36 Correct 4 ms 6244 KB Output is correct
37 Correct 4 ms 6236 KB Output is correct
38 Correct 20 ms 6492 KB Output is correct
39 Correct 5 ms 6388 KB Output is correct
40 Correct 5 ms 6488 KB Output is correct
41 Correct 20 ms 6492 KB Output is correct
42 Correct 7 ms 6492 KB Output is correct
43 Correct 7 ms 6492 KB Output is correct
44 Correct 29 ms 6704 KB Output is correct
45 Correct 7 ms 6744 KB Output is correct
46 Correct 7 ms 6748 KB Output is correct
47 Correct 32 ms 6748 KB Output is correct
48 Correct 9 ms 7004 KB Output is correct
49 Correct 8 ms 7004 KB Output is correct
50 Correct 45 ms 7088 KB Output is correct
51 Correct 10 ms 7260 KB Output is correct
52 Correct 10 ms 7048 KB Output is correct
53 Correct 44 ms 7268 KB Output is correct
54 Correct 12 ms 7256 KB Output is correct
55 Correct 12 ms 7484 KB Output is correct
56 Correct 53 ms 7256 KB Output is correct
57 Correct 13 ms 7516 KB Output is correct
58 Correct 11 ms 7516 KB Output is correct
59 Correct 64 ms 7516 KB Output is correct
60 Correct 14 ms 8024 KB Output is correct
61 Correct 17 ms 7772 KB Output is correct
62 Correct 78 ms 7772 KB Output is correct
63 Correct 73 ms 7860 KB Output is correct
64 Correct 109 ms 7860 KB Output is correct
65 Correct 105 ms 7772 KB Output is correct
66 Correct 93 ms 7768 KB Output is correct
67 Correct 70 ms 7768 KB Output is correct
68 Correct 37 ms 7900 KB Output is correct
69 Correct 33 ms 7772 KB Output is correct
70 Correct 30 ms 7764 KB Output is correct
71 Correct 25 ms 7764 KB Output is correct
72 Correct 27 ms 7772 KB Output is correct
73 Correct 26 ms 8028 KB Output is correct
74 Correct 36 ms 8156 KB Output is correct
75 Correct 42 ms 8028 KB Output is correct
76 Correct 37 ms 8024 KB Output is correct
77 Correct 42 ms 8016 KB Output is correct
78 Correct 42 ms 8096 KB Output is correct
79 Correct 33 ms 8028 KB Output is correct
80 Correct 37 ms 8064 KB Output is correct
81 Correct 42 ms 7920 KB Output is correct
82 Correct 34 ms 8028 KB Output is correct
83 Correct 44 ms 8028 KB Output is correct
84 Correct 46 ms 8088 KB Output is correct
85 Correct 43 ms 7992 KB Output is correct
86 Correct 44 ms 8028 KB Output is correct
87 Correct 43 ms 8028 KB Output is correct
88 Correct 52 ms 8024 KB Output is correct
89 Correct 45 ms 8028 KB Output is correct
90 Correct 47 ms 8024 KB Output is correct
91 Correct 50 ms 8028 KB Output is correct
92 Correct 46 ms 8028 KB Output is correct