Submission #501666

#	Time	Username	Problem	Language	Result	Execution time	Memory
501666		LucaIlie	Xor Sort (eJOI20_xorsort)	C++17	25 / 100	6 ms	972 KiB

xorsort

#include <iostream>

#define MAX_N 1000
#define MAX_K 40000

using namespace std;

struct answer {
    int x, y;
};

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

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

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

    k = 0;
    for ( i = 1; i <= n; i++ ) {
        for ( j = 1; j <= n - 1; j++ ) {
            if ( v[j] > v[j + 1] ) {
                ans[k] = { j, j + 1 };
                v[j] ^= v[j + 1];
                ans[k + 1] = { j + 1, j };
                v[j + 1] ^= v[j];
                ans[k + 2] = { j, j + 1 };
                v[j] ^= v[j + 1];
                k += 3;
            }
        }
    }

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

    return 0;
}

Compilation message (stderr)

xorsort.cpp: In function 'int main()':
xorsort.cpp:16:24: warning: unused variable 'p' [-Wunused-variable]
   16 |     int n, s, k, i, j, p;
      |                        ^

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