Submission #960606

# Submission time Handle Problem Language Result Execution time Memory
960606 2024-04-10T16:56:50 Z LmaoLmao Mecho (IOI09_mecho) C++14
73 / 100
122 ms 15356 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;
 
ll d[1000][1000],m[1000][1000],n,s;
char a[1000][1000];
ll dx[4]={1,0,0,-1};
ll dy[4]={0,1,-1,0};
ii pos,h;
 
bool bfs(ll x) {
    queue<ii> q;
    q.push(pos);
    for(int i=0;i<n;i++) {
        for(int j=0;j<n;j++) {
            m[i][j]=0;
        }
    }
    while(!q.empty()) {
      	if(d[pos.fi][pos.se]-x*s<=0) return 0;
        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*s>m[u.fi][u.se]+1 && 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]+s;
                q.push(v);
            }
        }
    }
    ll 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 2 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 2 ms 2392 KB Output is correct
4 Incorrect 1 ms 2392 KB Output isn't correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Incorrect 53 ms 15212 KB Output isn't correct
8 Incorrect 1 ms 2396 KB Output isn't correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 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 2652 KB Output is correct
14 Incorrect 1 ms 2792 KB Output isn't 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 2900 KB Output is correct
20 Correct 1 ms 2648 KB Output is correct
21 Correct 1 ms 2652 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 2648 KB Output is correct
26 Correct 1 ms 2648 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 2908 KB Output is correct
32 Correct 1 ms 2908 KB Output is correct
33 Correct 5 ms 6516 KB Output is correct
34 Correct 5 ms 6748 KB Output is correct
35 Correct 15 ms 7004 KB Output is correct
36 Correct 5 ms 6744 KB Output is correct
37 Correct 5 ms 7260 KB Output is correct
38 Correct 17 ms 7512 KB Output is correct
39 Correct 8 ms 9304 KB Output is correct
40 Correct 7 ms 9564 KB Output is correct
41 Correct 24 ms 10076 KB Output is correct
42 Correct 8 ms 9564 KB Output is correct
43 Correct 9 ms 10076 KB Output is correct
44 Correct 29 ms 10588 KB Output is correct
45 Correct 9 ms 9816 KB Output is correct
46 Correct 9 ms 10588 KB Output is correct
47 Correct 38 ms 11100 KB Output is correct
48 Correct 10 ms 10328 KB Output is correct
49 Correct 11 ms 10840 KB Output is correct
50 Correct 46 ms 11356 KB Output is correct
51 Correct 12 ms 10588 KB Output is correct
52 Correct 17 ms 11096 KB Output is correct
53 Correct 52 ms 11872 KB Output is correct
54 Correct 14 ms 12888 KB Output is correct
55 Correct 15 ms 13660 KB Output is correct
56 Correct 81 ms 14172 KB Output is correct
57 Correct 15 ms 13148 KB Output is correct
58 Correct 14 ms 14212 KB Output is correct
59 Correct 70 ms 14668 KB Output is correct
60 Correct 17 ms 13404 KB Output is correct
61 Correct 15 ms 14172 KB Output is correct
62 Correct 95 ms 15096 KB Output is correct
63 Correct 80 ms 15096 KB Output is correct
64 Correct 122 ms 15096 KB Output is correct
65 Correct 111 ms 14940 KB Output is correct
66 Correct 107 ms 15108 KB Output is correct
67 Incorrect 79 ms 14940 KB Output isn't correct
68 Correct 42 ms 15132 KB Output is correct
69 Correct 38 ms 14940 KB Output is correct
70 Correct 35 ms 14928 KB Output is correct
71 Correct 34 ms 15132 KB Output is correct
72 Correct 27 ms 14932 KB Output is correct
73 Correct 38 ms 15356 KB Output is correct
74 Correct 39 ms 15192 KB Output is correct
75 Correct 46 ms 15188 KB Output is correct
76 Correct 42 ms 15196 KB Output is correct
77 Correct 46 ms 15192 KB Output is correct
78 Incorrect 43 ms 15192 KB Output isn't correct
79 Correct 37 ms 15196 KB Output is correct
80 Correct 41 ms 15332 KB Output is correct
81 Correct 50 ms 15144 KB Output is correct
82 Correct 34 ms 15188 KB Output is correct
83 Correct 49 ms 15192 KB Output is correct
84 Correct 51 ms 15188 KB Output is correct
85 Correct 54 ms 15296 KB Output is correct
86 Correct 53 ms 15244 KB Output is correct
87 Correct 45 ms 15136 KB Output is correct
88 Correct 49 ms 15196 KB Output is correct
89 Correct 56 ms 15248 KB Output is correct
90 Correct 53 ms 15240 KB Output is correct
91 Correct 50 ms 15196 KB Output is correct
92 Correct 53 ms 15196 KB Output is correct