제출 #1166867

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1166867		Muhammet	로봇 (APIO13_robots)	C++20	100 / 100	471 ms	113476 KiB

robots

#include "bits/stdc++.h"

using namespace std;

#define ff first
#define ss second
#define ll long long
#define SZ(s) (int)s.size()

const int N = 505;

char a[N][N];

int mp[N][N], n, w, h, ind[10], nd, dpfn[10][10][N*N];

pair <int, int> dp[N][N][4];

vector <vector <int>> v;

pair <int, int> f(int i, int j, int x) {
    if(dp[i][j][x] != pair <int, int> {0, 0}) return dp[i][j][x];
    int x1 = (x % 2 ? 0 : (!x ? -1 : 1)), y1 = (!(x % 2) ? 0 : (x == 1 ? 1 : -1));
    if(a[i + x1][j + y1] != 'x' and i + x1 <= h and i + x1 > 0 and j + y1 <= w and j + y1 > 0) {
        int xx = x, i1 = i, j1 = j;
        i += x1, j += y1;
        if(a[i][j] == 'C') {
            x++;
            if(x == 4) x = 0;
        }
        if(a[i][j] == 'A') {
            x--;
            if(x == -1) x = 3;
        }
        return dp[i1][j1][xx] = f(i, j, x);
    }
    return dp[i][j][x] = pair <int, int> {i, j};
}

void fn(int a, int b) {
    vector <pair <int, int>> q;
    for(int k = a; k < b; k++) {
        for(int node = 1; node <= nd; node++) {
            dpfn[a][b][node] = min(dpfn[a][b][node], dpfn[a][k][node] + dpfn[k+1][b][node]);
        }
    }
    for(int node = 1; node <= nd; node++) {
        if(dpfn[a][b][node] != 1e9) {
            q.push_back({dpfn[a][b][node], node});
        }
    }
    sort(q.rbegin(), q.rend());
    queue <pair <int, int>> q1;
    while(!q.empty() or !q1.empty()) {
        bool tr = 0;
        if(q.empty()) tr = 1;
        else if(!q1.empty() and q1.front().ff < q.back().ff) tr = 1;
        auto [c, x] = (tr ? q1.front() : q.back());
        if(tr) q1.pop();
        else q.pop_back();
        for(auto i : v[x]) {
            if(dpfn[a][b][i] > c + 1) {
                dpfn[a][b][i] = c + 1;
                q1.push({c + 1, i});
            }
        }
    }
}

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);

    cin >> n >> w >> h;

    for(int i = 1; i <= h; i++) {
        for(int j = 1; j <= w; j++) {
            cin >> a[i][j];
            mp[i][j] = ++nd;
            if(a[i][j] >= '1' and a[i][j] <= '9') ind[a[i][j] - '0'] = nd;
        }
    }

    for(int i = 1; i <= n; i++) {
        for(int i1 = 1; i1 <= n; i1++) {
            for(int i2 = 1; i2 <= nd; i2++) {
                dpfn[i][i1][i2] = 1e9;
            }
        }
    }

    v.resize(nd+1);
    for(int i = 1; i <= h; i++) {
        for(int j = 1; j <= w; j++) {
            for(int k = 0; k < 4; k++) {
                pair <int, int> ind = f(i, j, k);
                if(ind != pair <int, int> {i, j}) v[mp[i][j]].push_back(mp[ind.ff][ind.ss]);
            }
        }
    }

    queue <int> q;
    vector <vector <int>> dis(n+1, vector <int> (nd + 1, 1e9));
    for(int i = 1; i <= n; i++) {
        dis[i][ind[i]] = 0;
        dpfn[i][i][ind[i]] = 0;
        q.push(ind[i]);
        while(!q.empty()) {
            int x = q.front();
            q.pop();
            for(auto j : v[x]) {
                if(dis[i][j] == 1e9) {
                    dis[i][j] = dis[i][x] + 1;
                    dpfn[i][i][j] = dis[i][j];
                    q.push(j);
                }
            }
        }
    }

    for(int i = 0; i < n; i++) {
        for(int a = 1; a + i <= n; a++) {
            fn(a, a + i);
        }
    }

    int ans = 1e9;

    for(int i = 1; i <= nd; i++) {
        ans = min(ans, dpfn[1][n][i]);
        // cout << dpfn[1][n][i] << '\n';
    }

    cout << (ans == 1e9 ? -1 : ans);

    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 30 / 30
• Subtask 4: 40 / 40