oj.uz

답안 #464008

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
464008 2021-08-12T07:31:28 Z amunduzbaev Xor Sort (eJOI20_xorsort) C++14
65 / 100
 11 ms 1356 KB 
#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.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 4 ms 688 KB Output is correct
6 Correct 4 ms 592 KB Output is correct
7 Correct 4 ms 592 KB Output is correct
8 Correct 4 ms 592 KB Output is correct
9 Correct 4 ms 592 KB Output is correct
10 Correct 4 ms 592 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 7 ms 848 KB Output is correct
13 Correct 7 ms 976 KB Output is correct
14 Correct 8 ms 848 KB Output is correct
15 Correct 7 ms 864 KB Output is correct

Subtask #2
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 4 ms 688 KB Output is correct
6 Correct 4 ms 592 KB Output is correct
7 Correct 4 ms 592 KB Output is correct
8 Correct 4 ms 592 KB Output is correct
9 Correct 4 ms 592 KB Output is correct
10 Correct 4 ms 592 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 7 ms 848 KB Output is correct
13 Correct 7 ms 976 KB Output is correct
14 Correct 8 ms 848 KB Output is correct
15 Correct 7 ms 864 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 4 ms 592 KB Output is correct
18 Correct 6 ms 884 KB Output is correct
19 Correct 6 ms 848 KB Output is correct
20 Correct 6 ms 876 KB Output is correct
21 Correct 7 ms 848 KB Output is correct
22 Correct 6 ms 848 KB Output is correct
23 Correct 7 ms 848 KB Output is correct
24 Correct 6 ms 848 KB Output is correct
25 Correct 8 ms 848 KB Output is correct
26 Incorrect 11 ms 1356 KB Integer 59568 violates the range [0, 40000]
27 Halted 0 ms 0 KB -

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 7 ms 976 KB Output is correct
6 Correct 7 ms 976 KB Output is correct
7 Correct 8 ms 976 KB Output is correct
8 Correct 7 ms 976 KB Output is correct
9 Correct 7 ms 976 KB Output is correct
10 Correct 7 ms 976 KB Output is correct
11 Correct 7 ms 1108 KB Output is correct
12 Correct 11 ms 1048 KB Output is correct
13 Correct 7 ms 1092 KB Output is correct
14 Correct 7 ms 1048 KB Output is correct
15 Correct 11 ms 1124 KB Output is correct