oj.uz

Submission #464090

# Submission time Handle Problem Language Result Execution time Memory
464090 2021-08-12T11:14:25 Z amunduzbaev Xor Sort (eJOI20_xorsort) C++14
60 / 100
 196 ms 15920 KB 
#include "bits/stdc++.h"
using namespace std;

void solve(){
	int s, n; cin>>n>>s;
	vector<int> a(n);
	for(auto& x : a) cin>>x;
	
	vector<array<int, 2>> mx, rr;
	for(int i=0;i<n;i++){
		mx.push_back({a[i], i});
	} sort(mx.rbegin(), mx.rend());
	
	for(int i=0;i<(int)mx.size();i++){
		int p = mx[i][1];
		
		for(int i=0;i+1<n;i++){
			a[i] ^= a[i+1];
			rr.push_back({i, i+1});
		}
		
		if(i) n--;
		
		for(int i=p;i+1<n;i++){
			a[i+1] ^= a[i];
			rr.push_back({i+1, i});
		}
		
		for(int i=p-2;i>=0;i--){
			a[i] ^= a[i+1];
			rr.push_back({i, i+1});
		}
		
		assert(a[n - 1] == mx[i][0]);
		for(int j=i + 1;j<(int)mx.size();j++){
			if(mx[j][1] > p) mx[j][1]--;
		}
		//~ for(int i=0;i<(int)a.size();i++) cout<<a[i]<<" ";
		//~ cout<<"\n";
	}
	
	cout<<(int)rr.size()<<"\n";
	for(auto x : rr) cout<<x[0] + 1<<" "<<x[1] + 1<<"\n";
}

/*

5 1
3 2 8 4 1

*/

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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 5 ms 716 KB Output is correct
5 Correct 5 ms 696 KB Output is correct
6 Correct 5 ms 716 KB Output is correct
7 Correct 5 ms 760 KB Output is correct
8 Correct 5 ms 716 KB Output is correct
9 Correct 5 ms 716 KB Output is correct
10 Correct 5 ms 716 KB Output is correct
11 Correct 5 ms 716 KB Output is correct
12 Correct 5 ms 716 KB Output is correct
13 Correct 5 ms 716 KB Output is correct
14 Correct 5 ms 716 KB Output is correct
15 Correct 5 ms 716 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 5 ms 716 KB Output is correct
5 Correct 5 ms 696 KB Output is correct
6 Correct 5 ms 716 KB Output is correct
7 Correct 5 ms 760 KB Output is correct
8 Correct 5 ms 716 KB Output is correct
9 Correct 5 ms 716 KB Output is correct
10 Correct 5 ms 716 KB Output is correct
11 Correct 5 ms 716 KB Output is correct
12 Correct 5 ms 716 KB Output is correct
13 Correct 5 ms 716 KB Output is correct
14 Correct 5 ms 716 KB Output is correct
15 Correct 5 ms 716 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 5 ms 716 KB Output is correct
18 Correct 8 ms 972 KB Output is correct
19 Correct 8 ms 972 KB Output is correct
20 Correct 8 ms 952 KB Output is correct
21 Correct 8 ms 968 KB Output is correct
22 Correct 8 ms 948 KB Output is correct
23 Correct 8 ms 1020 KB Output is correct
24 Correct 8 ms 1004 KB Output is correct
25 Correct 8 ms 972 KB Output is correct
26 Correct 8 ms 972 KB Output is correct
27 Correct 8 ms 948 KB Output is correct
28 Correct 8 ms 972 KB Output is correct
29 Correct 8 ms 1000 KB Output is correct
30 Correct 10 ms 952 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 8 ms 972 KB Output is correct
5 Incorrect 196 ms 15920 KB Integer 999006 violates the range [0, 40000]
6 Halted 0 ms 0 KB -