Submission #1014325

#	Time	Username	Problem	Language	Result	Execution time	Memory
1014325		delrey	Xor Sort (eJOI20_xorsort)	C++14	25 / 100	7 ms	1488 KiB

xorsort

#include <bits/stdc++.h>
using namespace std;

int n, s, a[1000];
vector<pair<int, int> > res;

int main() {
    cin>>n>>s;
    for(int i = 0; i < n; i++)
        cin>>a[i];
    for(int i = 0; i < n; i++) {
        int m = i;
        for(int j = i + 1; j < n; j++)
            if(a[m] > a[j])
                m = j;
        for(int j = m; j > i; j--) {
            res.push_back({j, j - 1});
            res.push_back({j - 1, j});
            if(s == 1) {
                res.push_back({j, j - 1});
                swap(a[j - 1], a[j]);
            } else {
                a[j] ^= a[j - 1];
                a[j - 1] ^= a[j];
            }
        }
    }
    cout<<res.size()<<'\n';
    for(auto i : res)
        cout<<i.first + 1<<" "<<i.second + 1<<'\n';
    //for(int i = 0; i < n; i++)
    //    cout<<a[i]<<" ";
    return 0;
}

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