oj.uz

답안 #554788

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
554788 2022-04-29T12:13:30 Z roctes7 Mecho (IOI09_mecho) C++17
76 / 100
 486 ms 26624 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;

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

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

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


bool check =false;
void bfs (int i,int j ,int val){
vist[i][j]=true;
queue<pair<int,int>>q;
q.push(mpa(i,j));

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

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


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

        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 (int i=1;i<=n;i++){
    string s;
    cin>>s;
    for (int 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<int,int>> q;
q.push(mecho);
vist[mecho.fi][mecho.se]=true;

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

    q.pop();

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

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

}


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



for (int i=1;i<=n;i++)for (int 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();
    int x = p.fi;
    int y = p.se;
    q.pop();

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

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

}


/*cout<<endl<<endl;
for(int i=1;i<=n;i++){for (int 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(int i=1;i<=n;i++){for (int j=1;j<=n;j++){
    cout<<BeesDist[i][j];
}
cout<<endl;
}*/




int l=0;
int r = 1e9;
int ans =-1;
while (l<=r){
    int mid = (l+r)/2;
    for (int i=1;i<=n;i++)for(int j=1;j<=n;j++){
 vist[i][j]=false;
}
check=false;
bfs(mecho.fi,mecho.se,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 11 ms 20436 KB Output is correct
2 Correct 11 ms 20484 KB Output is correct
3 Correct 13 ms 20436 KB Output is correct
4 Correct 11 ms 20436 KB Output is correct
5 Correct 10 ms 20436 KB Output is correct
6 Correct 11 ms 20484 KB Output is correct
7 Correct 330 ms 26240 KB Output is correct
8 Correct 10 ms 20468 KB Output is correct
9 Correct 11 ms 20564 KB Output is correct
10 Correct 11 ms 20484 KB Output is correct
11 Correct 11 ms 20564 KB Output is correct
12 Correct 12 ms 20820 KB Output is correct
13 Correct 12 ms 20820 KB Output is correct
14 Correct 13 ms 20956 KB Output is correct
15 Correct 11 ms 20584 KB Output is correct
16 Correct 11 ms 20564 KB Output is correct
17 Correct 11 ms 20528 KB Output is correct
18 Correct 10 ms 20564 KB Output is correct
19 Correct 10 ms 20660 KB Output is correct
20 Correct 11 ms 20564 KB Output is correct
21 Correct 12 ms 20692 KB Output is correct
22 Correct 12 ms 20744 KB Output is correct
23 Correct 11 ms 20824 KB Output is correct
24 Correct 12 ms 20720 KB Output is correct
25 Correct 12 ms 20820 KB Output is correct
26 Correct 12 ms 20884 KB Output is correct
27 Correct 11 ms 20948 KB Output is correct
28 Correct 11 ms 20820 KB Output is correct
29 Correct 11 ms 20884 KB Output is correct
30 Correct 12 ms 20892 KB Output is correct
31 Correct 12 ms 21008 KB Output is correct
32 Correct 11 ms 21016 KB Output is correct
33 Correct 23 ms 22868 KB Output is correct
34 Correct 27 ms 22932 KB Output is correct
35 Incorrect 94 ms 22940 KB Output isn't correct
36 Correct 28 ms 23236 KB Output is correct
37 Correct 29 ms 23244 KB Output is correct
38 Incorrect 82 ms 23308 KB Output isn't correct
39 Correct 30 ms 23576 KB Output is correct
40 Correct 30 ms 23636 KB Output is correct
41 Incorrect 136 ms 23660 KB Output isn't correct
42 Correct 39 ms 24008 KB Output is correct
43 Correct 37 ms 23884 KB Output is correct
44 Incorrect 156 ms 23992 KB Output isn't correct
45 Correct 39 ms 24372 KB Output is correct
46 Correct 42 ms 24296 KB Output is correct
47 Incorrect 194 ms 24256 KB Output isn't correct
48 Correct 52 ms 24724 KB Output is correct
49 Correct 51 ms 24712 KB Output is correct
50 Incorrect 231 ms 24628 KB Output isn't correct
51 Correct 52 ms 25036 KB Output is correct
52 Correct 56 ms 25000 KB Output is correct
53 Incorrect 309 ms 25204 KB Output isn't correct
54 Correct 65 ms 25360 KB Output is correct
55 Correct 72 ms 25424 KB Output is correct
56 Incorrect 330 ms 25372 KB Output isn't correct
57 Correct 72 ms 25804 KB Output is correct
58 Correct 73 ms 25728 KB Output is correct
59 Incorrect 383 ms 25792 KB Output isn't correct
60 Correct 78 ms 26008 KB Output is correct
61 Correct 78 ms 26060 KB Output is correct
62 Incorrect 444 ms 26236 KB Output isn't correct
63 Correct 301 ms 26048 KB Output is correct
64 Correct 462 ms 26164 KB Output is correct
65 Correct 486 ms 26188 KB Output is correct
66 Correct 340 ms 26308 KB Output is correct
67 Correct 297 ms 26116 KB Output is correct
68 Correct 190 ms 26156 KB Output is correct
69 Correct 179 ms 26036 KB Output is correct
70 Correct 144 ms 26060 KB Output is correct
71 Correct 140 ms 26156 KB Output is correct
72 Correct 135 ms 26188 KB Output is correct
73 Correct 161 ms 26572 KB Output is correct
74 Correct 182 ms 26508 KB Output is correct
75 Correct 203 ms 26404 KB Output is correct
76 Correct 210 ms 26624 KB Output is correct
77 Correct 194 ms 26312 KB Output is correct
78 Correct 223 ms 26436 KB Output is correct
79 Correct 187 ms 26376 KB Output is correct
80 Correct 180 ms 26488 KB Output is correct
81 Correct 201 ms 26300 KB Output is correct
82 Correct 223 ms 26380 KB Output is correct
83 Correct 264 ms 26340 KB Output is correct
84 Correct 241 ms 26228 KB Output is correct
85 Correct 252 ms 26444 KB Output is correct
86 Correct 265 ms 26312 KB Output is correct
87 Correct 256 ms 26344 KB Output is correct
88 Correct 291 ms 26288 KB Output is correct
89 Correct 294 ms 26288 KB Output is correct
90 Correct 324 ms 26300 KB Output is correct
91 Correct 277 ms 26288 KB Output is correct
92 Correct 292 ms 26284 KB Output is correct