Submission #61379139

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,sse4.2,popcnt,lzcnt")
*/
#include <bits/stdc++.h>
#define taskname ""
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define i64 long long
#define isz(x) (int)x.size()
using namespace std;
void solve() {
    int n, m;
    cin >> n >> m;
    array<int, 2> st, en;
    vector<vector<char>> a(n, vector<char>(m));
    for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) {
        cin >> a[i][j];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,sse4.2,popcnt,lzcnt")
*/

#include <bits/stdc++.h>
#define taskname ""
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define i64 long long
#define isz(x) (int)x.size()
using namespace std;

void solve() {
    int n, m;
    cin >> n >> m;

    array<int, 2> st, en;
    vector<vector<char>> a(n, vector<char>(m));
    for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) {
        cin >> a[i][j];
        if (a[i][j] == 'S') {
            st = {i, j};
        }
        if (a[i][j] == 'G') {
            en = {i, j};
        }
    }

    auto check = [&](int x, int y) -> bool {
        return 0 <= x and x < n and 0 <= y and y < m and a[x][y] != '#';
    };

    queue<array<int, 4>> q;
    vector dis(n, vector(m, vector(2, -1)));
    q.push({st[0], st[1], -1, 0});
    while (not q.empty()) {
        auto [x, y, z, d] = q.front();
        if (en[0] == x and en[1] == y) {
            cout << d << endl;
            return;
        }
        q.pop();
        if (z != 0) {
            if (check(x - 1, y) and dis[x - 1][y][0] == -1) {
                dis[x - 1][y][0] = d + 1;
                q.push({x - 1, y, 0, d + 1});
            }
            if (check(x + 1, y) and dis[x + 1][y][0] == -1) {
                dis[x + 1][y][0] = d + 1;
                q.push({x + 1, y, 0, d + 1});
            }
        }
        if (z != 1) {
            if (check(x, y - 1) and dis[x][y - 1][1] == -1) {
                dis[x][y - 1][1] = d + 1;
                q.push({x, y - 1, 1, d + 1});
            }
            if (check(x, y + 1) and dis[x][y + 1][1] == -1) {
                dis[x][y + 1][1] = d + 1;
                q.push({x, y + 1, 1, d + 1});
            }
        }
    }
    cout << -1 << endl;
}

signed main() {

#ifndef CDuongg
    if (fopen(taskname".inp", "r"))
        assert(freopen(taskname".inp", "r", stdin)), assert(freopen(taskname".out", "w", stdout));
#else
    freopen("bai3.inp", "r", stdin);
    freopen("bai3.out", "w", stdout);
    auto start = chrono::high_resolution_clock::now();
#endif

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1; //cin >> t;
    while(t--) solve();

#ifdef CDuongg
   auto end = chrono::high_resolution_clock::now();
   cout << "\n"; for(int i = 1; i <= 100; ++i) cout << '=';
   cout << "\nExecution time: " << chrono::duration_cast<chrono::milliseconds> (end - start).count() << "[ms]" << endl;
#endif

}

Submission Info

Compile Error

Main.cpp: In function ‘void solve()’:
Main.cpp:36:11: warning: ‘st.std::array<int, 2>::_M_elems[1]’ may be used uninitialized [-Wmaybe-uninitialized]
   36 |     q.push({st[0], st[1], -1, 0});
      |     ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:18:19: note: ‘st.std::array<int, 2>::_M_elems[1]’ was declared here
   18 |     array<int, 2> st, en;
      |                   ^~
Main.cpp:39:24: warning: ‘en.std::array<int, 2>::_M_elems[1]’ may be used uninitialized [-Wmaybe-uninitialized]
   39 |         if (en[0] == x and en[1] == y) {
Main.cpp:18:23: note: ‘en.std::array<int, 2>::_M_elems[1]’ was declared here
   18 |     array<int, 2> st, en;
      |                       ^~
Main.cpp:36:11: warning: ‘st.std::array<int, 2>::_M_elems[0]’ may be used uninitialized [-Wmaybe-uninitialized]
   36 |     q.push({st[0], st[1], -1, 0});
      |     ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:18:19: note: ‘st.std::array<int, 2>::_M_elems[0]’ was declared here
   18 |     array<int, 2> st, en;
      |                   ^~
Main.cpp:39:24: warning: ‘en.std::array<int, 2>::_M_elems[0]’ may be used uninitialized [-Wmaybe-uninitialized]
   39 |         if (en[0] == x and en[1] == y) {
Main.cpp:18:23: note: ‘en.std::array<int, 2>::_M_elems[0]’ was declared here
   18 |     array<int, 2> st, en;
      |                       ^~

Judge Result