Tenkici

#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
using ii=long long;
#define F first
#define S second
int vapaa[501][501];
int main()
{
    int n;
    cin >> n;
    vector<pair<int,int>> orig(n), fin(n);
#define f first
#define s second
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            vapaa[i][j] = 1;
        }
    }
    for (int i = 0; i < n; ++i) {
        int a, b;
        cin >> a >> b;
        --a; --b;
        orig[i] = {a, b};
        vapaa[a][b] = 0;
    }
    priority_queue<pair<int,int>> pq;
    for (int i = 0; i < n; ++i) {
        pq.emplace(-orig[i].F, i);
    }
    for (int it = 0; it < n; ++it) {
        fin[pq.top().S].F = it;
        pq.pop();
    }
    assert(pq.empty());
    for (int i = 0; i < n; ++i) {
        pq.emplace(-orig[i].S, i);
    }
    for (int it = 0; it < n; ++it) {
        fin[pq.top().S].S = it;
        pq.pop();
    }
    vector<pair<char, int>> moves;
    for (int x = 0; x < n * n; ++x) {
        for (int i = 0; i < n; ++i) {
            while (orig[i] != fin[i]) {
                if (orig[i].F < fin[i].F && vapaa[orig[i].F + 1][orig[i].S]) {
                    vapaa[orig[i].F][orig[i].S] = 1;
                    orig[i].F++;
                    moves.emplace_back('D', i + 1);
                    vapaa[orig[i].F][orig[i].S] = 0;
                }
                else if (orig[i].F > fin[i].F && vapaa[orig[i].F - 1][orig[i].S]) {
                    vapaa[orig[i].F][orig[i].S] = 1;
                    orig[i].F--;
                    moves.emplace_back('U', i + 1);
                    vapaa[orig[i].F][orig[i].S] = 0;
                }
                else if (orig[i].S < fin[i].S && vapaa[orig[i].F][orig[i].S + 1]) {
                    vapaa[orig[i].F][orig[i].S] = 1;
                    orig[i].S++;
                    moves.emplace_back('R', i + 1);
                    vapaa[orig[i].F][orig[i].S] = 0;
                }
                else if (orig[i].S > fin[i].S && vapaa[orig[i].F][orig[i].S - 1]) {
                    vapaa[orig[i].F][orig[i].S] = 1;
                    orig[i].S--;
                    moves.emplace_back('L', i + 1);
                    vapaa[orig[i].F][orig[i].S] = 0;
                }
                else break;
            }
        }
    }
    for (int i = 0; i < n; ++i) {
        assert(orig[i] == fin[i]);
//        cout << fin[i].F + 1<< ", " << fin[i].S + 1 << "\n";
    }
    cout << moves.size() << "\n";
    for (auto [y, x] : moves) {
        cout << x << " " << y << "\n";
    }
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: RUNTIME ERROR

code: input/code.cpp:76: int main(): Assertion `orig[i] == fin[i]' failed.

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED