제출 #464008

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
464008		amunduzbaev	Xor Sort (eJOI20_xorsort)	C++14	65 / 100	11 ms	1356 KiB

xorsort

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

#define ar array

vector<ar<int, 2>> get(vector<int>& a, int b = 20){
	if(a.empty()) return {};
	vector<int> tmp;
	for(auto x : a) tmp.push_back(x>>b&1);
	
	vector<ar<int, 2>> rr;
	
	for(int i=0;i+1<(int)tmp.size();i++){
		if(tmp[i] && tmp[i+1]){
			tmp[i] ^= 1;
			rr.push_back({i, i+1});
			a[i] ^= a[i+1];
		} else if(tmp[i] && tmp[i+1] == 0){
			swap(tmp[i], tmp[i+1]);
			rr.push_back({i+1, i});
			rr.push_back({i, i+1});
			a[i+1] ^= a[i];
			a[i] ^= a[i+1];
		}
	}
	
	if(b){
		if(tmp.back()) a.pop_back();
		vector<ar<int, 2>> tt = get(a, b - 1);
		rr.insert(rr.end(), tt.begin(), tt.end());
	}
	
	return rr;
}

void solve(){
	int n, s; cin>>n>>s;
	vector<int> a(n);
	for(auto& x : a) cin>>x;
	if(s == 2){
		vector<ar<int, 2>> res = get(a);
		cout<<(int)res.size()<<"\n";
		for(auto x : res) cout<<x[0] + 1<<" "<<x[1] + 1<<"\n";
		cout<<"\n";
	} else {
		vector<array<int, 2>> rr;
		auto swwap = [&](int i){
			rr.push_back({i + 1, i});
			rr.push_back({i, i + 1});
			rr.push_back({i + 1, i});
		}; 
		
		for(int i=0;i<n;i++){
			int p = i;
			for(int j=i+1;j<n;j++){
				if(a[j] < a[p]) p = j;
			}
			
			while(p > i){
				swap(a[p], a[p - 1]);
				swwap(p);
				p--;
			}
		}
		
		cout<<(int)rr.size()<<"\n";
		for(auto x : rr) cout<<x[0]<<" "<<x[1]<<"\n";
	}
}

signed main(){
	ios_base::sync_with_stdio(0); cin.tie(0);
	int t = 1;
	//~ cin>>t;
	while(t--) solve();
}

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