oj.uz

답안 #554799

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
554799 2022-04-29T12:45:52 Z roctes7 Mecho (IOI09_mecho) C++17
76 / 100
 493 ms 31700 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
#define mpa make_pair
typedef long long ll;
typedef long double ld;
const int MOD=1e9+7;
const int MAX=2e5+1;

ll n,s;
string arr[802][802];
bool vist[802][802];
ll mechoDist[802][802];
ll BeesDist[802][802];
pair<ll,ll> mecho;
pair<ll,ll> home;

ll dx[]={1,-1,0,0};
ll dy[]={0,0,1,-1};

bool valid (ll x,ll y){
return x>=1&&x<=n&&y>=1&&y<=n&&!vist[x][y]&&arr[x][y]!="T";
}


bool check =false;

void bfs (ll val){
vist[mecho.fi][mecho.se]=true;
queue<pair<ll,ll>>q;
q.push(mecho);

while (!q.empty()){
    auto p =q.front();
    ll x = p.fi;
    ll y = p.se;
    q.pop();
if(x==home.fi&&y==home.se)check=true;

 if(val+mechoDist[x][y]>=BeesDist[x][y])continue;


for (ll i=0;i<4;i++){
        ll nx = x+dx[i];
        ll ny = y+dy[i];

        if(valid(nx,ny)){
          vist[nx][ny]=true;
          q.push(mpa(nx,ny));
        }
    }
}



}

int main(){

fastio
//freopen("11.in","r",stdin);
//freopen("cl.out","w",stdout);

cin>>n>>s;


for (ll i=1;i<=n;i++){
    string s;
    cin>>s;
    for (ll j=1;j<=n;j++){
        arr[i][j]=s[j-1];

        if(arr[i][j]=="M")mecho=mpa(i,j);
        else if (arr[i][j]=="D")home = mpa(i,j);
    }
}

queue <pair<ll,ll>> q;
q.push(mecho);
vist[mecho.fi][mecho.se]=true;

while(!q.empty()){
    auto p = q.front();
    ll x = p.fi;
    ll y = p.se;

    q.pop();

    for (ll i=0;i<4;i++){
        ll nx = x+dx[i];
        ll ny = y+dy[i];

        if(valid(nx,ny)&&arr[nx][ny]!="H"){
            mechoDist[nx][ny]=mechoDist[x][y]+1;
            vist[nx][ny]=true;
            q.push(mpa(nx,ny));
        }
    }

}


for (ll i=1;i<=n;i++)for(ll j=1;j<=n;j++){
mechoDist[i][j]=mechoDist[i][j]/s;
vist[i][j]=false;
}



for (ll i=1;i<=n;i++)for (ll j=1;j<=n;j++){
    if(arr[i][j]=="H"){
            q.push(mpa(i,j));
            vist[i][j]=true;
    }
}



while(!q.empty()){
    auto p = q.front();
    ll x = p.fi;
    ll y = p.se;
    q.pop();

    for (ll i=0;i<4;i++){
        ll nx = x+dx[i];
        ll ny = y+dy[i];

        if(valid(nx,ny)&&arr[nx][ny]!="D"&&arr[nx][ny]!="H"){
            BeesDist[nx][ny]=BeesDist[x][y]+1;
            vist[nx][ny]=true;
            q.push(mpa(nx,ny));
        }
    }

}


/*cout<<endl<<endl;
for(ll i=1;i<=n;i++){for (ll j=1;j<=n;j++){
        if(arr[i][j]=="G")
     cout<<mechoDist[i][j];
     else cout<<arr[i][j];
}
cout<<endl;
}

cout<<endl<<endl;
for(ll i=1;i<=n;i++){for (ll j=1;j<=n;j++){
    cout<<BeesDist[i][j];
}
cout<<endl;
}*/




ll l=0;
ll r = 1e9;
ll ans =-1;
while (l<=r){
    ll mid = (l+r)/2;
    for (ll i=1;i<=n;i++)for(ll j=1;j<=n;j++){
 vist[i][j]=false;
}
check=false;
bfs(mid);

if(check){
    l=mid+1;
    ans = mid;

} else {
r=mid-1;
}



}

cout<<ans;
return 0;


}





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);
}

Subtask #1
76.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 20436 KB Output is correct
2 Correct 10 ms 20420 KB Output is correct
3 Correct 12 ms 20512 KB Output is correct
4 Correct 11 ms 20436 KB Output is correct
5 Correct 10 ms 20436 KB Output is correct
6 Correct 13 ms 20516 KB Output is correct
7 Correct 328 ms 31360 KB Output is correct
8 Correct 10 ms 20564 KB Output is correct
9 Correct 11 ms 20564 KB Output is correct
10 Correct 10 ms 20564 KB Output is correct
11 Correct 12 ms 20564 KB Output is correct
12 Correct 10 ms 20960 KB Output is correct
13 Correct 10 ms 20948 KB Output is correct
14 Correct 11 ms 20948 KB Output is correct
15 Correct 10 ms 20564 KB Output is correct
16 Correct 10 ms 20564 KB Output is correct
17 Correct 12 ms 20692 KB Output is correct
18 Correct 10 ms 20692 KB Output is correct
19 Correct 10 ms 20692 KB Output is correct
20 Correct 11 ms 20752 KB Output is correct
21 Correct 11 ms 20820 KB Output is correct
22 Correct 12 ms 20856 KB Output is correct
23 Correct 10 ms 20948 KB Output is correct
24 Correct 10 ms 20948 KB Output is correct
25 Correct 12 ms 20984 KB Output is correct
26 Correct 12 ms 21016 KB Output is correct
27 Correct 10 ms 21076 KB Output is correct
28 Correct 11 ms 21112 KB Output is correct
29 Correct 11 ms 21080 KB Output is correct
30 Correct 13 ms 21076 KB Output is correct
31 Correct 12 ms 21204 KB Output is correct
32 Correct 13 ms 21204 KB Output is correct
33 Correct 26 ms 24648 KB Output is correct
34 Correct 29 ms 24924 KB Output is correct
35 Incorrect 78 ms 25128 KB Output isn't correct
36 Correct 30 ms 25292 KB Output is correct
37 Correct 31 ms 25684 KB Output is correct
38 Incorrect 110 ms 25744 KB Output isn't correct
39 Correct 33 ms 25932 KB Output is correct
40 Correct 38 ms 26256 KB Output is correct
41 Incorrect 138 ms 26456 KB Output isn't correct
42 Correct 38 ms 26524 KB Output is correct
43 Correct 39 ms 26956 KB Output is correct
44 Incorrect 170 ms 27068 KB Output isn't correct
45 Correct 46 ms 27084 KB Output is correct
46 Correct 53 ms 27640 KB Output is correct
47 Incorrect 214 ms 27780 KB Output isn't correct
48 Correct 52 ms 27760 KB Output is correct
49 Correct 58 ms 28296 KB Output is correct
50 Incorrect 266 ms 28416 KB Output isn't correct
51 Correct 59 ms 28372 KB Output is correct
52 Correct 67 ms 28900 KB Output is correct
53 Incorrect 318 ms 29160 KB Output isn't correct
54 Correct 72 ms 28904 KB Output is correct
55 Correct 74 ms 29528 KB Output is correct
56 Incorrect 356 ms 29836 KB Output isn't correct
57 Correct 71 ms 29640 KB Output is correct
58 Correct 72 ms 30008 KB Output is correct
59 Incorrect 396 ms 30500 KB Output isn't correct
60 Correct 89 ms 30136 KB Output is correct
61 Correct 84 ms 30692 KB Output is correct
62 Incorrect 475 ms 31160 KB Output isn't correct
63 Correct 320 ms 31116 KB Output is correct
64 Correct 493 ms 31156 KB Output is correct
65 Correct 477 ms 31100 KB Output is correct
66 Correct 358 ms 31160 KB Output is correct
67 Correct 321 ms 31120 KB Output is correct
68 Correct 200 ms 31216 KB Output is correct
69 Correct 207 ms 31108 KB Output is correct
70 Correct 163 ms 31092 KB Output is correct
71 Correct 167 ms 31148 KB Output is correct
72 Correct 150 ms 31096 KB Output is correct
73 Correct 185 ms 31612 KB Output is correct
74 Correct 243 ms 31700 KB Output is correct
75 Correct 267 ms 31572 KB Output is correct
76 Correct 230 ms 31632 KB Output is correct
77 Correct 243 ms 31696 KB Output is correct
78 Correct 252 ms 31612 KB Output is correct
79 Correct 208 ms 31608 KB Output is correct
80 Correct 228 ms 31632 KB Output is correct
81 Correct 263 ms 31636 KB Output is correct
82 Correct 206 ms 31616 KB Output is correct
83 Correct 330 ms 31452 KB Output is correct
84 Correct 280 ms 31564 KB Output is correct
85 Correct 294 ms 31556 KB Output is correct
86 Correct 314 ms 31456 KB Output is correct
87 Correct 299 ms 31556 KB Output is correct
88 Correct 323 ms 31424 KB Output is correct
89 Correct 322 ms 31460 KB Output is correct
90 Correct 334 ms 31392 KB Output is correct
91 Correct 342 ms 31464 KB Output is correct
92 Correct 322 ms 31460 KB Output is correct