oj.uz

답안 #554977

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
554977 2022-04-29T19:22:06 Z savackexp Mecho (IOI09_mecho) C++14
0 / 100
 1000 ms 16768 KB 
#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;
                if(levelh[nx][ny] + u <= qe)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
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 10 ms 5332 KB Output isn't correct
2 Incorrect 10 ms 5448 KB Output isn't correct
3 Incorrect 10 ms 5332 KB Output isn't correct
4 Incorrect 11 ms 5332 KB Output isn't correct
5 Incorrect 12 ms 5476 KB Output isn't correct
6 Incorrect 15 ms 5484 KB Output isn't correct
7 Execution timed out 1081 ms 16360 KB Time limit exceeded
8 Incorrect 13 ms 5460 KB Output isn't correct
9 Incorrect 17 ms 5536 KB Output isn't correct
10 Incorrect 13 ms 5544 KB Output isn't correct
11 Incorrect 12 ms 5460 KB Output isn't correct
12 Incorrect 17 ms 5984 KB Output isn't correct
13 Incorrect 18 ms 5844 KB Output isn't correct
14 Incorrect 22 ms 6008 KB Output isn't correct
15 Incorrect 13 ms 5588 KB Output isn't correct
16 Incorrect 16 ms 5592 KB Output isn't correct
17 Incorrect 15 ms 5588 KB Output isn't correct
18 Incorrect 11 ms 5640 KB Output isn't correct
19 Incorrect 16 ms 5588 KB Output isn't correct
20 Incorrect 20 ms 5704 KB Output isn't correct
21 Incorrect 23 ms 5716 KB Output isn't correct
22 Incorrect 16 ms 5796 KB Output isn't correct
23 Incorrect 17 ms 5844 KB Output isn't correct
24 Incorrect 15 ms 5844 KB Output isn't correct
25 Incorrect 17 ms 5972 KB Output isn't correct
26 Incorrect 16 ms 5972 KB Output isn't correct
27 Incorrect 17 ms 6040 KB Output isn't correct
28 Incorrect 16 ms 6044 KB Output isn't correct
29 Incorrect 17 ms 6104 KB Output isn't correct
30 Incorrect 16 ms 6100 KB Output isn't correct
31 Incorrect 22 ms 6156 KB Output isn't correct
32 Incorrect 18 ms 6148 KB Output isn't correct
33 Incorrect 147 ms 10068 KB Output isn't correct
34 Incorrect 127 ms 10080 KB Output isn't correct
35 Incorrect 233 ms 10068 KB Output isn't correct
36 Incorrect 175 ms 10752 KB Output isn't correct
37 Incorrect 174 ms 10752 KB Output isn't correct
38 Incorrect 323 ms 10760 KB Output isn't correct
39 Incorrect 219 ms 11432 KB Output isn't correct
40 Incorrect 229 ms 11440 KB Output isn't correct
41 Incorrect 385 ms 11436 KB Output isn't correct
42 Incorrect 286 ms 12092 KB Output isn't correct
43 Incorrect 229 ms 12100 KB Output isn't correct
44 Incorrect 569 ms 12104 KB Output isn't correct
45 Incorrect 311 ms 12772 KB Output isn't correct
46 Incorrect 273 ms 12780 KB Output isn't correct
47 Incorrect 634 ms 12724 KB Output isn't correct
48 Incorrect 389 ms 13456 KB Output isn't correct
49 Incorrect 305 ms 13416 KB Output isn't correct
50 Incorrect 826 ms 13472 KB Output isn't correct
51 Incorrect 434 ms 14036 KB Output isn't correct
52 Incorrect 374 ms 14124 KB Output isn't correct
53 Incorrect 908 ms 14128 KB Output isn't correct
54 Incorrect 524 ms 14780 KB Output isn't correct
55 Incorrect 409 ms 14784 KB Output isn't correct
56 Execution timed out 1082 ms 14736 KB Time limit exceeded
57 Incorrect 581 ms 15452 KB Output isn't correct
58 Incorrect 481 ms 15460 KB Output isn't correct
59 Execution timed out 1088 ms 15436 KB Time limit exceeded
60 Incorrect 628 ms 16120 KB Output isn't correct
61 Incorrect 530 ms 16120 KB Output isn't correct
62 Execution timed out 1090 ms 16076 KB Time limit exceeded
63 Execution timed out 1091 ms 16112 KB Time limit exceeded
64 Execution timed out 1082 ms 16024 KB Time limit exceeded
65 Execution timed out 1095 ms 16024 KB Time limit exceeded
66 Execution timed out 1090 ms 16084 KB Time limit exceeded
67 Execution timed out 1097 ms 16076 KB Time limit exceeded
68 Execution timed out 1095 ms 16288 KB Time limit exceeded
69 Execution timed out 1097 ms 16148 KB Time limit exceeded
70 Execution timed out 1096 ms 16080 KB Time limit exceeded
71 Execution timed out 1088 ms 16152 KB Time limit exceeded
72 Execution timed out 1100 ms 16148 KB Time limit exceeded
73 Execution timed out 1094 ms 16716 KB Time limit exceeded
74 Execution timed out 1091 ms 16768 KB Time limit exceeded
75 Execution timed out 1099 ms 16716 KB Time limit exceeded
76 Execution timed out 1092 ms 16768 KB Time limit exceeded
77 Execution timed out 1099 ms 16764 KB Time limit exceeded
78 Execution timed out 1097 ms 16632 KB Time limit exceeded
79 Execution timed out 1091 ms 16680 KB Time limit exceeded
80 Execution timed out 1098 ms 16588 KB Time limit exceeded
81 Execution timed out 1101 ms 16584 KB Time limit exceeded
82 Execution timed out 1099 ms 16588 KB Time limit exceeded
83 Execution timed out 1098 ms 16556 KB Time limit exceeded
84 Execution timed out 1086 ms 16588 KB Time limit exceeded
85 Execution timed out 1083 ms 16716 KB Time limit exceeded
86 Execution timed out 1096 ms 16596 KB Time limit exceeded
87 Execution timed out 1087 ms 16632 KB Time limit exceeded
88 Execution timed out 1097 ms 16400 KB Time limit exceeded
89 Execution timed out 1094 ms 16472 KB Time limit exceeded
90 Execution timed out 1090 ms 16480 KB Time limit exceeded
91 Execution timed out 1092 ms 16476 KB Time limit exceeded
92 Execution timed out 1098 ms 16476 KB Time limit exceeded