fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. typedef long long ll;
  5. typedef pair<int, int> pii;
  6.  
  7. #define FOR(i,a,b) for(int i=a; i<=b; ++i)
  8. #define FORR(i,a,b) for(int i=a; i>=b; --i)
  9. #define pb push_back
  10. #define mp make_pair
  11. #define fi first
  12. #define se second
  13. #define all(x) x.begin(), x.end()
  14. #define sz(x) x.size()
  15.  
  16. template<class T>
  17.     bool maximize(T &a, T b) {
  18.     if (a < b) {a = b; return true;}
  19.     return false;
  20. }
  21.  
  22. template<class T>
  23.     bool minimize(T &a, T b) {
  24.     if (a > b) {a = b; return true;}
  25.     return false;
  26. }
  27.  
  28. const int inf = INT_MAX;
  29. const ll LLinf = LONG_LONG_MAX;
  30. const int MOD = 1e9 + 7;
  31. const int N = 100 + 5;
  32. const int dx[] = {0, 0, 1, -1}; // (x+0, x+0, x+1, x-1)
  33. const int dy[] = {1, -1, 0, 0}; // (y+1, y-1, y+0, y+0)
  34.  
  35. int dist[N][N];
  36. char a[N][N];
  37. bool vis[N][N];
  38.  
  39. void solve(){
  40.     int n, m;
  41.     cin >> n >> m;
  42.     queue<pair<int, int>> q; // lưu các ô (i, j)
  43.     memset(dist, 0x3f, sizeof dist); // +oo
  44.     FOR(i,1,n)
  45.         FOR(j,1,m){
  46.             cin >> a[i][j];
  47.             if (a[i][j] == 'C') dist[i][j] = 0, vis[i][j] =true, q.push(mp(i, j));
  48.         }
  49.     while(!q.empty()){
  50.         int x = q.front().fi;
  51.         int y = q.front().se;
  52.         q.pop();
  53.         if (a[x][y] == 'B') cout << dist[x][y], exit(0);
  54.         FOR(i,0,3){
  55.             int x1 = x + dx[i];
  56.             int y1 = y + dy[i];
  57.             if (x1 > 0 && x1 <= n && y1 > 0 && y1 <= m && dist[x1][y1] > dist[x][y] && a[x1][y1] != '*' && !vis[x1][y1]) {
  58.                 vis[x1][y1] = true;
  59.                 dist[x1][y1] = dist[x][y] + 1, q.push(mp(x1, y1));
  60.             }
  61.         }
  62.     }
  63.     cout << -1;
  64. }
  65.  
  66. main(){
  67. //  icebear hehehhe
  68.     cin.tie(0) -> sync_with_stdio(0);
  69.     cout.tie(0);
  70.     int t = 1;
  71.     while(t--) solve();
  72.     return 0;
  73. }
  74.  
Success #stdin #stdout 0.01s 5324KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
-1
https://ideone.com/apniOD
language:
C++14 (gcc 8.3)
created:
11 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!