oj.uz

답안 #554807

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
554807 2022-04-29T12:58:57 Z roctes7 Mecho (IOI09_mecho) C++17
60 / 100
 467 ms 31812 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;



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

        if(valid(nx,ny)&&val+mechoDist[nx][ny]<BeesDist[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 (int i=1;i<=n;i++)for (int j=1;j<=n;j++){
    BeesDist[i][j]=1e9;
    mechoDist[i][j]=1e9;
}

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);
mechoDist[mecho.fi][mecho.se]=0;
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));
            BeesDist[i][j]=0;
            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
60.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 20436 KB Output is correct
2 Correct 10 ms 20496 KB Output is correct
3 Correct 11 ms 20456 KB Output is correct
4 Correct 11 ms 20524 KB Output is correct
5 Correct 11 ms 20436 KB Output is correct
6 Correct 12 ms 20436 KB Output is correct
7 Correct 301 ms 31380 KB Output is correct
8 Correct 11 ms 20564 KB Output is correct
9 Correct 11 ms 20564 KB Output is correct
10 Correct 11 ms 20496 KB Output is correct
11 Correct 10 ms 20564 KB Output is correct
12 Incorrect 11 ms 20956 KB Output isn't correct
13 Incorrect 12 ms 20948 KB Output isn't correct
14 Correct 12 ms 21048 KB Output is correct
15 Correct 11 ms 20564 KB Output is correct
16 Correct 11 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 11 ms 20692 KB Output is correct
20 Correct 11 ms 20692 KB Output is correct
21 Correct 11 ms 20820 KB Output is correct
22 Correct 10 ms 20828 KB Output is correct
23 Correct 11 ms 20948 KB Output is correct
24 Correct 12 ms 20872 KB Output is correct
25 Correct 11 ms 20948 KB Output is correct
26 Correct 11 ms 21020 KB Output is correct
27 Correct 11 ms 21076 KB Output is correct
28 Correct 11 ms 21024 KB Output is correct
29 Correct 11 ms 21088 KB Output is correct
30 Correct 11 ms 21168 KB Output is correct
31 Correct 11 ms 21204 KB Output is correct
32 Correct 12 ms 21204 KB Output is correct
33 Correct 26 ms 25124 KB Output is correct
34 Correct 30 ms 25108 KB Output is correct
35 Incorrect 57 ms 25036 KB Output isn't correct
36 Correct 30 ms 25812 KB Output is correct
37 Correct 31 ms 25772 KB Output is correct
38 Incorrect 91 ms 25812 KB Output isn't correct
39 Correct 36 ms 26452 KB Output is correct
40 Correct 38 ms 26480 KB Output is correct
41 Incorrect 120 ms 26496 KB Output isn't correct
42 Correct 39 ms 27140 KB Output is correct
43 Correct 45 ms 27144 KB Output is correct
44 Incorrect 168 ms 27156 KB Output isn't correct
45 Correct 47 ms 27724 KB Output is correct
46 Correct 47 ms 27732 KB Output is correct
47 Incorrect 196 ms 27828 KB Output isn't correct
48 Correct 54 ms 28532 KB Output is correct
49 Correct 61 ms 28372 KB Output is correct
50 Incorrect 243 ms 28480 KB Output isn't correct
51 Correct 61 ms 29076 KB Output is correct
52 Correct 77 ms 29148 KB Output is correct
53 Incorrect 311 ms 29088 KB Output isn't correct
54 Correct 72 ms 29924 KB Output is correct
55 Correct 77 ms 29724 KB Output is correct
56 Incorrect 331 ms 29912 KB Output isn't correct
57 Correct 75 ms 30416 KB Output is correct
58 Correct 78 ms 30492 KB Output is correct
59 Incorrect 378 ms 30476 KB Output isn't correct
60 Correct 94 ms 31192 KB Output is correct
61 Correct 130 ms 31160 KB Output is correct
62 Incorrect 429 ms 31280 KB Output isn't correct
63 Correct 325 ms 31156 KB Output is correct
64 Correct 457 ms 31160 KB Output is correct
65 Correct 467 ms 31160 KB Output is correct
66 Correct 353 ms 31180 KB Output is correct
67 Correct 325 ms 31064 KB Output is correct
68 Correct 201 ms 31292 KB Output is correct
69 Correct 178 ms 31224 KB Output is correct
70 Correct 180 ms 31304 KB Output is correct
71 Correct 187 ms 31184 KB Output is correct
72 Incorrect 159 ms 31164 KB Output isn't correct
73 Incorrect 160 ms 31708 KB Output isn't correct
74 Correct 231 ms 31688 KB Output is correct
75 Correct 274 ms 31708 KB Output is correct
76 Correct 210 ms 31692 KB Output is correct
77 Correct 246 ms 31764 KB Output is correct
78 Correct 231 ms 31812 KB Output is correct
79 Correct 208 ms 31532 KB Output is correct
80 Correct 223 ms 31668 KB Output is correct
81 Correct 224 ms 31688 KB Output is correct
82 Correct 211 ms 31648 KB Output is correct
83 Correct 300 ms 31572 KB Output is correct
84 Correct 278 ms 31688 KB Output is correct
85 Correct 297 ms 31576 KB Output is correct
86 Correct 278 ms 31576 KB Output is correct
87 Correct 335 ms 31576 KB Output is correct
88 Correct 348 ms 31604 KB Output is correct
89 Correct 294 ms 31560 KB Output is correct
90 Correct 308 ms 31672 KB Output is correct
91 Correct 323 ms 31548 KB Output is correct
92 Correct 290 ms 31432 KB Output is correct