Submission #465337

#	Time	Username	Problem	Language	Result	Execution time	Memory
465337		Khizri	Xor Sort (eJOI20_xorsort)	C++17	25 / 100	151 ms	12580 KiB

xorsort

#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back		 
#define F first																 
#define S second 															 
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
	if(a>b) swap(a,b);
	if(a==0) return a+b;
	return gcd(b%a,a);
}
ll lcm(ll a,ll b){
	return a/gcd(a,b)*b;
}
bool is_prime(ll n){
	ll k=sqrt(n);
	if(n==2) return true;
	if(n<2||n%2==0||k*k==n) return false;
	for(int i=3;i<=k;i+=2){
		if(n%i==0){
			return false;
		}
	}
	return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=2e5+5;
int t=1,n,k,arr[mxn],b[mxn];
vector<int>vt;
void solve(){
	cin>>n>>k;
	for(int i=1;i<=n;i++){
		cin>>arr[i];
		b[i]=arr[i];
		vt.pb(arr[i]);
	}
	vector<pii>ans;
	sort(arr+1,arr+n+1);
	for(int j=1;j<=n;j++){
		int val=arr[j],ind=j;
		for(int i=0;i<n;i++){
			if(vt[i]==val){
				break;
			}
			ind++;
		}
		for(int i=ind;i>j;i--){
			ans.pb({i,i-1});
			ans.pb({i-1,i});
			ans.pb({i,i-1});
		}
		vt.erase(vt.begin()+(ind-j));
	}
	cout<<ans.size()<<endl;
	for(pii p:ans){
		cout<<p.F<<' '<<p.S<<endl;
		b[p.F]^=b[p.S];
	}
}
int main(){
	IOS;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

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