Submission #466009

#	Time	Username	Problem	Language	Result	Execution time	Memory
466009		fuad27	Xor Sort (eJOI20_xorsort)	C++17	25 / 100	1087 ms	11440 KiB

xorsort

#include<bits/stdc++.h>
using namespace std;
vector<pair<int, int>> v;
void sw(int i, int j) {
	v.push_back({j, i});
	v.push_back({i, j});
	v.push_back({j, i});
}
int main () {
	int n, s;
	cin >> n >> s;
	int a[n];
	for(int i = 0;i<n;i++) {
		cin >> a[i];	
	}
	for(int i = 1;i<=n;i++) {
		bool check = false;
		for(int j = 0;j<n-i;j++) {
			if(a[j] > a[j+1]) {
				sw(j+1, j+2);
				swap(a[j], a[j+1]);
				check = true;
			}
		}
		if(!check)break;
	}
	cout<<v.size()<<endl;
	for(auto [i, j]:v) {
		cout<<i<<' '<<j<<endl;
	}
}

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