oj.uz

Submission #207650

# Submission time Handle Problem Language Result Execution time Memory
207650 2020-03-08T09:18:43 Z PeppaPig Robots (APIO13_robots) C++14
30 / 100
 91 ms 97912 KB 
#include <bits/stdc++.h>

#define pii pair<int, int>
#define x first
#define y second

using namespace std;

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

struct item {
    int r, c, id;
    item(int r, int c, int id) : r(r), c(c), id(id) {}
};

int n, w, h, mp[10][10], dp[40][N][N];
char A[N][N];
pii nex[N][N][4];

pii find_next(int r, int c, int dir) {
    if(nex[r][c][dir] == pii(-1, -1) && A[r][c] != 'x') {
        int ndir = dir;
        if(A[r][c] == 'C') ndir = (dir + 1) % 4;
        if(A[r][c] == 'A') ndir = (dir + 3) % 4;
        int nr = r + dx[ndir], nc = c + dy[ndir];
        if(nr < 1 || nr > h || nc < 1 || nc > w || A[nr][nc] == 'x')
            nex[r][c][dir] = pii(r, c);
        else nex[r][c][dir] = find_next(nr, nc, ndir);
    }
    return nex[r][c][dir];
}

int main() {
    fill_n(nex[0][0], N * N * 4, pii(-1, -1));
    fill_n(dp[0][0], 40 * N * N, 1e9);

    scanf("%d %d %d", &n, &w, &h);
    for(int i = 1; i <= h; i++) scanf(" %s", A[i] + 1);

    for(int i = 1; i <= h; i++) 
        for(int j = 1; j <= w; j++)
            for(int k = 0; k < 4; k++)
                find_next(i, j, k);
    for(int i = 1, ptr = 0; i <= n; i++) for(int j = i; j <= n; j++)
        mp[i][j] = ++ptr;

    for(int k = 1; k <= n; k++) {
        queue<item> Q;
        for(int i = 1; i <= h; i++) for(int j = 1; j <= w; j++) {
            if(A[i][j] == 'x') continue;
            if(k == 1) {
                if('1' <= A[i][j] && A[i][j] <= '9') {
                    int now = mp[A[i][j] - '0'][A[i][j] - '0'];
                    Q.emplace(i, j, now);
                    dp[now][i][j] = 0;
                }
            } else {
                for(int x = 1, y = k; y <= n; x++, y++) {
                    int now = mp[x][y];
                    for(int l = x; l < y; l++) {
                        int L = mp[x][l], R = mp[l + 1][y];
                        dp[now][i][j] = min(dp[now][i][j], dp[L][i][j] + dp[R][i][j]);
                    }
                    Q.emplace(i, j, now);
                }
            }
        }
        while(!Q.empty()) {
            item u = Q.front(); Q.pop();
            for(int i = 0; i < 4; i++) {
                int nr = u.r + dx[i], nc = u.c + dy[i];
                if(nr < 1 || nr > h || nc < 1 || nc > w || A[nr][nc] == 'x')
                    continue;
                pii v = nex[nr][nc][i];
                if(dp[u.id][u.r][u.c] + 1 < dp[u.id][v.x][v.y]) {
                    dp[u.id][v.x][v.y] = dp[u.id][u.r][u.c] + 1;
                    Q.emplace(v.x, v.y, u.id);
                }
            }
        }
    }
    int ans = 1e9;
    for(int i = 1; i <= h; i++) for(int j = 1; j <= w; j++)
        ans = min(ans, dp[mp[1][n]][i][j]); 
    if(ans != 1e9) printf("%d\n", ans);
    else printf("-1\n");

    return 0;
}

Compilation message

robots.cpp: In function 'int main()':
robots.cpp:39:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d", &n, &w, &h);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
robots.cpp:40:38: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 1; i <= h; i++) scanf(" %s", A[i] + 1);
                                 ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 48248 KB Output is correct
2 Correct 31 ms 48248 KB Output is correct
3 Correct 32 ms 48248 KB Output is correct
4 Correct 31 ms 48248 KB Output is correct
5 Correct 31 ms 48248 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 48248 KB Output is correct
2 Correct 31 ms 48248 KB Output is correct
3 Correct 32 ms 48248 KB Output is correct
4 Correct 31 ms 48248 KB Output is correct
5 Correct 31 ms 48248 KB Output is correct
6 Correct 34 ms 48248 KB Output is correct
7 Correct 32 ms 48248 KB Output is correct
8 Correct 34 ms 48376 KB Output is correct
9 Correct 32 ms 48248 KB Output is correct
10 Correct 33 ms 48248 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 48248 KB Output is correct
2 Correct 31 ms 48248 KB Output is correct
3 Correct 32 ms 48248 KB Output is correct
4 Correct 31 ms 48248 KB Output is correct
5 Correct 31 ms 48248 KB Output is correct
6 Correct 34 ms 48248 KB Output is correct
7 Correct 32 ms 48248 KB Output is correct
8 Correct 34 ms 48376 KB Output is correct
9 Correct 32 ms 48248 KB Output is correct
10 Correct 33 ms 48248 KB Output is correct
11 Runtime error 91 ms 97912 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 48248 KB Output is correct
2 Correct 31 ms 48248 KB Output is correct
3 Correct 32 ms 48248 KB Output is correct
4 Correct 31 ms 48248 KB Output is correct
5 Correct 31 ms 48248 KB Output is correct
6 Correct 34 ms 48248 KB Output is correct
7 Correct 32 ms 48248 KB Output is correct
8 Correct 34 ms 48376 KB Output is correct
9 Correct 32 ms 48248 KB Output is correct
10 Correct 33 ms 48248 KB Output is correct
11 Runtime error 91 ms 97912 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Halted 0 ms 0 KB -