oj.uz

답안 #554787

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
554787 2022-04-29T12:09:30 Z roctes7 Mecho (IOI09_mecho) C++17
71 / 100
 429 ms 27076 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];
bool finished[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]==0&&finished[x][y])continue;
 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++){

    if (mechoDist[i][j]%s==0)finished[i][j]=true;

    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)){
            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
71.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 20512 KB Output is correct
2 Correct 10 ms 20436 KB Output is correct
3 Correct 10 ms 20484 KB Output is correct
4 Correct 10 ms 20436 KB Output is correct
5 Correct 9 ms 20436 KB Output is correct
6 Correct 10 ms 20564 KB Output is correct
7 Correct 279 ms 26860 KB Output is correct
8 Correct 10 ms 20556 KB Output is correct
9 Correct 10 ms 20568 KB Output is correct
10 Correct 10 ms 20600 KB Output is correct
11 Correct 10 ms 20568 KB Output is correct
12 Incorrect 11 ms 20948 KB Output isn't correct
13 Correct 11 ms 20820 KB Output is correct
14 Correct 11 ms 20852 KB Output is correct
15 Correct 10 ms 20556 KB Output is correct
16 Correct 10 ms 20564 KB Output is correct
17 Correct 10 ms 20564 KB Output is correct
18 Correct 11 ms 20608 KB Output is correct
19 Correct 10 ms 20628 KB Output is correct
20 Correct 11 ms 20636 KB Output is correct
21 Correct 10 ms 20692 KB Output is correct
22 Correct 10 ms 20692 KB Output is correct
23 Correct 11 ms 20788 KB Output is correct
24 Correct 12 ms 20792 KB Output is correct
25 Correct 11 ms 20948 KB Output is correct
26 Correct 10 ms 20948 KB Output is correct
27 Correct 10 ms 20948 KB Output is correct
28 Correct 10 ms 20956 KB Output is correct
29 Correct 10 ms 20992 KB Output is correct
30 Correct 11 ms 20912 KB Output is correct
31 Correct 11 ms 21076 KB Output is correct
32 Correct 11 ms 20948 KB Output is correct
33 Correct 23 ms 23164 KB Output is correct
34 Correct 25 ms 23160 KB Output is correct
35 Incorrect 54 ms 23216 KB Output isn't correct
36 Correct 28 ms 23592 KB Output is correct
37 Correct 26 ms 23540 KB Output is correct
38 Incorrect 78 ms 23684 KB Output isn't correct
39 Correct 30 ms 23976 KB Output is correct
40 Correct 30 ms 24020 KB Output is correct
41 Incorrect 109 ms 24008 KB Output isn't correct
42 Correct 32 ms 24316 KB Output is correct
43 Correct 33 ms 24404 KB Output is correct
44 Incorrect 152 ms 24372 KB Output isn't correct
45 Correct 39 ms 24700 KB Output is correct
46 Correct 42 ms 24800 KB Output is correct
47 Incorrect 189 ms 24804 KB Output isn't correct
48 Correct 44 ms 25164 KB Output is correct
49 Correct 49 ms 25164 KB Output is correct
50 Incorrect 224 ms 25156 KB Output isn't correct
51 Correct 52 ms 25584 KB Output is correct
52 Correct 53 ms 25560 KB Output is correct
53 Incorrect 270 ms 25556 KB Output isn't correct
54 Correct 60 ms 25876 KB Output is correct
55 Correct 62 ms 25932 KB Output is correct
56 Incorrect 314 ms 25928 KB Output isn't correct
57 Correct 59 ms 26324 KB Output is correct
58 Correct 64 ms 26316 KB Output is correct
59 Incorrect 363 ms 26484 KB Output isn't correct
60 Correct 76 ms 26740 KB Output is correct
61 Correct 69 ms 26752 KB Output is correct
62 Incorrect 410 ms 26824 KB Output isn't correct
63 Correct 278 ms 26764 KB Output is correct
64 Correct 429 ms 26760 KB Output is correct
65 Correct 418 ms 26756 KB Output is correct
66 Correct 308 ms 26756 KB Output is correct
67 Correct 279 ms 26868 KB Output is correct
68 Correct 156 ms 26784 KB Output is correct
69 Correct 157 ms 26792 KB Output is correct
70 Correct 126 ms 26796 KB Output is correct
71 Correct 132 ms 26668 KB Output is correct
72 Correct 131 ms 26792 KB Output is correct
73 Correct 136 ms 27024 KB Output is correct
74 Correct 174 ms 26948 KB Output is correct
75 Correct 196 ms 27036 KB Output is correct
76 Correct 178 ms 26996 KB Output is correct
77 Correct 186 ms 27012 KB Output is correct
78 Correct 196 ms 26940 KB Output is correct
79 Correct 157 ms 26884 KB Output is correct
80 Correct 169 ms 26888 KB Output is correct
81 Correct 183 ms 26900 KB Output is correct
82 Correct 155 ms 27004 KB Output is correct
83 Correct 255 ms 27076 KB Output is correct
84 Correct 233 ms 26972 KB Output is correct
85 Correct 236 ms 26968 KB Output is correct
86 Correct 250 ms 26956 KB Output is correct
87 Correct 243 ms 26968 KB Output is correct
88 Correct 263 ms 26840 KB Output is correct
89 Correct 266 ms 26912 KB Output is correct
90 Correct 275 ms 27004 KB Output is correct
91 Correct 263 ms 27060 KB Output is correct
92 Correct 269 ms 26912 KB Output is correct