제출 #1293563

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1293563		nasjes	Maze (JOI23_ho_t3)	C++20	0 / 100	2095 ms	6860 KiB

Main

#include <array>
#include <climits>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int R, C, K, Sr, Sc, Gr, Gc;
    cin >> R >> C >> K >> Sr >> Sc >> Gr >> Gc;
    K = 1 - K; Sr--; Sc--; Gr--; Gc--;
    vector<string> A(R);
    for(string& a : A) {
        cin >> a;
        for(char& c : a) c = c == '#';
    }

 
    vector cost(R, vector(C, array{INT_MAX, 0, 0}));
    vector<pair<int, int>> q1, q2;
    auto push = [&](vector<pair<int, int>>& q, int r, int c, int x, int y, int z) -> void {
        if(r < 0 || r >= R || c < 0 || c >= C) return;
        if(cost[r][c][0] == x) return;
        cost[r][c] = {x, y, z};
        q.emplace_back(r, c);
    };
    auto push2 = [&](int r, int c, int x) -> void {
        if(r < 0 || r >= R || c < 0 || c >= C) return;
        if(A[r][c]) push(q2, r, c, x + 1, K, K);
        else push(q1, r, c, x, 0, 0);
    };
    push(q1, Sr, Sc, 0, 0, 0);

    while(q1.size()) {

        for(int i = 0; i < q1.size(); i++) {
            const auto [r, c] = q1[i];
            const auto [x, y, z] = cost[r][c];
            if(z == 0) continue;
            push(q1, r, c - 1, x, y, z + 1);
            push(q1, r, c + 1, x, y, z + 1);
        }
  
        for(int i = 0; i < q1.size(); i++) {
            const auto [r, c] = q1[i];
            const auto [x, y, z] = cost[r][c];
            if(y == 0) continue;
            push(q1, r - 1, c, x, y + 1, z);
            push(q1, r + 1, c, x, y + 1, z);
        }
      
        for(int i = 0; i < q1.size(); i++) {
            const auto [r, c] = q1[i];
            const auto [x, y, z] = cost[r][c];
            if(y!=0 || z!=0)continue;
            push2(r - 1, c, x);
            push2(r + 1, c, x);
            push2(r, c - 1, x);
            push2(r, c + 1, x);
        }
        swap(q1, q2);
        q2.clear();
    }

    cout << cost[Gr][Gc][0] << endl;
}

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