oj.uz

Submission #869026

# Submission time Handle Problem Language Result Execution time Memory
869026 2023-11-03T02:20:12 Z HuyQuang_re_Zero Mecho (IOI09_mecho) C++14
100 / 100
 153 ms 7512 KB 
#include <bits/stdc++.h>
#define ll long long
#define db long double
#define N 805
#define II pair <ll,ll>
#define III pair <ll,II>
#define IV pair <vector <int>,vector <int> >
#define fst first
#define snd second
#define BIT(x,i) ((x>>i)&1)
#define Log(x) (31-__builtin_clz((int)x))
#define LogLL(x) (63-__builtin_clzll((ll)x))
#define pi acos(-1)
#define to_radian(x) (x*pi/180.0)
#define to_degree(x) (x*180.0/pi)
using namespace std;
queue <II> q;
int n,i,j,x,y,bee[N][N],bear[N][N],s,X,Y;
char a[N][N];
void bee_consider(int x,int y,int k)
{
    if(bee[x][y]>k && (a[x][y]=='H' || a[x][y]=='M' || a[x][y]=='G'))
    {
        q.push({ x,y });
        bee[x][y]=k;
    }
}
void bear_consider(int x,int y,int k)
{
    if(bear[x][y]>k && (a[x][y]=='M' || a[x][y]=='D' || a[x][y]=='G'))
    {
        if(k/s>=bee[x][y]) return ;
        q.push({ x,y });
        bear[x][y]=k;
    }
}
bool check(int k)
{
    memset(bear,63,sizeof(bear));
    while(q.size()>0) q.pop();
    bear_consider(X,Y,k*s);
    while(q.size()>0)
    {
        int x=q.front().fst,y=q.front().snd,k=bear[x][y]; q.pop();
        if(a[x][y]=='D') return 1;
        bear_consider(x-1,y,k+1);
        bear_consider(x+1,y,k+1);
        bear_consider(x,y-1,k+1);
        bear_consider(x,y+1,k+1);
    }
    return 0;
}
int main()
{
  //  freopen("mecho.inp","r",stdin);
    //freopen("mecho.out","w",stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin>>n>>s;
    memset(bee,63,sizeof(bee));
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
        {
            cin>>a[i][j];
            if(a[i][j]=='H') bee_consider(i,j,0);
            if(a[i][j]=='M') X=i,Y=j;
        }
    while(q.size()>0)
    {
        int x=q.front().fst,y=q.front().snd; q.pop();
        bee_consider(x-1,y,bee[x][y]+1);
        bee_consider(x+1,y,bee[x][y]+1);
        bee_consider(x,y-1,bee[x][y]+1);
        bee_consider(x,y+1,bee[x][y]+1);
    }
    int l=0,r=n*n+1;
    while(l<r)
    {
        int mid=(l+r+1)>>1;
        if(check(mid)) l=mid; else r=mid-1;
    }
    if(check(l)) cout<<l; else cout<<-1;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5980 KB Output is correct
2 Correct 1 ms 5840 KB Output is correct
3 Correct 2 ms 5988 KB Output is correct
4 Correct 2 ms 5980 KB Output is correct
5 Correct 1 ms 5980 KB Output is correct
6 Correct 2 ms 5980 KB Output is correct
7 Correct 69 ms 6884 KB Output is correct
8 Correct 2 ms 5980 KB Output is correct
9 Correct 2 ms 5836 KB Output is correct
10 Correct 2 ms 5980 KB Output is correct
11 Correct 2 ms 5980 KB Output is correct
12 Correct 2 ms 5980 KB Output is correct
13 Correct 2 ms 5980 KB Output is correct
14 Correct 2 ms 5980 KB Output is correct
15 Correct 2 ms 5980 KB Output is correct
16 Correct 2 ms 5980 KB Output is correct
17 Correct 2 ms 5980 KB Output is correct
18 Correct 2 ms 5976 KB Output is correct
19 Correct 3 ms 5976 KB Output is correct
20 Correct 2 ms 5976 KB Output is correct
21 Correct 2 ms 5980 KB Output is correct
22 Correct 2 ms 5980 KB Output is correct
23 Correct 2 ms 5808 KB Output is correct
24 Correct 2 ms 5980 KB Output is correct
25 Correct 2 ms 6232 KB Output is correct
26 Correct 2 ms 5976 KB Output is correct
27 Correct 2 ms 6048 KB Output is correct
28 Correct 2 ms 5980 KB Output is correct
29 Correct 2 ms 5980 KB Output is correct
30 Correct 2 ms 5856 KB Output is correct
31 Correct 2 ms 5860 KB Output is correct
32 Correct 2 ms 5980 KB Output is correct
33 Correct 5 ms 6236 KB Output is correct
34 Correct 5 ms 6108 KB Output is correct
35 Correct 17 ms 6236 KB Output is correct
36 Correct 7 ms 6492 KB Output is correct
37 Correct 5 ms 6236 KB Output is correct
38 Correct 23 ms 6236 KB Output is correct
39 Correct 7 ms 6232 KB Output is correct
40 Correct 6 ms 6236 KB Output is correct
41 Correct 35 ms 6364 KB Output is correct
42 Correct 7 ms 6232 KB Output is correct
43 Correct 7 ms 6232 KB Output is correct
44 Correct 36 ms 6236 KB Output is correct
45 Correct 8 ms 6380 KB Output is correct
46 Correct 8 ms 6388 KB Output is correct
47 Correct 42 ms 6236 KB Output is correct
48 Correct 9 ms 6492 KB Output is correct
49 Correct 9 ms 6488 KB Output is correct
50 Correct 50 ms 6492 KB Output is correct
51 Correct 11 ms 6492 KB Output is correct
52 Correct 10 ms 6488 KB Output is correct
53 Correct 60 ms 6576 KB Output is correct
54 Correct 12 ms 6492 KB Output is correct
55 Correct 12 ms 6648 KB Output is correct
56 Correct 80 ms 6740 KB Output is correct
57 Correct 13 ms 6488 KB Output is correct
58 Correct 13 ms 6492 KB Output is correct
59 Correct 86 ms 6744 KB Output is correct
60 Correct 15 ms 6748 KB Output is correct
61 Correct 15 ms 6748 KB Output is correct
62 Correct 94 ms 6748 KB Output is correct
63 Correct 88 ms 6992 KB Output is correct
64 Correct 153 ms 6748 KB Output is correct
65 Correct 118 ms 6748 KB Output is correct
66 Correct 102 ms 6792 KB Output is correct
67 Correct 99 ms 6776 KB Output is correct
68 Correct 40 ms 6748 KB Output is correct
69 Correct 38 ms 6748 KB Output is correct
70 Correct 36 ms 6748 KB Output is correct
71 Correct 33 ms 6748 KB Output is correct
72 Correct 25 ms 6748 KB Output is correct
73 Correct 31 ms 7260 KB Output is correct
74 Correct 46 ms 7260 KB Output is correct
75 Correct 56 ms 7256 KB Output is correct
76 Correct 53 ms 7260 KB Output is correct
77 Correct 56 ms 7332 KB Output is correct
78 Correct 61 ms 7292 KB Output is correct
79 Correct 40 ms 7512 KB Output is correct
80 Correct 50 ms 7264 KB Output is correct
81 Correct 55 ms 7260 KB Output is correct
82 Correct 48 ms 7256 KB Output is correct
83 Correct 62 ms 7052 KB Output is correct
84 Correct 59 ms 7000 KB Output is correct
85 Correct 65 ms 7256 KB Output is correct
86 Correct 64 ms 7204 KB Output is correct
87 Correct 62 ms 7200 KB Output is correct
88 Correct 63 ms 7100 KB Output is correct
89 Correct 69 ms 7004 KB Output is correct
90 Correct 71 ms 7004 KB Output is correct
91 Correct 64 ms 7000 KB Output is correct
92 Correct 73 ms 7004 KB Output is correct