답안 #897563

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
897563	2024-01-03T12:23:39 Z	ivaziva	Mecho (IOI09_mecho)	C++14	34 / 100	52 ms	22616 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
pair<long long,long long> parent[MAXN][MAXN];
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)
{
    dist2[a][b]=0; 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) parent[x+1][y]={x,y};
            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) parent[x-1][y]={x,y};
            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) parent[x][y+1]={x,y};
            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) parent[x][y-1]={x,y};
            if (dist2[x][y-1]!=-1) bfsq2.push({x,y-1});
        }
    }
}

int main()
{
    cin>>n>>s;
    for (long long i=1;i<=n;i++)
    {
        for (long long j=1;j<=n;j++)
        {
            dist1[i][j]=LLONG_MAX;
            dist2[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(); bfs2(a,b);
    deque<pair<long long,long long>> dek;
    pair<long long,long long> tren={c,d};
    dek.push_front(tren);
    while (parent[tren.first][tren.second].first!=0)
    {
        pair<long long,long long> par=parent[tren.first][tren.second];
        dek.push_front(par); tren=par;
    }
    long long ans=LLONG_MAX;
    while (dek.empty()==false)
    {
        long long x=dek.front().first;
        long long y=dek.front().second;
        long long val=dist2[x][y];
        long long z=val/s;
        long long br=dist1[x][y]-z-1;
        ans=min(ans,br);
        dek.pop_front();
    }
    cout<<ans<<endl;
}

Compilation message

mecho.cpp: In function 'int main()':
mecho.cpp:122:17: warning: 'b' may be used uninitialized in this function [-Wmaybe-uninitialized]
  122 |     bfs1(); bfs2(a,b);
      |             ~~~~^~~~~
mecho.cpp:122:17: warning: 'a' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1

34.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	6492 KB	Output is correct
2	Incorrect	1 ms	6592 KB	Output isn't correct
3	Correct	1 ms	6492 KB	Output is correct
4	Incorrect	1 ms	6492 KB	Output isn't correct
5	Correct	1 ms	6492 KB	Output is correct
6	Incorrect	1 ms	6492 KB	Output isn't correct
7	Incorrect	43 ms	22308 KB	Output isn't correct
8	Incorrect	1 ms	8540 KB	Output isn't correct
9	Correct	1 ms	8540 KB	Output is correct
10	Correct	1 ms	8540 KB	Output is correct
11	Correct	1 ms	8540 KB	Output is correct
12	Incorrect	1 ms	10588 KB	Output isn't correct
13	Correct	1 ms	10588 KB	Output is correct
14	Incorrect	2 ms	10588 KB	Output isn't correct
15	Correct	1 ms	6488 KB	Output is correct
16	Correct	1 ms	8540 KB	Output is correct
17	Correct	1 ms	8540 KB	Output is correct
18	Correct	1 ms	8540 KB	Output is correct
19	Correct	1 ms	10588 KB	Output is correct
20	Correct	1 ms	10588 KB	Output is correct
21	Correct	1 ms	10688 KB	Output is correct
22	Correct	1 ms	10588 KB	Output is correct
23	Correct	1 ms	10684 KB	Output is correct
24	Correct	1 ms	10588 KB	Output is correct
25	Correct	2 ms	10588 KB	Output is correct
26	Correct	1 ms	10588 KB	Output is correct
27	Correct	2 ms	10840 KB	Output is correct
28	Correct	2 ms	10692 KB	Output is correct
29	Correct	2 ms	10588 KB	Output is correct
30	Correct	2 ms	10688 KB	Output is correct
31	Correct	2 ms	10588 KB	Output is correct
32	Correct	2 ms	10588 KB	Output is correct
33	Correct	7 ms	16988 KB	Output is correct
34	Correct	8 ms	19036 KB	Output is correct
35	Incorrect	9 ms	19036 KB	Output isn't correct
36	Correct	10 ms	17244 KB	Output is correct
37	Correct	10 ms	19292 KB	Output is correct
38	Incorrect	12 ms	19268 KB	Output isn't correct
39	Correct	11 ms	17244 KB	Output is correct
40	Correct	11 ms	19292 KB	Output is correct
41	Incorrect	14 ms	19460 KB	Output isn't correct
42	Correct	13 ms	17468 KB	Output is correct
43	Correct	13 ms	21336 KB	Output is correct
44	Incorrect	16 ms	21596 KB	Output isn't correct
45	Correct	16 ms	17652 KB	Output is correct
46	Correct	16 ms	21596 KB	Output is correct
47	Incorrect	19 ms	21596 KB	Output isn't correct
48	Correct	18 ms	17500 KB	Output is correct
49	Correct	18 ms	21592 KB	Output is correct
50	Incorrect	24 ms	21584 KB	Output isn't correct
51	Correct	21 ms	18008 KB	Output is correct
52	Correct	21 ms	21840 KB	Output is correct
53	Incorrect	30 ms	21872 KB	Output isn't correct
54	Correct	27 ms	19804 KB	Output is correct
55	Correct	24 ms	21852 KB	Output is correct
56	Incorrect	30 ms	21972 KB	Output isn't correct
57	Correct	28 ms	19800 KB	Output is correct
58	Correct	27 ms	21932 KB	Output is correct
59	Incorrect	33 ms	22080 KB	Output isn't correct
60	Correct	31 ms	20116 KB	Output is correct
61	Correct	31 ms	22108 KB	Output is correct
62	Incorrect	47 ms	22072 KB	Output isn't correct
63	Correct	46 ms	21956 KB	Output is correct
64	Correct	48 ms	22224 KB	Output is correct
65	Correct	45 ms	22100 KB	Output is correct
66	Correct	44 ms	22100 KB	Output is correct
67	Incorrect	40 ms	22096 KB	Output isn't correct
68	Correct	41 ms	22060 KB	Output is correct
69	Correct	39 ms	22108 KB	Output is correct
70	Correct	38 ms	22124 KB	Output is correct
71	Correct	39 ms	22096 KB	Output is correct
72	Correct	40 ms	22212 KB	Output is correct
73	Correct	38 ms	22612 KB	Output is correct
74	Correct	47 ms	22568 KB	Output is correct
75	Correct	38 ms	22608 KB	Output is correct
76	Correct	36 ms	22608 KB	Output is correct
77	Correct	39 ms	22608 KB	Output is correct
78	Incorrect	38 ms	18252 KB	Output isn't correct
79	Incorrect	45 ms	22616 KB	Output isn't correct
80	Incorrect	37 ms	18232 KB	Output isn't correct
81	Incorrect	37 ms	18268 KB	Output isn't correct
82	Incorrect	37 ms	18256 KB	Output isn't correct
83	Correct	38 ms	20580 KB	Output is correct
84	Incorrect	49 ms	22612 KB	Output isn't correct
85	Incorrect	38 ms	20560 KB	Output isn't correct
86	Incorrect	42 ms	20428 KB	Output isn't correct
87	Incorrect	40 ms	20472 KB	Output isn't correct
88	Correct	38 ms	20308 KB	Output is correct
89	Incorrect	52 ms	22352 KB	Output isn't correct
90	Incorrect	43 ms	22356 KB	Output isn't correct
91	Incorrect	48 ms	22356 KB	Output isn't correct
92	Incorrect	45 ms	20564 KB	Output isn't correct