Submission #457952

#	Time	Username	Problem	Language	Result	Execution time	Memory
457952		RaresFelix	Xor Sort (eJOI20_xorsort)	C++17	0 / 100	1 ms	332 KiB

xorsort

#include <bits/stdc++.h>
#define MN 10071
#define ML 20
using namespace std;
int n, s, A[MN], F[MN];
vector<pair<int, int> > SOL;
void xo(int a, int b) {
    --F[A[a]];
    A[a] ^= A[b];
    ++F[A[a]];
    SOL.push_back({a, b});
}
int main() {
    cin >> n >> s;
    for(int i = 1; i <= n; ++i)
        cin >> A[i];
    if(s == 1 || n <= ML){
        for(int i = 1; i <= n; ++i)
            for(int j = n; j >= 2; --j)
                if(A[j] < A[j-1]){
                    if(F[A[j] ^ A[j-1]]){
                        xo(j, j-1);
                        xo(j-1, j);
                        xo(j, j-1);
                    }
                    else {
                        if((A[j] ^ A[j-1]) < A[j])
                            xo(j-1, j);
                        else
                            xo(j, j-1);
                    }
                }
    } else {
        for(int j = (ML-1); j >= 0; --j){
            for(int i = 1; i < n + j - (ML-1); ++i){
                if((A[i] & (1<<j)) && A[i+1] & (1<<j)) xo(i, i + 1);
                else if((A[i] & (1<<j))){
                    xo(i+1, i);
                    xo(i, i + 1);
                }
            }
        }
    }
//    for(int i = 1; i <= n; ++i)
//        cout << A[i] << " \n"[i==n];
    cout << SOL.size() << "\n";
    for(auto it : SOL) cout << it.first << " " << it.second << "\n";
    return 0;
}

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