제출 #251434

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
251434		Vladikus004	Portal (COCI17_portal)	C++14	120 / 120	77 ms	1912 KiB

portal

#include <bits/stdc++.h>
#define inf 2e9
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;

const int N = 500 + 3;
int n, m, sx, sy, fx, fy, d[N][N];
string a[N];

int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, 1, 0, -1};

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    #ifdef LOCAL
        freopen("input.txt", "r", stdin);
    #endif // LOCAL
    cin >> n >> m;
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < n; i++){
        for (int j = 0; j < m; j++){
            d[i][j] = inf;
            if (a[i][j] == 'C'){
                sx = i; sy = j;
            }
            if (a[i][j] == 'F'){
                fx = i; fy = j;
            }
        }
    }
    set <pii> q;
    d[sx][sy] = 0;
    q.insert({0, sx * m + sy});
    while (!q.empty()){
        int x = q.begin()->second / m, y = q.begin()->second % m;
        q.erase(q.begin());
        for (int i = 0; i < 4; i++){
            int X = x + dx[i], Y = y + dy[i];
            if (a[X][Y] == '#') {
                continue;
            }
            if (d[X][Y] <= d[x][y] + 1) continue;
            q.erase({d[X][Y], X * m + Y});
            d[X][Y] = d[x][y] + 1;
            q.insert({d[X][Y], X * m + Y});
        }

        int X = x, Y = y, mn = inf;
        while (a[X][Y] != '#') X++;
        mn = min(mn, abs(X - x));
        X = x; Y = y;
        while (a[X][Y] != '#') X--;
        mn = min(mn, abs(X - x));
        X = x; Y = y;
        while (a[X][Y] != '#') Y++;
        mn = min(mn, abs(Y - y));
        X = x; Y = y;
        while (a[X][Y] != '#') Y--;
        mn = min(mn, abs(Y - y));

            X = x, Y = y;
            while (a[X][Y] != '#'){
                X++;
            }
            X--;
            if (d[X][Y] > d[x][y] + mn){
                q.erase({d[X][Y], X * m + Y});
                d[X][Y] = d[x][y] + mn;
                q.insert({d[X][Y], X * m + Y});
            }
            while (a[X][Y] != '#'){
                X--;
            }
            X++;
            if (d[X][Y] > d[x][y] + mn){
                q.erase({d[X][Y], X * m + Y});
                d[X][Y] = d[x][y] + mn;
                q.insert({d[X][Y], X * m + Y});
            }
            X = x, Y = y;
            while (a[X][Y] != '#'){
                Y++;
            }
            Y--;
            if (d[X][Y] > d[x][y] + mn){
                q.erase({d[X][Y], X * m + Y});
                d[X][Y] = d[x][y] + mn;
                q.insert({d[X][Y], X * m + Y});
            }
            while (a[X][Y] != '#'){
                Y--;
            }
            Y++;
            if (d[X][Y] > d[x][y] + mn){
                q.erase({d[X][Y], X * m + Y});
                d[X][Y] = d[x][y] + mn;
                q.insert({d[X][Y], X * m + Y});
            }
    }
    if (d[fx][fy] == inf){
        cout << "nemoguce";
    }else{
        cout << d[fx][fy];
    }
}

• Subtask 1: 12 / 12
• Subtask 2: 12 / 12
• Subtask 3: 12 / 12
• Subtask 4: 12 / 12
• Subtask 5: 12 / 12
• Subtask 6: 12 / 12
• Subtask 7: 12 / 12
• Subtask 8: 12 / 12
• Subtask 9: 12 / 12
• Subtask 10: 12 / 12