답안 #554990

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
554990	2022-04-29T19:35:02 Z	savackexp	Mecho (IOI09_mecho)	C++14	84 / 100	330 ms	16760 KB

mecho

#include<bits/stdc++.h>
using namespace std;
#define in insert
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define Endl "\n"
#define ENDL "\n"
#define fi first
#define se second
#define be  begin()
#define en  end()
#define pb push_back
typedef long long ll;
typedef long double ld;
const int MOD=1e9+7;
const int MAX=2e5+1;/*
ll  binpow(ll  a, ll  b) {
    ld  res = 1;
    while (b > 0) {
        if (b & 1)
            res = res * a;
        a = a * a;
        b >>= 1;
    }

    return res;
}
unsigned long long power(unsigned long long x,
                                ll y, ll p)
{
    unsigned long long res = 1; // Initialize result

    x = x % p; // Update x if it is more than or
    // equal to p

    while (y > 0)
    {

        // If y is odd, multiply x with result
        if (y & 1)
            res = (res * x) % p;

        // y must be even now
        y = y >> 1; // y = y/2
        x = (x * x) % p;
    }
    return res;
}

unsigned long long modInverse(unsigned long long n,
                                            ll p)
{
    return power(n, p - 2, p);
}
*/
ll n  , k ;
ll dx[]={0 , 0 , 1, -1};
ll dy[]={1 , -1 , 0, 0};
char grid[805][805];
ll vis[805][805];
ll levelm[805][805];
ll levelh[805][805];
vector<pair<ll,ll>>hive;
bool valid(ll x , ll y)
{
    return x>=0 && y>=0 && x<n && y<n && grid[x][y]!='H' && grid[x][y]!='T';
}
bool valid1(ll x , ll y)
{
    return x>=0 && y>=0 && x<n && y<n  && grid[x][y]!='T' && grid[x][y]!='D';
}
pair<ll,ll>m , d;
bool check(ll u)
{
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<n;j++)
            {
                levelm[i][j]=1e18;
            }
        }
        memset(vis , 0 ,sizeof vis );
        queue< pair<ll,ll> >q;
        q.push({m.fi,m.se});
        vis[m.fi][m.se]=1;
        levelm[m.fi][m.se]=0;
        while(!q.empty())
        {
            pair<ll,ll>p=q.front();
            q.pop();
            for(int i=0;i<4;i++)
            {
                ll nx = p.fi +  dx[i];
                ll ny = p.se +  dy[i];
                if(!valid(nx,ny))continue;
                levelm[nx][ny]=min(levelm[p.fi][p.se]+1 ,levelm[nx][ny]);
                ll qe = (levelm[nx][ny])/k;
                if(levelh[nx][ny] <= qe + u )continue;
                if(vis[nx][ny])continue;

                vis[nx][ny] = 1;
                q.push({nx , ny});

            }

        }

    if(levelm[d.fi][d.se] != 1e18)
    {
        return true;
    }
    return false;
}

void bfs(vector<pair<ll,ll>>h)
{
    queue<pair<ll,ll> >q;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)
        {
            levelh[i][j]=1e18;
        }
    }
    for(int i=0;i<h.size();i++)
    {
        levelh[h[i].fi][h[i].se]=0;
        vis[h[i].fi][h[i].se]=1;
        q.push(h[i]);
    }
    while(!q.empty())
    {
        pair<ll,ll>p=q.front();
        q.pop();
        for(int i=0;i<4;i++)
        {

            ll nx = p.fi + dx[i];
            ll ny = p.se + dy[i];
            if(!valid1(nx,ny))continue;
            levelh[nx][ny] = min(levelh[p.fi][p.se]+1 ,levelh[nx][ny]);
            if(vis[nx][ny])continue;
            vis[nx][ny] = 1;
            q.push({nx , ny});
        }

    }
}





int main()
{

        fastio

        //freopen("gravity.in","r",stdin);
        //freopen("gravity.out","w",stdout);

        cin>>n>>k;
        for(int i=0;i<n;i++)
        {
            string s;
            cin>>s;
            for(int j=0;j<s.size();j++)
            {
                grid[i][j]=s[j];
                if(s[j]=='H')hive.pb({i,j});
                else if(s[j]=='M')m={i,j};
                else if(s[j]=='D')d={i,j};
            }
        }
        bfs(hive);
        memset(vis , 0 ,sizeof vis);
        ll l=0;
        ll r=1e18;
        ll ans=-1;
        while(l<=r)
        {
            ll mid=(l+r)/2;
            if(check(mid))
            {
                ans=mid;
                l=mid+1;
            }
            else r=mid-1;
        }
        cout<<ans<<endl;






































    return 0;
    }
/*
5 6
0 4 0
0 3 1
0 1 1
0 2 1
1 2 1
3 4 0

*/

Compilation message

mecho.cpp: In function 'void bfs(std::vector<std::pair<long long int, long long int> >)':
mecho.cpp:125:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  125 |     for(int i=0;i<h.size();i++)
      |                 ~^~~~~~~~~
mecho.cpp: In function 'int main()':
mecho.cpp:167:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  167 |             for(int j=0;j<s.size();j++)
      |                         ~^~~~~~~~~

Subtask #1

84.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	17 ms	5332 KB	Output is correct
2	Correct	10 ms	5332 KB	Output is correct
3	Correct	12 ms	5444 KB	Output is correct
4	Correct	12 ms	5332 KB	Output is correct
5	Correct	11 ms	5468 KB	Output is correct
6	Correct	14 ms	5496 KB	Output is correct
7	Correct	261 ms	16580 KB	Output is correct
8	Correct	12 ms	5588 KB	Output is correct
9	Correct	15 ms	5540 KB	Output is correct
10	Correct	12 ms	5460 KB	Output is correct
11	Correct	12 ms	5544 KB	Output is correct
12	Incorrect	13 ms	5872 KB	Output isn't correct
13	Incorrect	12 ms	5912 KB	Output isn't correct
14	Correct	12 ms	5972 KB	Output is correct
15	Correct	15 ms	5588 KB	Output is correct
16	Correct	18 ms	5588 KB	Output is correct
17	Correct	14 ms	5588 KB	Output is correct
18	Correct	18 ms	5588 KB	Output is correct
19	Correct	13 ms	5588 KB	Output is correct
20	Correct	12 ms	5588 KB	Output is correct
21	Correct	12 ms	5800 KB	Output is correct
22	Correct	10 ms	5716 KB	Output is correct
23	Correct	12 ms	5844 KB	Output is correct
24	Correct	12 ms	5844 KB	Output is correct
25	Correct	11 ms	5988 KB	Output is correct
26	Correct	12 ms	5972 KB	Output is correct
27	Correct	12 ms	6044 KB	Output is correct
28	Correct	19 ms	6032 KB	Output is correct
29	Correct	17 ms	6100 KB	Output is correct
30	Correct	23 ms	6100 KB	Output is correct
31	Correct	13 ms	6100 KB	Output is correct
32	Correct	13 ms	6148 KB	Output is correct
33	Correct	32 ms	10000 KB	Output is correct
34	Correct	30 ms	10084 KB	Output is correct
35	Correct	53 ms	10084 KB	Output is correct
36	Correct	36 ms	10708 KB	Output is correct
37	Correct	43 ms	10708 KB	Output is correct
38	Correct	82 ms	10764 KB	Output is correct
39	Correct	57 ms	11424 KB	Output is correct
40	Correct	47 ms	11348 KB	Output is correct
41	Correct	102 ms	11440 KB	Output is correct
42	Correct	50 ms	11988 KB	Output is correct
43	Correct	49 ms	11988 KB	Output is correct
44	Correct	135 ms	12116 KB	Output is correct
45	Correct	60 ms	12728 KB	Output is correct
46	Correct	66 ms	12768 KB	Output is correct
47	Correct	156 ms	12784 KB	Output is correct
48	Correct	59 ms	13452 KB	Output is correct
49	Correct	61 ms	13452 KB	Output is correct
50	Correct	198 ms	13460 KB	Output is correct
51	Correct	76 ms	14116 KB	Output is correct
52	Correct	96 ms	14132 KB	Output is correct
53	Correct	198 ms	14132 KB	Output is correct
54	Correct	81 ms	14780 KB	Output is correct
55	Correct	82 ms	14780 KB	Output is correct
56	Correct	236 ms	14796 KB	Output is correct
57	Correct	92 ms	15452 KB	Output is correct
58	Correct	92 ms	15456 KB	Output is correct
59	Correct	271 ms	15472 KB	Output is correct
60	Correct	95 ms	16116 KB	Output is correct
61	Correct	92 ms	16120 KB	Output is correct
62	Correct	330 ms	16140 KB	Output is correct
63	Correct	176 ms	16140 KB	Output is correct
64	Correct	293 ms	16140 KB	Output is correct
65	Correct	285 ms	16060 KB	Output is correct
66	Correct	195 ms	16140 KB	Output is correct
67	Correct	212 ms	16140 KB	Output is correct
68	Correct	160 ms	16132 KB	Output is correct
69	Correct	96 ms	16200 KB	Output is correct
70	Correct	110 ms	16144 KB	Output is correct
71	Correct	137 ms	16204 KB	Output is correct
72	Incorrect	121 ms	16204 KB	Output isn't correct
73	Incorrect	121 ms	16760 KB	Output isn't correct
74	Correct	177 ms	16644 KB	Output is correct
75	Correct	223 ms	16668 KB	Output is correct
76	Correct	158 ms	16680 KB	Output is correct
77	Correct	167 ms	16688 KB	Output is correct
78	Correct	198 ms	16664 KB	Output is correct
79	Correct	187 ms	16588 KB	Output is correct
80	Correct	154 ms	16592 KB	Output is correct
81	Correct	180 ms	16648 KB	Output is correct
82	Correct	193 ms	16604 KB	Output is correct
83	Correct	242 ms	16456 KB	Output is correct
84	Correct	198 ms	16544 KB	Output is correct
85	Correct	223 ms	16648 KB	Output is correct
86	Correct	205 ms	16524 KB	Output is correct
87	Correct	223 ms	16588 KB	Output is correct
88	Correct	238 ms	16480 KB	Output is correct
89	Correct	204 ms	16396 KB	Output is correct
90	Correct	258 ms	16416 KB	Output is correct
91	Correct	226 ms	16588 KB	Output is correct
92	Correct	240 ms	16464 KB	Output is correct