fork download
copy 
  1. #pragma GCC optimize("Ofast")
  2. #include <bits/stdc++.h>
  3.  
  4. using namespace std;
  5.  
  6. #define ll long long
  7. #define pb push_back
  8. #define mp make_pair
  9. #define mogaAc ios_base::sync_with_stdio(false);
  10. int arr[1005][1005];
  11. bool visited[1005][1005];
  12. int n, m;
  13. void bfs(int i, int j)
  14. {
  15.     queue<pair<string, pair<ll, pair<ll, ll>>>> urutan;
  16.     string cadangan = "";
  17.     urutan.push({cadangan, {0, {i, j}}});
  18.     while (!urutan.empty())
  19.     {
  20.         ll letaki = urutan.front().second.second.first;
  21.         ll letakj = urutan.front().second.second.second;
  22.         ll jarak = urutan.front().second.first;
  23.         string path = urutan.front().first;
  24.         visited[letaki][letakj] = true;
  25.  
  26.         if (arr[letaki][letakj] == 2)
  27.         {
  28.             cout << "YES" << endl;
  29.             cout << jarak << endl;
  30.             cout << path << endl;
  31.             exit(0);
  32.         }
  33.         urutan.pop();
  34.         if (letaki + 1 < n && arr[letaki + 1][letakj] > 0 && !visited[letaki + 1][letakj])
  35.         {
  36.             string pathN = path + "D";
  37.             urutan.push({pathN, {jarak + 1, {letaki + 1, letakj}}});
  38.         }
  39.         if (letaki - 1 >= 0 && arr[letaki - 1][letakj] > 0 && !visited[letaki - 1][letakj])
  40.         {
  41.             string pathN = path + "U";
  42.             urutan.push({pathN, {jarak + 1, {letaki - 1, letakj}}});
  43.         }
  44.         if (letakj + 1 < m && arr[letaki][letakj + 1] > 0 && !visited[letaki][letakj + 1])
  45.         {
  46.             string pathN = path + "R";
  47.             urutan.push({pathN, {jarak + 1, {letaki, letakj + 1}}});
  48.         }
  49.         if (letakj - 1 >= 0 && arr[letaki][letakj - 1] > 0 && !visited[letaki][letakj - 1])
  50.         {
  51.             string pathN = path + "L";
  52.             urutan.push({pathN, {jarak + 1, {letaki, letakj - 1}}});
  53.         }
  54.     }
  55.     cout << "NO" << endl;
  56.     exit(0);
  57. }
  58.  
  59. int main()
  60. {
  61.     mogaAc;
  62.     cin.tie(NULL);
  63.     cout.tie(NULL);
  64.  
  65.     cin >> n >> m;
  66.  
  67.     int Awali = 0;
  68.     int Awalj = 0;
  69.     for (int i = 0; i < n; i++)
  70.     {
  71.         for (int j = 0; j < m; j++)
  72.         {
  73.             char a;
  74.             cin >> a;
  75.             if (a == '.')
  76.             {
  77.                 arr[i][j] = 1;
  78.             }
  79.             if (a == 'A')
  80.             {
  81.                 arr[i][j] = 1;
  82.                 Awali = i;
  83.                 Awalj = j;
  84.             }
  85.             if (a == 'B')
  86.             {
  87.                 arr[i][j] = 2;
  88.             }
  89.         }
  90.     }
  91.     bfs(Awali, Awalj);
  92.     return 0;
  93. }
  94. // int main()
  95. // {
  96. //     vector<int> a;
  97. //     a.pb(4);
  98. //     a.pb(5);
  99. //     a.pb(8);
  100. //     a.pb(7);
  101. //     vector<int> b;
  102. //     b = a;
  103. //     for (int i = 0; i < b.size(); i++)
  104. //     {
  105. //         cout << b[i] << endl;
  106. //     }
  107. // }
  108.  
  109. // arrayy------------------------------------------------------
  110. //  buat ngecek array 1 apakah sama dengan array 2:
  111. //   bool sama = equal(arr, arr + size, arr1);
  112. //   buat ngecek besar dari array:
  113. //   int size = sizeof(arr) / sizeof(arr[0]);
  114. // indexke LowerBound/upperbound
  115. // auto it = upper_bound(arr.begin(), arr.end(), x);
  116. // int index = distance(arr.begin(), it);
  117. // cara cepet buat sorting-------------------------------------
  118. // dari kecil ke besar : sort(arr.begin(), arr.end());
  119. // dari besar ke kecil : sort(arr.begin(), arr.end(), greater<int>());
  120. // logaritma
  121. // anggap a=base, b=yang ingin di log, seperti logA (B)
  122. // rumus : log(b)/log(a)
  123. // Statitiska
  124. // menghitung rata rata data tambahan baru
  125. // R0 * (S0/S1) + (Data baru)/S1
  126. // R = Rata rata
  127. // S = Banyak data
  128. // 0 = yang lama
  129. // 1 = yang baru
  130. // ArrayGACORBINSERT (KALAU ELEMENTNYA CUMA 1)
  131. // set atau map
Success #stdin #stdout 0s 5308KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
NO
https://ideone.com/TJsbu0
language:
C++ (gcc 8.3)
created:
21 days 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!