답안 #897770

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
897770	2024-01-03T16:18:39 Z	ivaziva	Mecho (IOI09_mecho)	C++14	73 / 100	123 ms	12120 KB

mecho

#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][d]!=LLONG_MAX and dist2[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:129:23: warning: 'd' may be used uninitialized in this function [-Wmaybe-uninitialized]
  129 |         if (dist2[c][d]!=LLONG_MAX and dist2[c][d]!=-1)
      |             ~~~~~~~~~~^
mecho.cpp:129:23: warning: 'c' may be used uninitialized in this function [-Wmaybe-uninitialized]
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

73.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4444 KB	Output is correct
2	Incorrect	1 ms	4444 KB	Output isn't correct
3	Correct	1 ms	4440 KB	Output is correct
4	Incorrect	1 ms	4444 KB	Output isn't correct
5	Correct	1 ms	4444 KB	Output is correct
6	Incorrect	1 ms	4444 KB	Output isn't correct
7	Incorrect	52 ms	11356 KB	Output isn't correct
8	Correct	1 ms	4444 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	2 ms	6744 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	4556 KB	Output is correct
18	Correct	1 ms	4444 KB	Output is correct
19	Correct	1 ms	6748 KB	Output is correct
20	Correct	1 ms	6748 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	6748 KB	Output is correct
24	Correct	1 ms	6748 KB	Output is correct
25	Correct	1 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	6748 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	6744 KB	Output is correct
33	Correct	5 ms	8780 KB	Output is correct
34	Correct	4 ms	8796 KB	Output is correct
35	Correct	13 ms	8796 KB	Output is correct
36	Correct	6 ms	10844 KB	Output is correct
37	Correct	6 ms	10844 KB	Output is correct
38	Correct	17 ms	11068 KB	Output is correct
39	Correct	7 ms	10840 KB	Output is correct
40	Correct	7 ms	11100 KB	Output is correct
41	Correct	23 ms	11100 KB	Output is correct
42	Correct	8 ms	11100 KB	Output is correct
43	Correct	8 ms	11100 KB	Output is correct
44	Correct	35 ms	11128 KB	Output is correct
45	Correct	11 ms	11096 KB	Output is correct
46	Correct	11 ms	11100 KB	Output is correct
47	Correct	32 ms	11100 KB	Output is correct
48	Correct	12 ms	11212 KB	Output is correct
49	Correct	11 ms	11060 KB	Output is correct
50	Correct	37 ms	11100 KB	Output is correct
51	Correct	13 ms	11100 KB	Output is correct
52	Correct	13 ms	11100 KB	Output is correct
53	Correct	58 ms	11100 KB	Output is correct
54	Correct	18 ms	11228 KB	Output is correct
55	Correct	15 ms	11292 KB	Output is correct
56	Correct	53 ms	11604 KB	Output is correct
57	Correct	17 ms	11096 KB	Output is correct
58	Correct	17 ms	11100 KB	Output is correct
59	Correct	69 ms	11224 KB	Output is correct
60	Correct	22 ms	11184 KB	Output is correct
61	Correct	20 ms	11356 KB	Output is correct
62	Correct	90 ms	11368 KB	Output is correct
63	Correct	68 ms	11356 KB	Output is correct
64	Correct	123 ms	11356 KB	Output is correct
65	Correct	98 ms	11356 KB	Output is correct
66	Correct	77 ms	11356 KB	Output is correct
67	Correct	78 ms	11352 KB	Output is correct
68	Correct	34 ms	11256 KB	Output is correct
69	Correct	36 ms	11356 KB	Output is correct
70	Correct	33 ms	11604 KB	Output is correct
71	Correct	31 ms	11352 KB	Output is correct
72	Incorrect	24 ms	11356 KB	Output isn't correct
73	Incorrect	27 ms	11932 KB	Output isn't correct
74	Correct	36 ms	11724 KB	Output is correct
75	Correct	42 ms	11868 KB	Output is correct
76	Correct	37 ms	11864 KB	Output is correct
77	Correct	45 ms	11856 KB	Output is correct
78	Correct	46 ms	12120 KB	Output is correct
79	Correct	32 ms	12120 KB	Output is correct
80	Correct	37 ms	11868 KB	Output is correct
81	Correct	42 ms	11696 KB	Output is correct
82	Correct	39 ms	11868 KB	Output is correct
83	Correct	48 ms	11612 KB	Output is correct
84	Correct	42 ms	11612 KB	Output is correct
85	Correct	50 ms	11708 KB	Output is correct
86	Correct	46 ms	11704 KB	Output is correct
87	Correct	44 ms	11608 KB	Output is correct
88	Correct	49 ms	11608 KB	Output is correct
89	Correct	47 ms	11504 KB	Output is correct
90	Correct	48 ms	11672 KB	Output is correct
91	Correct	50 ms	11672 KB	Output is correct
92	Correct	53 ms	11608 KB	Output is correct