Submission #217975

# Submission time Handle Problem Language Result Execution time Memory
217975 2020-03-31T11:28:11 Z SamAnd Robots (APIO13_robots) C++17
30 / 100
241 ms 163840 KB
#include <bits/stdc++.h>
using namespace std;
const int N = 503, K = 11, INF = 1000000009;
const int xx[4] = {-1, 0, 1, 0};
const int yy[4] = {0, 1, 0, -1};
struct ban
{
    int x, y;
    ban(){}
    ban(int x, int y)
    {
        this->x = x;
        this->y = y;
    }
};

int n, m, k;
char a[N][N];
int sx[K], sy[K];

int c[N][N][4];
ban u[N][N][4];
void dfs(int x, int y, int z)
{
    c[x][y][z] = 1;
    int hx = x + xx[z];
    int hy = y + yy[z];
    int hz = z;
    if (!(hx >= 1 && hx <= n && hy >= 1 && hy <= m) || a[hx][hy] == 'x')
    {
        hx = x;
        hy = y;
    }
    else if (a[hx][hy] == 'C')
        hz = (z + 1) % 4;
    else if (a[hx][hy] == 'A')
        hz = (z - 1 + 4) % 4;
    if (hx == x && hy == y)
    {
        u[x][y][z] = ban(x, y);
        c[x][y][z] = 2;
        return;
    }
    if (!c[hx][hy][hz])
    {
        dfs(hx, hy, hz);
        u[x][y][z] = u[hx][hy][hz];
        c[x][y][z] = 2;
        return;
    }
    if (c[hx][hy][hz] == 2)
    {
        u[x][y][z] = u[hx][hy][hz];
        c[x][y][z] = 2;
        return;
    }
    u[x][y][z] = ban(-1, -1);
    c[x][y][z] = 2;
    return;
}

int dp[K][K][N][N];

bool cc[N][N];
queue<ban> q[N * 5];

int main()
{
    scanf("%d%d%d", &k, &m, &n);
    for (int i = 1; i <= n; ++i)
        scanf(" %s", (a[i] + 1));
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= m; ++j)
        {
            if ('1' <= a[i][j] && a[i][j] <= '9')
            {
                sx[a[i][j] - '0'] = i;
                sy[a[i][j] - '0'] = j;
                a[i][j] = '.';
            }
        }
    }
    for (int i0 = 0; i0 < K; ++i0)
        for (int i1 = 0; i1 < K; ++i1)
            for (int i2 = 0; i2 < N; ++i2)
                for (int i3 = 0; i3 < N; ++i3)
                    dp[i0][i1][i2][i3] = INF;
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= m; ++j)
        {
            for (int k = 0; k < 4; ++k)
            {
                if (!c[i][j][k])
                {
                    dfs(i, j, k);
                }
            }
        }
    }
    for (int d = 1; d <= k; ++d)
    {
        for (int l = 1; l <= k - d + 1; ++l)
        {
            int r = l + d - 1;
            if (l == r)
                dp[l][r][sx[l]][sy[l]] = 0;
            for (int i = 1; i <= n; ++i)
            {
                for (int j = 1; j <= m; ++j)
                {
                    for (int m = l; m < r; ++m)
                        dp[l][r][i][j] = min(dp[l][r][i][j], dp[l][m][i][j] + dp[m + 1][r][i][j]);
                }
            }
            memset(cc, false, sizeof cc);
            for (int i = 1; i <= n; ++i)
            {
                for (int j = 1; j <= m; ++j)
                {
                    if (dp[l][r][i][j] != INF)
                        q[dp[l][r][i][j]].push(ban(i, j));
                }
            }
            for (int ii = 0; ii < N * 5; ++ii)
            {
                while (!q[ii].empty())
                {
                    ban t = q[ii].front();
                    q[ii].pop();
                    if (cc[t.x][t.y])
                        continue;
                    cc[t.x][t.y] = true;
                    for (int i = 0; i < 4; ++i)
                    {
                        ban h = u[t.x][t.y][i];
                        if (h.x == -1)
                            continue;
                        if (dp[l][r][t.x][t.y] + 1 < dp[l][r][h.x][h.y])
                        {
                            dp[l][r][h.x][h.y] = dp[l][r][t.x][t.y] + 1;
                            q[dp[l][r][h.x][h.y]].push(h);
                        }
                    }
                }
            }
        }
    }
    int ans = INF;
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= m; ++j)
        {
            ans = min(ans, dp[1][k][i][j]);
        }
    }
    if (ans == INF)
        printf("-1\n");
    else
        printf("%d\n", ans);
    return 0;
}

Compilation message

robots.cpp: In function 'int main()':
robots.cpp:69:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d", &k, &m, &n);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
robots.cpp:71:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf(" %s", (a[i] + 1));
         ~~~~~^~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 72 ms 122104 KB Output is correct
2 Correct 73 ms 122104 KB Output is correct
3 Correct 73 ms 122104 KB Output is correct
4 Correct 73 ms 122232 KB Output is correct
5 Correct 73 ms 122360 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 72 ms 122104 KB Output is correct
2 Correct 73 ms 122104 KB Output is correct
3 Correct 73 ms 122104 KB Output is correct
4 Correct 73 ms 122232 KB Output is correct
5 Correct 73 ms 122360 KB Output is correct
6 Correct 75 ms 122104 KB Output is correct
7 Correct 72 ms 122104 KB Output is correct
8 Correct 73 ms 122104 KB Output is correct
9 Correct 73 ms 122104 KB Output is correct
10 Correct 76 ms 122232 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 72 ms 122104 KB Output is correct
2 Correct 73 ms 122104 KB Output is correct
3 Correct 73 ms 122104 KB Output is correct
4 Correct 73 ms 122232 KB Output is correct
5 Correct 73 ms 122360 KB Output is correct
6 Correct 75 ms 122104 KB Output is correct
7 Correct 72 ms 122104 KB Output is correct
8 Correct 73 ms 122104 KB Output is correct
9 Correct 73 ms 122104 KB Output is correct
10 Correct 76 ms 122232 KB Output is correct
11 Runtime error 241 ms 163840 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 72 ms 122104 KB Output is correct
2 Correct 73 ms 122104 KB Output is correct
3 Correct 73 ms 122104 KB Output is correct
4 Correct 73 ms 122232 KB Output is correct
5 Correct 73 ms 122360 KB Output is correct
6 Correct 75 ms 122104 KB Output is correct
7 Correct 72 ms 122104 KB Output is correct
8 Correct 73 ms 122104 KB Output is correct
9 Correct 73 ms 122104 KB Output is correct
10 Correct 76 ms 122232 KB Output is correct
11 Runtime error 241 ms 163840 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Halted 0 ms 0 KB -