Submission #1090007

#	Time	Username	Problem	Language	Result	Execution time	Memory
1090007		12345678	Xor Sort (eJOI20_xorsort)	C++17	25 / 100	7 ms	860 KiB

xorsort

#include <bits/stdc++.h>

using namespace std;

const int nx=2e3+5;

int s, n, a[nx], tmp[nx];
vector<int> res;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>s;
    for (int i=1; i<=n; i++) cin>>a[i], tmp[i]=a[i];
    if (s==1)
    {
        for (int i=1; i<=n; i++)
        {
            for (int j=1; j<n; j++)
            {
                if (a[j]>a[j+1])
                {
                    res.push_back(j);
                    tmp[j]^=tmp[j+1];
                    tmp[j+1]^=tmp[j];
                    tmp[j]^=tmp[j+1];
                    swap(a[j], a[j+1]);
                }
            }
        }
        cout<<3*res.size()<<'\n';
        for (auto x:res)
        {
            cout<<x<<' '<<x+1<<'\n';
            cout<<x+1<<' '<<x<<'\n';
            cout<<x<<' '<<x+1<<'\n';
        }
    }
    else
    {
        return 0;
    }
}

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