답안 #554938

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
554938	2022-04-29T16:33:01 Z	savackexp	Mecho (IOI09_mecho)	C++14	24 / 100	276 ms	16812 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';
}
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 + (levelm[nx][ny])%k!=0;
                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;
            if(vis[nx][ny])continue;
            levelh[nx][ny] = levelh[p.fi][p.se]+1;
            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

24.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	10 ms	5332 KB	Output is correct
2	Incorrect	10 ms	5444 KB	Output isn't correct
3	Correct	11 ms	5332 KB	Output is correct
4	Incorrect	10 ms	5460 KB	Output isn't correct
5	Incorrect	11 ms	5472 KB	Output isn't correct
6	Incorrect	11 ms	5460 KB	Output isn't correct
7	Incorrect	221 ms	16372 KB	Output isn't correct
8	Incorrect	12 ms	5588 KB	Output isn't correct
9	Incorrect	11 ms	5460 KB	Output isn't correct
10	Incorrect	10 ms	5460 KB	Output isn't correct
11	Incorrect	10 ms	5460 KB	Output isn't correct
12	Incorrect	11 ms	5972 KB	Output isn't correct
13	Correct	12 ms	5844 KB	Output is correct
14	Incorrect	14 ms	5972 KB	Output isn't correct
15	Correct	11 ms	5588 KB	Output is correct
16	Correct	12 ms	5588 KB	Output is correct
17	Correct	14 ms	5640 KB	Output is correct
18	Correct	9 ms	5644 KB	Output is correct
19	Correct	11 ms	5692 KB	Output is correct
20	Correct	9 ms	5588 KB	Output is correct
21	Correct	10 ms	5792 KB	Output is correct
22	Correct	11 ms	5716 KB	Output is correct
23	Correct	12 ms	5844 KB	Output is correct
24	Correct	11 ms	5896 KB	Output is correct
25	Correct	11 ms	5984 KB	Output is correct
26	Correct	11 ms	5972 KB	Output is correct
27	Correct	16 ms	6036 KB	Output is correct
28	Correct	10 ms	6040 KB	Output is correct
29	Correct	11 ms	6088 KB	Output is correct
30	Correct	11 ms	6092 KB	Output is correct
31	Correct	11 ms	6128 KB	Output is correct
32	Correct	11 ms	6104 KB	Output is correct
33	Correct	31 ms	9684 KB	Output is correct
34	Correct	25 ms	9940 KB	Output is correct
35	Incorrect	58 ms	10068 KB	Output isn't correct
36	Correct	29 ms	10196 KB	Output is correct
37	Correct	37 ms	10580 KB	Output is correct
38	Incorrect	67 ms	10768 KB	Output isn't correct
39	Correct	35 ms	10836 KB	Output is correct
40	Correct	36 ms	11332 KB	Output is correct
41	Incorrect	77 ms	11436 KB	Output isn't correct
42	Correct	53 ms	11520 KB	Output is correct
43	Correct	55 ms	12008 KB	Output is correct
44	Incorrect	113 ms	12116 KB	Output isn't correct
45	Correct	45 ms	12116 KB	Output is correct
46	Correct	54 ms	12696 KB	Output is correct
47	Incorrect	121 ms	12784 KB	Output isn't correct
48	Correct	55 ms	12756 KB	Output is correct
49	Correct	65 ms	13352 KB	Output is correct
50	Incorrect	140 ms	13456 KB	Output isn't correct
51	Correct	66 ms	13428 KB	Output is correct
52	Correct	63 ms	13840 KB	Output is correct
53	Incorrect	172 ms	14236 KB	Output isn't correct
54	Correct	68 ms	13968 KB	Output is correct
55	Correct	66 ms	14524 KB	Output is correct
56	Incorrect	204 ms	14804 KB	Output isn't correct
57	Correct	80 ms	14600 KB	Output is correct
58	Correct	77 ms	15060 KB	Output is correct
59	Incorrect	228 ms	15472 KB	Output isn't correct
60	Correct	80 ms	15192 KB	Output is correct
61	Correct	84 ms	15572 KB	Output is correct
62	Incorrect	256 ms	16140 KB	Output isn't correct
63	Incorrect	241 ms	16080 KB	Output isn't correct
64	Correct	269 ms	16140 KB	Output is correct
65	Incorrect	276 ms	16136 KB	Output isn't correct
66	Incorrect	240 ms	16140 KB	Output isn't correct
67	Incorrect	244 ms	16268 KB	Output isn't correct
68	Incorrect	117 ms	16212 KB	Output isn't correct
69	Incorrect	118 ms	16204 KB	Output isn't correct
70	Incorrect	123 ms	16124 KB	Output isn't correct
71	Incorrect	122 ms	16196 KB	Output isn't correct
72	Correct	93 ms	16076 KB	Output is correct
73	Correct	156 ms	16724 KB	Output is correct
74	Correct	151 ms	16760 KB	Output is correct
75	Incorrect	173 ms	16760 KB	Output isn't correct
76	Incorrect	144 ms	16672 KB	Output isn't correct
77	Incorrect	174 ms	16812 KB	Output isn't correct
78	Incorrect	177 ms	16676 KB	Output isn't correct
79	Correct	141 ms	16588 KB	Output is correct
80	Incorrect	138 ms	16672 KB	Output isn't correct
81	Incorrect	150 ms	16592 KB	Output isn't correct
82	Incorrect	161 ms	16680 KB	Output isn't correct
83	Incorrect	198 ms	16544 KB	Output isn't correct
84	Correct	182 ms	16596 KB	Output is correct
85	Incorrect	167 ms	16604 KB	Output isn't correct
86	Incorrect	191 ms	16588 KB	Output isn't correct
87	Incorrect	187 ms	16588 KB	Output isn't correct
88	Incorrect	202 ms	16472 KB	Output isn't correct
89	Correct	188 ms	16468 KB	Output is correct
90	Incorrect	200 ms	16468 KB	Output isn't correct
91	Incorrect	195 ms	16464 KB	Output isn't correct
92	Incorrect	193 ms	16468 KB	Output isn't correct