제출 #737061

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
737061		nguyentunglam	Maze (JOI23_ho_t3)	C++17	51 / 100	2041 ms	42832 KiB

Main

#include<bits/stdc++.h>
#define fi first
#define se second
#define endl "\n"
#define ii pair<int, int>
using namespace std;
vector<vector<int> > a, f;
int mx[4] = {0, 0, -1, 1};
int my[4] = {1, -1, 0, 0};
int main() {
    #define task ""
    cin.tie(0) -> sync_with_stdio(0);
    if (fopen ("task.inp", "r")) {
        freopen ("task.inp", "r", stdin);
        freopen ("task.out", "w", stdout);
    }
    if (fopen (task".inp", "r")) {
        freopen (task".inp", "r", stdin);
        freopen (task".out", "w", stdout);
    }
    int r, c, n; cin >> r >> c >> n;
    a = vector<vector<int> > (r + 2, vector<int> (c + 2));
    f = vector<vector<int> > (r + 2, vector<int> (c + 2));

    int sr, sc, gr, gc; cin >> sr >> sc >> gr >> gc;
    for(int i = 1; i <= r; i++) for(int j = 1; j <= c; j++) {
        char c; cin >> c;
        if (c == '.') a[i][j] = 0;
        else a[i][j] = 1;
        f[i][j] = 1e9;
    }
    deque<tuple<int, int, int> > q;
    f[sr][sc] = 0;
    q.push_back({0, sr, sc});
    while (!q.empty()) {
        int cost, x, y; tie(cost, x, y) = q.front(); q.pop_front();
        if (cost != f[x][y]) continue;
        int d1 = abs(gr - x), d2 = abs(gc - y);
        if (d1 > d2) swap(d1, d2);
        if (d1 < n && d2 <= n && f[gr][gc] > f[x][y] + 1) {
            f[gr][gc] = f[x][y] + 1;
            q.push_back({f[gr][gc], gr, gc});
        }
        for(int k = 0; k < 4; k++) {
            int xx = x + mx[k], yy = y + my[k];
            if (xx < 1 || xx > r || yy < 1 || yy > c || a[xx][yy]) continue;
            if (f[xx][yy] > f[x][y]) {
                f[xx][yy] = f[x][y];
                q.push_front({f[xx][yy], xx, yy});
            }
        }

        for(int j = max(1, y - n + 1); j <= min(c, y + n - 1); j++) {
            if (x > n) {
                int i = x - n;
                if (f[i][j] > f[x][y] + 1) {
                    f[i][j] = f[x][y] + 1;
                    q.push_back({f[i][j], i, j});
                }
            }
            if (x + n <= r) {
                int i = x + n;
                if (f[i][j] > f[x][y] + 1) {
                    f[i][j] = f[x][y] + 1;
                    q.push_back({f[i][j], i, j});
                }
            }
        }

        for(int i = max(1, x - n + 1); i <= min(r, x + n - 1); i++) {
            if (y > n) {
                int j = y - n;
                if (f[i][j] > f[x][y] + 1) {
                    f[i][j] = f[x][y] + 1;
                    q.push_back({f[i][j], i, j});
                }
            }
            if (y + n <= c) {
                int j = y + n;
                if (f[i][j] > f[x][y] + 1) {
                    f[i][j] = f[x][y] + 1;
                    q.push_back({f[i][j], i, j});
                }
            }
        }
    }
    cout << f[gr][gc];
}

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp: In function 'int main()':
Main.cpp:14:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |         freopen ("task.inp", "r", stdin);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:15:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |         freopen ("task.out", "w", stdout);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:18:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |         freopen (task".inp", "r", stdin);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:19:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |         freopen (task".out", "w", stdout);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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