Tenkici

input/code.cpp: In function 'int main()':
input/code.cpp:47:9: warning: unused variable 's' [-Wunused-variable]
     int s = 0;
         ^

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

using namespace std;

int n, fix[501], fiy[501], board[501][501], tank[501];
pair<int, int> x[501], y[501];
vector<pair<int, char> > ans;

void pushx(int i){
    i = fix[i];
    int m = fix[x[i].S]<x[i].F ? -1 : 1;
    char c = fix[x[i].S]<x[i].F ? 'L' : 'R';

    while(fix[x[i].S] != x[i].F){
        if(board[tank[x[i].S]][x[i].F+m]) pushx(board[tank[x[i].S]][x[i].F+m]);
        ans.push_back({x[i].S, c});
        swap(board[tank[x[i].S]][x[i].F], board[tank[x[i].S]][x[i].F+m]);
        x[i].F += m;
    }
}

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};
        board[a][b] = i;
        tank[i] = a;
    }

    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;
    }

    int s = 0;
    for(int i=1; i<=n; i++){
        pushx(x[i].S);
    }

    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: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED