oj.uz

답안 #968227

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
968227 2024-04-23T08:35:14 Z ShauryaTheShep 로봇 (APIO13_robots) C++14
0 / 100
 1 ms 348 KB 
#include <iostream>
#include <queue>
#include <vector>
#include <tuple>
#include <set>
using namespace std;

const int MAX_W = 10;
const int MAX_H = 10;

char grid[MAX_H][MAX_W];
int w, h;

bool is_inside(int x, int y) {
    return x >= 0 && x < h && y >= 0 && y < w;
}

vector<pair<int, int>> get_moves(int x, int y) {
    vector<pair<int, int>> positions;
    // Directions: Up, Down, Left, Right
    int dx[4] = {-1, 1, 0, 0};
    int dy[4] = {0, 0, -1, 1};
    for (int d = 0; d < 4; ++d) {
        int nx = x, ny = y;
        while (is_inside(nx + dx[d], ny + dy[d]) && grid[nx + dx[d]][ny + dy[d]] != 'x') {
            nx += dx[d];
            ny += dy[d];
        }
        positions.push_back({nx, ny});
    }
    return positions;
}

int bfs(pair<int, int> robot1, pair<int, int> robot2) {
    queue<tuple<pair<int, int>, pair<int, int>, int>> q;
    set<pair<pair<int, int>, pair<int, int>>> visited;
    q.push(make_tuple(robot1, robot2, 0));
    visited.insert(make_pair(robot1, robot2));

    while (!q.empty()) {
        auto current = q.front(); q.pop();
        auto r1 = get<0>(current);
        auto r2 = get<1>(current);
        int moves = get<2>(current);

        if (r1 == r2) return moves;

        auto moves_r1 = get_moves(r1.first, r1.second);
        auto moves_r2 = get_moves(r2.first, r2.second);

        for (auto& nr1 : moves_r1) {
            if (visited.insert(make_pair(nr1, r2)).second) {
                q.push(make_tuple(nr1, r2, moves + 1));
            }
        }

        for (auto& nr2 : moves_r2) {
            if (visited.insert(make_pair(r1, nr2)).second) {
                q.push(make_tuple(r1, nr2, moves + 1));
            }
        }
    }
    return -1; // If no solution is possible
}

int main() {
    cin >> w >> h;
    pair<int, int> robot1, robot2;
    bool first_robot_found = false;

    for (int i = 0; i < h; ++i) {
        for (int j = 0; j < w; ++j) {
            cin >> grid[i][j];
            if (isdigit(grid[i][j])) {
                if (!first_robot_found) {
                    robot1 = {i, j};
                    first_robot_found = true;
                } else {
                    robot2 = {i, j};
                }
            }
        }
    }

    cout << bfs(robot1, robot2) << endl;
    return 0;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -