oj.uz

Submission #897792

# Submission time Handle Problem Language Result Execution time Memory
897792 2024-01-03T17:01:00 Z ivaziva Mecho (IOI09_mecho) C++17
84 / 100
 125 ms 12124 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
#define MAXN 810
 
long long n;
long long s;
char matrica[MAXN][MAXN];
long long dist1[MAXN][MAXN];///bee bfs
long long dist2[MAXN][MAXN];///mecho bfs
queue<pair<long long,long long>> bfsq1;
queue<pair<long long,long long>> bfsq2;
 
bool check(long long x,long long y)
{
    if (x>=1 and x<=n and y>=1 and y<=n and matrica[x][y]!='T') return true;
    else return false;
}
 
void bfs1()
{
    while (bfsq1.empty()==false)
    {
        long long x=bfsq1.front().first;
        long long y=bfsq1.front().second;
        bfsq1.pop();
        if (check(x+1,y) and dist1[x+1][y]==LLONG_MAX)
        {
            dist1[x+1][y]=dist1[x][y]+1;
            bfsq1.push({x+1,y});
        }
        if (check(x-1,y) and dist1[x-1][y]==LLONG_MAX)
        {
            dist1[x-1][y]=dist1[x][y]+1;
            bfsq1.push({x-1,y});
        }
        if (check(x,y+1) and dist1[x][y+1]==LLONG_MAX)
        {
            dist1[x][y+1]=dist1[x][y]+1;
            bfsq1.push({x,y+1});
        }
        if (check(x,y-1) and dist1[x][y-1]==LLONG_MAX)
        {
            dist1[x][y-1]=dist1[x][y]+1;
            bfsq1.push({x,y-1});
        }
    }
}
 
void bfs2(long long a,long long b,long long mid)
{
    for (long long i=1;i<=n;i++)
    {
        for (long long j=1;j<=n;j++) dist2[i][j]=LLONG_MAX;
    }
    dist2[a][b]=mid*s; bfsq2.push({a,b});
    while (bfsq2.empty()==false)
    {
        long long x=bfsq2.front().first;
        long long y=bfsq2.front().second;
        bfsq2.pop();
        if (check(x+1,y) and dist2[x+1][y]==LLONG_MAX)
        {
            long long d=dist2[x][y]+1;
            if (d<dist1[x+1][y]*s) dist2[x+1][y]=d;
            else dist2[x+1][y]=-1;
            if (dist2[x+1][y]!=-1) bfsq2.push({x+1,y});
        }
        if (check(x-1,y) and dist2[x-1][y]==LLONG_MAX)
        {
            long long d=dist2[x][y]+1;
            if (d<dist1[x-1][y]*s) dist2[x-1][y]=d;
            else dist2[x-1][y]=-1;
            if (dist2[x-1][y]!=-1) bfsq2.push({x-1,y});
        }
        if (check(x,y+1) and dist2[x][y+1]==LLONG_MAX)
        {
            long long d=dist2[x][y]+1;
            if (d<dist1[x][y+1]*s) dist2[x][y+1]=d;
            else dist2[x][y+1]=-1;
            if (dist2[x][y+1]!=-1) bfsq2.push({x,y+1});
        }
        if (check(x,y-1) and dist2[x][y-1]==LLONG_MAX)
        {
            long long d=dist2[x][y]+1;
            if (d<dist1[x][y-1]*s) dist2[x][y-1]=d;
            else dist2[x][y-1]=-1;
            if (dist2[x][y-1]!=-1) bfsq2.push({x,y-1});
        }
    }
}
 
int main()
{
    ios_base::sync_with_stdio(false);
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>s;
    for (long long i=1;i<=n;i++)
    {
        for (long long j=1;j<=n;j++) dist1[i][j]=LLONG_MAX;
    }
    long long a,b;
    long long c,d;
    for (long long i=1;i<=n;i++)
    {
        for (long long j=1;j<=n;j++)
        {
            cin>>matrica[i][j];
            if (matrica[i][j]=='H')
            {
                dist1[i][j]=0;
                bfsq1.push({i,j});
            }
            if (matrica[i][j]=='M') {a=i;b=j;}
            if (matrica[i][j]=='D') {c=i;d=j;}
        }
    }
    bfs1();
    long long l=0;
    long long r=n*n;
    long long rez=-1;
    while (l<=r)
    {
        long long mid=(l+r)/2;
        bfs2(a,b,mid);
        if (dist2[c-1][d]!=LLONG_MAX and dist2[c-1][d]!=-1 and check(c-1,d)) {rez=mid;l=mid+1;}
        else if (dist2[c+1][d]!=LLONG_MAX and dist2[c+1][d]!=-1 and check(c+1,d)) {rez=mid;l=mid+1;}
        else if (dist2[c][d-1]!=LLONG_MAX and dist2[c][d-1]!=-1 and check(c,d-1)) {rez=mid;l=mid+1;}
        else if (dist2[c][d+1]!=LLONG_MAX and dist2[c][d+1]!=-1 and check(c,d+1)) {rez=mid;l=mid+1;}
        else r=mid-1;
    }
    cout<<rez<<endl;
}

Compilation message

mecho.cpp: In function 'int main()':
mecho.cpp:106:17: warning: 'd' may be used uninitialized in this function [-Wmaybe-uninitialized]
  106 |     long long c,d;
      |                 ^
mecho.cpp:106:15: warning: 'c' may be used uninitialized in this function [-Wmaybe-uninitialized]
  106 |     long long c,d;
      |               ^
mecho.cpp:128:13: warning: 'b' may be used uninitialized in this function [-Wmaybe-uninitialized]
  128 |         bfs2(a,b,mid);
      |         ~~~~^~~~~~~~~
mecho.cpp:128:13: warning: 'a' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
84.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 1 ms 4440 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 54 ms 11352 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Incorrect 1 ms 6748 KB Output isn't correct
13 Incorrect 1 ms 6748 KB Output isn't correct
14 Correct 1 ms 6748 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6492 KB Output is correct
23 Correct 1 ms 6492 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct
25 Correct 2 ms 6744 KB Output is correct
26 Correct 1 ms 6748 KB Output is correct
27 Correct 1 ms 6748 KB Output is correct
28 Correct 1 ms 6492 KB Output is correct
29 Correct 1 ms 6748 KB Output is correct
30 Correct 1 ms 6748 KB Output is correct
31 Correct 1 ms 6748 KB Output is correct
32 Correct 1 ms 6748 KB Output is correct
33 Correct 5 ms 8968 KB Output is correct
34 Correct 5 ms 8796 KB Output is correct
35 Correct 14 ms 8796 KB Output is correct
36 Correct 7 ms 10840 KB Output is correct
37 Correct 6 ms 10844 KB Output is correct
38 Correct 17 ms 11064 KB Output is correct
39 Correct 7 ms 10840 KB Output is correct
40 Correct 7 ms 10840 KB Output is correct
41 Correct 24 ms 11112 KB Output is correct
42 Correct 11 ms 11100 KB Output is correct
43 Correct 8 ms 11348 KB Output is correct
44 Correct 28 ms 11152 KB Output is correct
45 Correct 10 ms 10996 KB Output is correct
46 Correct 9 ms 11096 KB Output is correct
47 Correct 33 ms 11112 KB Output is correct
48 Correct 11 ms 11100 KB Output is correct
49 Correct 12 ms 11100 KB Output is correct
50 Correct 37 ms 11100 KB Output is correct
51 Correct 13 ms 11124 KB Output is correct
52 Correct 13 ms 11252 KB Output is correct
53 Correct 47 ms 11096 KB Output is correct
54 Correct 15 ms 11100 KB Output is correct
55 Correct 14 ms 11184 KB Output is correct
56 Correct 60 ms 11264 KB Output is correct
57 Correct 17 ms 11100 KB Output is correct
58 Correct 17 ms 11100 KB Output is correct
59 Correct 62 ms 11324 KB Output is correct
60 Correct 19 ms 11352 KB Output is correct
61 Correct 18 ms 11372 KB Output is correct
62 Correct 70 ms 11196 KB Output is correct
63 Correct 73 ms 11356 KB Output is correct
64 Correct 125 ms 11356 KB Output is correct
65 Correct 90 ms 11356 KB Output is correct
66 Correct 78 ms 11356 KB Output is correct
67 Correct 81 ms 11600 KB Output is correct
68 Correct 36 ms 11356 KB Output is correct
69 Correct 34 ms 11356 KB Output is correct
70 Correct 31 ms 11356 KB Output is correct
71 Correct 33 ms 11356 KB Output is correct
72 Incorrect 24 ms 11244 KB Output isn't correct
73 Incorrect 29 ms 11868 KB Output isn't correct
74 Correct 42 ms 12124 KB Output is correct
75 Correct 42 ms 11868 KB Output is correct
76 Correct 39 ms 11868 KB Output is correct
77 Correct 38 ms 11868 KB Output is correct
78 Correct 57 ms 11864 KB Output is correct
79 Correct 41 ms 11868 KB Output is correct
80 Correct 41 ms 11868 KB Output is correct
81 Correct 41 ms 11864 KB Output is correct
82 Correct 39 ms 11868 KB Output is correct
83 Correct 47 ms 11864 KB Output is correct
84 Correct 42 ms 11772 KB Output is correct
85 Correct 46 ms 11776 KB Output is correct
86 Correct 44 ms 11608 KB Output is correct
87 Correct 50 ms 11612 KB Output is correct
88 Correct 50 ms 11676 KB Output is correct
89 Correct 50 ms 11612 KB Output is correct
90 Correct 54 ms 11612 KB Output is correct
91 Correct 65 ms 11608 KB Output is correct
92 Correct 63 ms 11676 KB Output is correct