oj.uz

답안 #554809

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
554809 2022-04-29T13:03:14 Z roctes7 Mecho (IOI09_mecho) C++17
60 / 100
 485 ms 31948 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)&&arr[nx][ny]!="H"&&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 20456 KB Output is correct
3 Correct 10 ms 20516 KB Output is correct
4 Correct 9 ms 20516 KB Output is correct
5 Correct 10 ms 20448 KB Output is correct
6 Correct 11 ms 20564 KB Output is correct
7 Correct 315 ms 31336 KB Output is correct
8 Correct 10 ms 20564 KB Output is correct
9 Correct 10 ms 20564 KB Output is correct
10 Correct 10 ms 20596 KB Output is correct
11 Correct 9 ms 20604 KB Output is correct
12 Incorrect 10 ms 21076 KB Output isn't correct
13 Incorrect 11 ms 20948 KB Output isn't correct
14 Correct 11 ms 21076 KB Output is correct
15 Correct 10 ms 20572 KB Output is correct
16 Correct 10 ms 20572 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 20688 KB Output is correct
20 Correct 11 ms 20692 KB Output is correct
21 Correct 10 ms 20856 KB Output is correct
22 Correct 10 ms 20820 KB Output is correct
23 Correct 11 ms 20892 KB Output is correct
24 Correct 11 ms 20948 KB Output is correct
25 Correct 11 ms 20980 KB Output is correct
26 Correct 12 ms 20948 KB Output is correct
27 Correct 11 ms 21076 KB Output is correct
28 Correct 11 ms 21076 KB Output is correct
29 Correct 11 ms 21076 KB Output is correct
30 Correct 11 ms 21076 KB Output is correct
31 Correct 11 ms 21176 KB Output is correct
32 Correct 11 ms 21204 KB Output is correct
33 Correct 25 ms 25044 KB Output is correct
34 Correct 28 ms 25032 KB Output is correct
35 Incorrect 61 ms 25148 KB Output isn't correct
36 Correct 28 ms 25808 KB Output is correct
37 Correct 31 ms 25812 KB Output is correct
38 Incorrect 85 ms 25812 KB Output isn't correct
39 Correct 34 ms 26488 KB Output is correct
40 Correct 39 ms 26452 KB Output is correct
41 Incorrect 129 ms 26492 KB Output isn't correct
42 Correct 37 ms 27164 KB Output is correct
43 Correct 39 ms 27116 KB Output is correct
44 Incorrect 167 ms 27264 KB Output isn't correct
45 Correct 44 ms 27804 KB Output is correct
46 Correct 46 ms 27800 KB Output is correct
47 Incorrect 210 ms 27824 KB Output isn't correct
48 Correct 52 ms 28500 KB Output is correct
49 Correct 55 ms 28488 KB Output is correct
50 Incorrect 254 ms 28468 KB Output isn't correct
51 Correct 60 ms 29128 KB Output is correct
52 Correct 63 ms 29152 KB Output is correct
53 Incorrect 290 ms 29260 KB Output isn't correct
54 Correct 80 ms 29824 KB Output is correct
55 Correct 77 ms 29792 KB Output is correct
56 Incorrect 340 ms 29848 KB Output isn't correct
57 Correct 69 ms 30420 KB Output is correct
58 Correct 73 ms 30488 KB Output is correct
59 Incorrect 397 ms 30536 KB Output isn't correct
60 Correct 79 ms 31048 KB Output is correct
61 Correct 87 ms 31048 KB Output is correct
62 Incorrect 451 ms 31168 KB Output isn't correct
63 Correct 319 ms 31160 KB Output is correct
64 Correct 485 ms 31164 KB Output is correct
65 Correct 470 ms 31180 KB Output is correct
66 Correct 355 ms 31172 KB Output is correct
67 Correct 311 ms 31160 KB Output is correct
68 Correct 195 ms 31436 KB Output is correct
69 Correct 183 ms 31308 KB Output is correct
70 Correct 144 ms 31180 KB Output is correct
71 Correct 148 ms 31180 KB Output is correct
72 Incorrect 141 ms 31096 KB Output isn't correct
73 Incorrect 161 ms 31692 KB Output isn't correct
74 Correct 210 ms 31708 KB Output is correct
75 Correct 237 ms 31948 KB Output is correct
76 Correct 217 ms 31720 KB Output is correct
77 Correct 235 ms 31692 KB Output is correct
78 Correct 229 ms 31728 KB Output is correct
79 Correct 204 ms 31680 KB Output is correct
80 Correct 207 ms 31564 KB Output is correct
81 Correct 227 ms 31564 KB Output is correct
82 Correct 194 ms 31772 KB Output is correct
83 Correct 296 ms 31448 KB Output is correct
84 Correct 271 ms 31576 KB Output is correct
85 Correct 275 ms 31572 KB Output is correct
86 Correct 298 ms 31564 KB Output is correct
87 Correct 284 ms 31564 KB Output is correct
88 Correct 296 ms 31500 KB Output is correct
89 Correct 313 ms 31608 KB Output is correct
90 Correct 312 ms 31524 KB Output is correct
91 Correct 304 ms 31420 KB Output is correct
92 Correct 313 ms 31484 KB Output is correct