Submission #874555

#	Time	Username	Problem	Language	Result	Execution time	Memory
874555		efedmrlr	Maze (JOI23_ho_t3)	C++17	100 / 100	950 ms	120700 KiB

Main

#include <bits/stdc++.h>

using namespace std;

#define n_l '\n'
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); } 
#define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl


#define lli long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}


const double EPS = 0.00001;
const int INF = 1e9+500;
const int N = 2e5+5;
const int ALPH = 26;
const int LGN = 25;
const int MOD = 1e9+7;
int n,m,q;
int r,c;
//X for rows Y for columns
vector<vector<bool> > grid;
struct Point {  
    int x,y;
    Point(int x, int y) {
        this->x = x;
        this->y = y;
    }
    Point() {
        x = 0;
        y = 0;
    }
    Point(array<int,2> tmp) {
        x = tmp[0]; y = tmp[1];
    }
    vector<Point> adj() {
        vector<Point> ret;
        if(x > 1) ret.pb(Point(x - 1, y));
        if(y > 1) ret.pb(Point(x, y - 1));
        if(x < r) ret.pb(Point(x + 1, y));
        if(y < c) ret.pb(Point(x, y + 1));
        return ret;
    }
    vector<Point> adj_diag() {
        vector<Point> ret = adj();
        if(x > 1) {
            if(y > 1) ret.pb(Point(x - 1, y - 1));
            if(y < c) ret.pb(Point(x - 1, y + 1));
        }
        if(x < r) {
            if(y > 1) ret.pb(Point(x + 1, y - 1));
            if(y < c) ret.pb(Point(x + 1, y + 1));
        }
        return ret;
    }
    
};

Point s,g;
vector<vector<int> > dsts;
void bfs() {
    queue<Point> que1, que2;
    int dist = 0;
    int rdist = 0;
    que1.push(s);
    dsts[s.x][s.y] = 0;
    que2.push(Point(-1, -1));
    while(que1.size() || que2.size() > 1) {
        while(que1.size()) {
            auto cur = que1.front();
            que1.pop();
            auto adj = cur.adj();
            for(auto c : adj) {
                if(grid[c.x][c.y]) {
                    if(dsts[c.x][c.y] == INF) {
                        que1.push(c);
                        dsts[c.x][c.y] = dsts[cur.x][cur.y];
                    }
                }
                else {
                    if(dsts[c.x][c.y] == INF) {
                        que2.push(c);
                        dsts[c.x][c.y] = dsts[cur.x][cur.y] + 1;
                    }
                }

            }
        }
        while(que2.size() > 1) {
            if(dist == n) {
                while(que2.size()) {
                    if(que2.front().x != -1) {
                        que1.push(que2.front());
                    }
                    que2.pop();
                }
                que2.push(Point(-1,-1));
                dist = 0;
                break;
            }
            auto cur = que2.front();
            que2.pop();
            if(cur.x == -1) {
                dist++;
                que2.push(Point(-1,-1));
                continue;
            }
            auto adj = cur.adj_diag();
            for(auto c : adj) {
                if(dsts[c.x][c.y] == INF) {
                    dsts[c.x][c.y] = dsts[cur.x][cur.y];
                    que2.push(c);
                }
            }

        }
    }
}

inline void solve() {
    cin>>r>>c>>n;
    cin>>s.x>>s.y;
    cin>>g.x>>g.y;
    grid.assign(r + 3, vector<bool>(c + 3, 0));
    dsts.assign(r + 3, vector<int>(c + 3, INF));
    for(int i = 1; i<=r; i++) {
        for(int j = 1; j<=c; j++) {
            char tmp;
            cin>>tmp;
            if(tmp == '.') grid[i][j] = 1;
            else grid[i][j] = 0;

        }
    }
    bfs();
    cout<<dsts[g.x][g.y]<<"\n";
}
 
signed main() {
    //fastio();
    int test = 1;
    //cin>>test;
    while(test--) {
        solve();
    }
    
}

Compilation message (stderr)

Main.cpp: In function 'std::string to_string(std::string, int, int)':
Main.cpp:7:208: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); }
      |                                                                                                                                                                                                             ~~~^~~~~~~~~~
Main.cpp: In function 'void bfs()':
Main.cpp:73:9: warning: unused variable 'rdist' [-Wunused-variable]
   73 |     int rdist = 0;
      |         ^~~~~

• Subtask 1: 8 / 8
• Subtask 2: 19 / 19
• Subtask 3: 16 / 16
• Subtask 4: 19 / 19
• Subtask 5: 5 / 5
• Subtask 6: 19 / 19
• Subtask 7: 8 / 8
• Subtask 8: 6 / 6