oj.uz

답안 #554813

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
554813 2022-04-29T13:07:40 Z roctes7 Mecho (IOI09_mecho) C++17
76 / 100
 547 ms 32076 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)&&arr[nx][ny]!="H"){
          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 13 ms 20436 KB Output is correct
2 Correct 10 ms 20508 KB Output is correct
3 Correct 11 ms 20436 KB Output is correct
4 Correct 10 ms 20428 KB Output is correct
5 Correct 10 ms 20436 KB Output is correct
6 Correct 10 ms 20556 KB Output is correct
7 Correct 349 ms 31316 KB Output is correct
8 Correct 14 ms 20504 KB Output is correct
9 Correct 15 ms 20564 KB Output is correct
10 Correct 11 ms 20572 KB Output is correct
11 Correct 13 ms 20600 KB Output is correct
12 Correct 12 ms 20948 KB Output is correct
13 Correct 12 ms 20956 KB Output is correct
14 Correct 11 ms 20948 KB Output is correct
15 Correct 12 ms 20616 KB Output is correct
16 Correct 10 ms 20564 KB Output is correct
17 Correct 10 ms 20692 KB Output is correct
18 Correct 10 ms 20692 KB Output is correct
19 Correct 10 ms 20704 KB Output is correct
20 Correct 11 ms 20644 KB Output is correct
21 Correct 12 ms 20736 KB Output is correct
22 Correct 11 ms 20728 KB Output is correct
23 Correct 11 ms 20892 KB Output is correct
24 Correct 14 ms 20868 KB Output is correct
25 Correct 12 ms 20976 KB Output is correct
26 Correct 11 ms 20964 KB Output is correct
27 Correct 12 ms 21108 KB Output is correct
28 Correct 14 ms 21068 KB Output is correct
29 Correct 13 ms 21112 KB Output is correct
30 Correct 12 ms 21076 KB Output is correct
31 Correct 12 ms 21204 KB Output is correct
32 Correct 11 ms 21204 KB Output is correct
33 Correct 29 ms 24632 KB Output is correct
34 Correct 30 ms 24940 KB Output is correct
35 Incorrect 106 ms 25128 KB Output isn't correct
36 Correct 31 ms 25300 KB Output is correct
37 Correct 31 ms 25544 KB Output is correct
38 Incorrect 118 ms 25808 KB Output isn't correct
39 Correct 35 ms 25936 KB Output is correct
40 Correct 37 ms 26280 KB Output is correct
41 Incorrect 163 ms 26480 KB Output isn't correct
42 Correct 56 ms 26520 KB Output is correct
43 Correct 41 ms 26940 KB Output is correct
44 Incorrect 194 ms 27148 KB Output isn't correct
45 Correct 48 ms 27116 KB Output is correct
46 Correct 49 ms 27664 KB Output is correct
47 Incorrect 239 ms 27824 KB Output isn't correct
48 Correct 57 ms 27792 KB Output is correct
49 Correct 57 ms 28380 KB Output is correct
50 Incorrect 271 ms 28496 KB Output isn't correct
51 Correct 87 ms 28404 KB Output is correct
52 Correct 71 ms 28900 KB Output is correct
53 Incorrect 325 ms 29128 KB Output isn't correct
54 Correct 81 ms 28908 KB Output is correct
55 Correct 111 ms 29644 KB Output is correct
56 Incorrect 393 ms 29836 KB Output isn't correct
57 Correct 77 ms 29752 KB Output is correct
58 Correct 123 ms 30144 KB Output is correct
59 Incorrect 453 ms 30620 KB Output isn't correct
60 Correct 133 ms 30496 KB Output is correct
61 Correct 119 ms 30924 KB Output is correct
62 Incorrect 547 ms 31412 KB Output isn't correct
63 Correct 360 ms 31420 KB Output is correct
64 Correct 540 ms 31420 KB Output is correct
65 Correct 544 ms 31308 KB Output is correct
66 Correct 393 ms 31436 KB Output is correct
67 Correct 396 ms 31412 KB Output is correct
68 Correct 230 ms 31472 KB Output is correct
69 Correct 213 ms 31468 KB Output is correct
70 Correct 189 ms 31484 KB Output is correct
71 Correct 185 ms 31456 KB Output is correct
72 Correct 212 ms 31420 KB Output is correct
73 Correct 225 ms 31840 KB Output is correct
74 Correct 394 ms 31876 KB Output is correct
75 Correct 277 ms 31948 KB Output is correct
76 Correct 311 ms 31964 KB Output is correct
77 Correct 283 ms 31948 KB Output is correct
78 Correct 312 ms 31928 KB Output is correct
79 Correct 264 ms 31840 KB Output is correct
80 Correct 301 ms 31892 KB Output is correct
81 Correct 299 ms 31784 KB Output is correct
82 Correct 264 ms 31884 KB Output is correct
83 Correct 416 ms 31732 KB Output is correct
84 Correct 416 ms 31804 KB Output is correct
85 Correct 344 ms 31816 KB Output is correct
86 Correct 393 ms 32072 KB Output is correct
87 Correct 403 ms 32076 KB Output is correct
88 Correct 388 ms 31972 KB Output is correct
89 Correct 357 ms 31948 KB Output is correct
90 Correct 352 ms 31972 KB Output is correct
91 Correct 322 ms 32064 KB Output is correct
92 Correct 334 ms 31872 KB Output is correct