oj.uz

Submission #960507

# Submission time Handle Problem Language Result Execution time Memory
960507 2024-04-10T14:40:08 Z LmaoLmao Mecho (IOI09_mecho) C++14
73 / 100
 110 ms 8144 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;
    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.0+1)/(s*1.0) && 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;
}

Subtask #1
73.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Correct 0 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 2 ms 2396 KB Output isn't correct
7 Incorrect 56 ms 7972 KB Output isn't correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Incorrect 1 ms 2652 KB Output isn't correct
13 Incorrect 1 ms 2652 KB Output isn't 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 2652 KB Output is correct
22 Correct 1 ms 2648 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 5980 KB Output is correct
34 Correct 5 ms 5980 KB Output is correct
35 Correct 13 ms 5980 KB Output is correct
36 Correct 6 ms 6236 KB Output is correct
37 Correct 5 ms 6268 KB Output is correct
38 Correct 17 ms 6312 KB Output is correct
39 Correct 6 ms 6492 KB Output is correct
40 Correct 6 ms 6400 KB Output is correct
41 Correct 26 ms 6492 KB Output is correct
42 Correct 7 ms 6700 KB Output is correct
43 Correct 7 ms 6492 KB Output is correct
44 Correct 34 ms 6716 KB Output is correct
45 Correct 7 ms 6832 KB Output is correct
46 Correct 7 ms 6744 KB Output is correct
47 Correct 37 ms 6748 KB Output is correct
48 Correct 9 ms 7004 KB Output is correct
49 Correct 9 ms 7004 KB Output is correct
50 Correct 40 ms 7104 KB Output is correct
51 Correct 11 ms 7260 KB Output is correct
52 Correct 11 ms 7260 KB Output is correct
53 Correct 58 ms 7260 KB Output is correct
54 Correct 13 ms 7256 KB Output is correct
55 Correct 13 ms 7260 KB Output is correct
56 Correct 61 ms 7468 KB Output is correct
57 Correct 13 ms 7516 KB Output is correct
58 Correct 12 ms 7516 KB Output is correct
59 Correct 61 ms 7664 KB Output is correct
60 Correct 14 ms 7772 KB Output is correct
61 Correct 16 ms 7772 KB Output is correct
62 Correct 80 ms 7692 KB Output is correct
63 Correct 75 ms 7772 KB Output is correct
64 Correct 110 ms 7868 KB Output is correct
65 Correct 109 ms 7760 KB Output is correct
66 Correct 89 ms 7860 KB Output is correct
67 Correct 73 ms 7804 KB Output is correct
68 Correct 35 ms 7768 KB Output is correct
69 Correct 34 ms 7772 KB Output is correct
70 Correct 30 ms 7768 KB Output is correct
71 Correct 26 ms 7764 KB Output is correct
72 Incorrect 24 ms 7640 KB Output isn't correct
73 Incorrect 23 ms 8024 KB Output isn't correct
74 Correct 44 ms 8144 KB Output is correct
75 Correct 46 ms 8072 KB Output is correct
76 Correct 40 ms 8028 KB Output is correct
77 Correct 43 ms 8136 KB Output is correct
78 Correct 45 ms 8100 KB Output is correct
79 Correct 35 ms 8024 KB Output is correct
80 Correct 41 ms 8028 KB Output is correct
81 Correct 43 ms 8100 KB Output is correct
82 Correct 35 ms 7924 KB Output is correct
83 Correct 54 ms 8024 KB Output is correct
84 Correct 43 ms 8028 KB Output is correct
85 Correct 45 ms 8028 KB Output is correct
86 Correct 45 ms 8024 KB Output is correct
87 Correct 44 ms 8028 KB Output is correct
88 Correct 47 ms 8028 KB Output is correct
89 Correct 50 ms 8024 KB Output is correct
90 Correct 51 ms 8024 KB Output is correct
91 Correct 48 ms 8028 KB Output is correct
92 Correct 48 ms 8024 KB Output is correct