답안 #897566

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
897566	2024-01-03T12:27:11 Z	ivaziva	Mecho (IOI09_mecho)	C++14	28 / 100	51 ms	22356 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;
        if (x==c and y==d) break;
        if (x==a and y==b) {dek.pop_front();continue;}
        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:136:18: warning: 'd' may be used uninitialized in this function [-Wmaybe-uninitialized]
  136 |         if (x==c and y==d) break;
      |             ~~~~~^~~~~~~~
mecho.cpp:136:9: warning: 'c' may be used uninitialized in this function [-Wmaybe-uninitialized]
  136 |         if (x==c and y==d) break;
      |         ^~
mecho.cpp:137:23: warning: 'b' may be used uninitialized in this function [-Wmaybe-uninitialized]
  137 |         if (x==a and y==b) {dek.pop_front();continue;}
      |                      ~^~~
mecho.cpp:137:14: warning: 'a' may be used uninitialized in this function [-Wmaybe-uninitialized]
  137 |         if (x==a and y==b) {dek.pop_front();continue;}
      |             ~^~~

Subtask #1

28.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	6644 KB	Output is correct
2	Incorrect	1 ms	6492 KB	Output isn't correct
3	Correct	1 ms	6492 KB	Output is correct
4	Correct	1 ms	6492 KB	Output is correct
5	Correct	1 ms	6492 KB	Output is correct
6	Incorrect	1 ms	6588 KB	Output isn't correct
7	Incorrect	41 ms	21836 KB	Output isn't correct
8	Incorrect	1 ms	8540 KB	Output isn't correct
9	Correct	2 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	1 ms	10588 KB	Output isn't correct
15	Correct	1 ms	6492 KB	Output is correct
16	Correct	1 ms	8540 KB	Output is correct
17	Correct	1 ms	8540 KB	Output is correct
18	Correct	2 ms	8540 KB	Output is correct
19	Correct	2 ms	10588 KB	Output is correct
20	Correct	1 ms	10588 KB	Output is correct
21	Correct	1 ms	10588 KB	Output is correct
22	Correct	2 ms	10588 KB	Output is correct
23	Correct	1 ms	10692 KB	Output is correct
24	Correct	1 ms	10588 KB	Output is correct
25	Correct	1 ms	10584 KB	Output is correct
26	Correct	2 ms	10584 KB	Output is correct
27	Correct	2 ms	10588 KB	Output is correct
28	Correct	2 ms	10584 KB	Output is correct
29	Correct	2 ms	10588 KB	Output is correct
30	Correct	1 ms	10588 KB	Output is correct
31	Correct	1 ms	10588 KB	Output is correct
32	Correct	1 ms	10584 KB	Output is correct
33	Correct	7 ms	16988 KB	Output is correct
34	Correct	8 ms	19036 KB	Output is correct
35	Incorrect	10 ms	19036 KB	Output isn't correct
36	Correct	9 ms	16988 KB	Output is correct
37	Correct	9 ms	19036 KB	Output is correct
38	Incorrect	11 ms	19008 KB	Output isn't correct
39	Correct	11 ms	16984 KB	Output is correct
40	Correct	11 ms	19036 KB	Output is correct
41	Incorrect	13 ms	19012 KB	Output isn't correct
42	Correct	13 ms	16988 KB	Output is correct
43	Correct	13 ms	21340 KB	Output is correct
44	Incorrect	16 ms	21340 KB	Output isn't correct
45	Correct	17 ms	17240 KB	Output is correct
46	Correct	19 ms	21208 KB	Output is correct
47	Incorrect	20 ms	21312 KB	Output isn't correct
48	Correct	22 ms	17244 KB	Output is correct
49	Correct	18 ms	21336 KB	Output is correct
50	Incorrect	21 ms	21384 KB	Output isn't correct
51	Correct	20 ms	17244 KB	Output is correct
52	Correct	26 ms	21340 KB	Output is correct
53	Incorrect	29 ms	21340 KB	Output isn't correct
54	Correct	29 ms	19244 KB	Output is correct
55	Correct	24 ms	21368 KB	Output is correct
56	Incorrect	28 ms	21452 KB	Output isn't correct
57	Correct	27 ms	19336 KB	Output is correct
58	Correct	26 ms	21336 KB	Output is correct
59	Incorrect	32 ms	21392 KB	Output isn't correct
60	Correct	34 ms	19280 KB	Output is correct
61	Correct	38 ms	21404 KB	Output is correct
62	Incorrect	40 ms	21596 KB	Output isn't correct
63	Correct	48 ms	21844 KB	Output is correct
64	Correct	45 ms	21584 KB	Output is correct
65	Correct	46 ms	21588 KB	Output is correct
66	Correct	42 ms	21556 KB	Output is correct
67	Incorrect	39 ms	21332 KB	Output isn't correct
68	Correct	38 ms	21332 KB	Output is correct
69	Correct	38 ms	21588 KB	Output is correct
70	Correct	44 ms	21588 KB	Output is correct
71	Correct	38 ms	21340 KB	Output is correct
72	Incorrect	39 ms	21480 KB	Output isn't correct
73	Incorrect	37 ms	22108 KB	Output isn't correct
74	Correct	48 ms	22064 KB	Output is correct
75	Correct	38 ms	22096 KB	Output is correct
76	Correct	37 ms	22100 KB	Output is correct
77	Correct	43 ms	22356 KB	Output is correct
78	Incorrect	38 ms	17672 KB	Output isn't correct
79	Incorrect	44 ms	21840 KB	Output isn't correct
80	Incorrect	36 ms	17748 KB	Output isn't correct
81	Incorrect	35 ms	17748 KB	Output isn't correct
82	Incorrect	36 ms	17744 KB	Output isn't correct
83	Correct	37 ms	19796 KB	Output is correct
84	Incorrect	51 ms	21852 KB	Output isn't correct
85	Incorrect	38 ms	19792 KB	Output isn't correct
86	Incorrect	38 ms	19792 KB	Output isn't correct
87	Incorrect	39 ms	19792 KB	Output isn't correct
88	Correct	39 ms	19612 KB	Output is correct
89	Incorrect	49 ms	21904 KB	Output isn't correct
90	Incorrect	40 ms	21840 KB	Output isn't correct
91	Incorrect	46 ms	21844 KB	Output isn't correct
92	Incorrect	41 ms	20032 KB	Output isn't correct