Submission #73741286

---

Source Code Expand

#include <iostream>
using namespace std;

int main() {
    int N, AK, AM, AW;
    cin >> N >> AK >> AM >> AW;

    // Read walls (we ignore them for this strategy)
    string s;
    for (int i = 0; i < N; ++i) cin >> s;
    for (int i = 0; i < N - 1; ++i) cin >> s;

    // Output K = N*N
    cout << N * N << '\n';

    // For each cell (i, j)
    for (int i = 0; i < N; ++i) {
        for (int j = 0; j < N; ++j) {
            // Robot: 1 state, at (i,j), initial direction U
            cout << "1 " << i << " " << j << " U\n";
            // Action: always turn right, next state 0
            cout << "R 0 R 0\n";
        }
    }

    // Output no new walls
    for (int i = 0; i < N; ++i) {
        for (int j = 0; j < N - 1; ++j) cout << '0';
        cout << '\n';
    }
    for (int i = 0; i < N - 1; ++i) {
        for (int j = 0; j < N; ++j) cout << '0';
        cout << '\n';
    }

    return 0;
}

Submission Info

Judge Result