提出 #73749435

---

ソースコード 拡げる

#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <tuple>

using namespace std;

const int N = 20;
const int dr[] = {-1, 0, 1, 0};
const int dc[] = {0, 1, 0, -1};
const char dir_chars[] = {'U', 'R', 'D', 'L'};

vector<string> wall_v;
vector<string> wall_h;

bool has_wall(int r, int c, int dir) {
    if (dir == 0) { if (r == 0) return true; return wall_h[r - 1][c] == '1'; }
    if (dir == 1) { if (c == N - 1) return true; return wall_v[r][c] == '1'; }
    if (dir == 2) { if (r == N - 1) return true; return wall_h[r][c] == '1'; }
    if (dir == 3) { if (c == 0) return true; return wall_v[r][c - 1] == '1'; }
    return false;
}

struct Robot {
    int m;
    int r, c;
    char d;
    vector<string> rules;
};

void print_visualizer(const vector<vector<bool>>& covered) {
    cerr << "\n=== 簡易ビジュアライザ ===\n";
    int unvisited = 0;
    for (int i = 0; i < N; ++i) {
        for (int j = 0; j < N; ++j) {
            if (covered[i][j]) cerr << "* ";
            else { cerr << ". "; unvisited++; }
        }
        cerr << "\n";
    }
    cerr << "自己回転ロボットを置いた数: " << unvisited << "\n";
    cerr << "==========================\n\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int dummy_N, AK, AM, AW;
    if (!(cin >> dummy_N >> AK >> AM >> AW)) return 0;

    wall_v.resize(N);
    for (int i = 0; i < N; ++i) cin >> wall_v[i];

    wall_h.resize(N - 1);
    for (int i = 0; i < N - 1; ++i) cin >> wall_h[i];

    vector<vector<bool>> covered(N, vector<bool>(N, false));
    vector<Robot> robots;

    // --- 1. 右手法ロボット (M=3) のシミュレーション配置 ---
    vector<string> rh_rules = {"R 1 R 1", "F 0 L 2", "F 0 L 1"};
    for (int i = 0; i < N; ++i) {
        for (int j = 0; j < N; ++j) {
            if (covered[i][j]) continue;

            int start_dir = -1;
            for (int d = 0; d < 4; ++d) if (has_wall(i, j, d)) { start_dir = d; break; }

            if (start_dir != -1) {
                map<tuple<int, int, int, int>, int> visited_states;
                vector<pair<int, int>> path;
                int curr_r = i, curr_c = j, curr_dir = start_dir, curr_state = 0, step = 0, loop_start = -1;

                while (true) {
                    auto state_key = make_tuple(curr_r, curr_c, curr_dir, curr_state);
                    if (visited_states.count(state_key)) { loop_start = visited_states[state_key]; break; }
                    visited_states[state_key] = step;
                    path.push_back({curr_r, curr_c});

                    bool wall_front = has_wall(curr_r, curr_c, curr_dir);
                    char action; int next_state;

                    if (curr_state == 0) { action = 'R'; next_state = 1; }
                    else if (curr_state == 1) {
                        if (!wall_front) { action = 'F'; next_state = 0; } else { action = 'L'; next_state = 2; }
                    } else {
                        if (!wall_front) { action = 'F'; next_state = 0; } else { action = 'L'; next_state = 1; }
                    }

                    if (action == 'F') { curr_r += dr[curr_dir]; curr_c += dc[curr_dir]; }
                    else if (action == 'R') curr_dir = (curr_dir + 1) % 4;
                    else if (action == 'L') curr_dir = (curr_dir + 3) % 4;
                    curr_state = next_state; step++;
                }

                bool covered_new = false;
                for (int s = loop_start; s < path.size(); ++s) {
                    if (!covered[path[s].first][path[s].second]) {
                        covered_new = true;
                        covered[path[s].first][path[s].second] = true;
                    }
                }
                if (covered_new) robots.push_back({3, i, j, dir_chars[start_dir], rh_rules});
            }
        }
    }

    // --- 2. マトリョーシカ正方形ロボット (M=K) を大きい順(K=20→2)に配置 ---
    for (int K = N; K >= 2; --K) {
        for (int i = 0; i <= N - K; ++i) {
            for (int j = 0; j <= N - K; ++j) {
                bool valid = true;
                int cr = i, cc = j, cdir = 1; // 左上から右向き(1)にスタート
                
                // KxKの正方形の軌道上に「既に警備済みのマス」や「壁」がないかチェック
                for (int side = 0; side < 4; ++side) {
                    for (int step = 0; step < K - 1; ++step) {
                        if (covered[cr][cc] || has_wall(cr, cc, cdir)) { valid = false; break; }
                        cr += dr[cdir]; cc += dc[cdir];
                    }
                    if (!valid) break;
                    cdir = (cdir + 1) % 4;
                }
                
                // 邪魔なものがなければ配置！
                if (valid) {
                    vector<string> rules;
                    for (int s = 0; s < K - 1; ++s) rules.push_back("F " + to_string(s + 1) + " R 0");
                    rules.push_back("R 0 R 0"); // 角に来たら右を向く
                    
                    robots.push_back({K, i, j, 'R', rules});
                    
                    // 警備済みに塗りつぶす
                    cr = i; cc = j; cdir = 1;
                    for (int side = 0; side < 4; ++side) {
                        for (int step = 0; step < K - 1; ++step) {
                            covered[cr][cc] = true;
                            cr += dr[cdir]; cc += dc[cdir];
                        }
                        cdir = (cdir + 1) % 4;
                    }
                }
            }
        }
    }

    print_visualizer(covered);

    // --- 3. 残りの孤立マスに自己回転ロボット (M=1) の配置 ---
    vector<string> spin_rules = {"R 0 R 0"};
    for (int i = 0; i < N; ++i) {
        for (int j = 0; j < N; ++j) {
            if (!covered[i][j]) {
                robots.push_back({1, i, j, 'U', spin_rules});
            }
        }
    }

    // --- 出力 ---
    cout << robots.size() << "\n";
    for (const auto& r : robots) {
        cout << r.m << " " << r.r << " " << r.c << " " << r.d << "\n";
        for (const string& rule : r.rules) cout << rule << "\n";
    }
    for (int i = 0; i < N; ++i) cout << string(N - 1, '0') << "\n";
    for (int i = 0; i < N - 1; ++i) cout << string(N, '0') << "\n";

    return 0;
}

提出情報

コンパイルエラー

./Main.cpp: In function 'int main()':
./Main.cpp:100:44: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  100 |                 for (int s = loop_start; s < path.size(); ++s) {
      |                                          ~~^~~~~~~~~~~~~

ジャッジ結果