Tenkici

#include <iostream>
#include <vector>
#include <algorithm>
#define pb push_back
#define F first
#define S second

using namespace std;

int n, fix[501], fiy[501], occ[501][501];
pair<int, int> x[501], y[501], tank[501];

vector<pair<int, char> > ans;

int main(){

    cin >> n;

    for(int i=1; i<=n; i++){
        int a, b;
        cin >> a >> b;
        x[i] = {b, i};
        y[i] = {a, i};
        occ[a][b] = i;
        tank[i] = {a, b};
    }

    sort(x+1, x+n+1);
    sort(y+1, y+n+1);

    for(int i=1; i<=n; i++){
        fix[x[i].S] = i;
        fiy[y[i].S] = i;
    }

    for(int i=1; i<=n; i++){
        int m = fix[x[i].S]<x[i].F ? -1 : 1;
        char c  = fix[x[i].S]<x[i].F ? 'L' : 'R';
        int ty = tank[x[i].S].F;

        while(fix[x[i].S] != x[i].F){

            int j = 0;
            while(occ[ty][x[i].F+j+m]) j += m;

            while(j){
                int a = occ[ty][x[i].F+j];
                ans.push_back({a, c});
                x[a].F += m;
                swap(occ[ty][x[i].F+j], occ[ty][x[i].F+j+m]);
                j -= m;
            }
            ans.push_back({x[i].S, c});
            x[i].F += m;
            swap(occ[ty][x[i].F], occ[ty][x[i].F-m]);
        }
    }

    for(int i=1; i<=n; i++){
        int m = fiy[y[i].S]<y[i].F ? -1 : 1;
        char c  = fiy[y[i].S]<y[i].F ? 'U' : 'D';
        while(fiy[y[i].S] != y[i].F){
            ans.push_back({y[i].S, c});
            y[i].F += m;
        }
    }

    cout << ans.size() << '\n';
    for(auto i : ans) cout << i.F << ' ' << i.S << '\n';

    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: RUNTIME ERROR

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: ACCEPTED

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER