Submission #499274

#	Time	Username	Problem	Language	Result	Execution time	Memory
499274		LucaIlie	Xor Sort (eJOI20_xorsort)	C++17	0 / 100	1 ms	204 KiB

xorsort

#include <iostream>

#define MAX_N 1000
#define MAX_K 40000

using namespace std;

struct answer {
    int x, y;
};

int v[MAX_N];
answer ans[MAX_K];

int main() {
    int n, s, k, i, j, p;

    cin >> n >> s;
    for ( i = 0; i < n; i++ )
        cin >> v[i];

    k = 0;
    for ( i = 0; i < n; i++ ) {
        p = i;
        for ( j = i + 1; j < n; j++ ) {
            if ( v[j] < v[p] )
                p = j;
        }
        if ( p != i ) {
            swap( v[i], v[p] );

            while ( p > i ) {
                ans[k] = { p, p + 1 };
                ans[k + 1] = { p + 1, p };
                ans[k + 2] = { p, p + 1 };
                k += 3;
                p--;
            }
        }
    }

    cout << k << "\n";
    for ( i = 0; i < k; i++ )
        cout << ans[i].x << " " << ans[i].y << "\n";

    return 0;
}

• Subtask 1: 0 / 25
• Subtask 2: 0 / 35
• Subtask 3: 0 / 40