oj.uz

Submission #508648

# Submission time Handle Problem Language Result Execution time Memory
508648 2022-01-13T13:38:24 Z uncripted Xor Sort (eJOI20_xorsort) C++11
60 / 100
 54 ms 1600 KB 
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
long long power[23];
long long pas[40005][3];
long long n;
void pow2calc(long long x){
	power[1]=1;
	for(long long i=2; i<=x; i++){
		power[i]=power[i-1]*2;
	}



}
pair<long long,long long> aa[2000002];
long long a1[2000002];

long long a[2000005];
int main(){
long long s;
pow2calc(22);
cin>>n;
cin>>s;
if(s==1){
	long long k=0;
	for(long long i=1; i<=n; i++){
		cin>>a[i];
		a1[i]=a[i];
		aa[i].ff=a[i];
		aa[i].ss=i;
	}
	sort(aa+1, aa+n+1);
	long long lastsort=n;
	while(lastsort!=1){
		long long maxi=aa[lastsort].ss;
		for(long long i=1; i<=lastsort-1; i++ ){
			k++;
			pas[k][1]=i;
			pas[k][2]=i+1; 
			a1[i]=a1[i]^a1[i+1];
		}
		for(long long i=maxi+1; i<=lastsort; i++){
			k++;
			pas[k][1]=i;
			pas[k][2]=i-1;
			a1[i]=a1[i]^a1[i-1];
		}
		for(long long i=maxi-2; i>=1; i--){
			k++;
			pas[k][1]=i;
			pas[k][2]=i+1;
			a1[i]=a1[i]^a1[i+1];
			
		}
	for(long long i=1; i<=n; i++){
		if(aa[i].ss>maxi){
			aa[i].ss--;
		}
	}
		lastsort--;
		
	}
	for(long long i=n-1; i>=1; i--){
		k++;
		pas[k][1]=i;
		pas[k][2]=i+1;
		a1[i]=a1[i]^a1[i+1];
	}
 
 
	cout<<k<<endl;
	for(long long i=1; i<=k; i++){
		cout<<pas[i][1]<<" "<<pas[i][2]<<endl;
	}
		cout<<endl;
	for(long long i=1; i<=n; i++){
	//	cout<<a1[i]<<" ";
	}
	
 
}
if(s==2){
	long long ax[n+1];
	long long k=0;
for(long long i=1; i<=n; i++){
	cin>>ax[i];
	
}
	long long last=n;
	for(long long i=22; i>=1; i--){
			
	
		
			bool f=false;
			for(long long jj=1; jj<last; jj++){
				f=true;
				if((power[i]&ax[jj])){
					if((power[i]&ax[jj+1])==0){	
						k+=2;
						ax[jj+1]^=ax[jj];
						ax[jj]^=ax[jj+1];
						pas[k-1][1]=jj+1;
						pas[k-1][2]=jj;
						pas[k][1]=jj;
						pas[k][2]=jj+1;
					}else{
						k++;
						ax[jj]^=ax[jj+1];
						pas[k][1]=jj;
						pas[k][2]=jj+1;
					}
				}
			}
		
				
		//	last--;
	}
	cout<<k<<endl;
	for(long long i=1; i<=k; i++){
		cout<<pas[i][1]<<" "<<pas[i][2]<<endl;
	}
	for(long long i=1; i<=n; i++){
	//	cout<<ax[i]<<" ";
	}
}


}

Compilation message

xorsort.cpp: In function 'int main()':
xorsort.cpp:96:9: warning: variable 'f' set but not used [-Wunused-but-set-variable]
   96 |    bool f=false;
      |         ^

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 4 ms 332 KB Output is correct
4 Correct 31 ms 916 KB Output is correct
5 Correct 29 ms 916 KB Output is correct
6 Correct 29 ms 900 KB Output is correct
7 Correct 28 ms 888 KB Output is correct
8 Correct 29 ms 916 KB Output is correct
9 Correct 36 ms 936 KB Output is correct
10 Correct 29 ms 968 KB Output is correct
11 Correct 31 ms 920 KB Output is correct
12 Correct 32 ms 972 KB Output is correct
13 Correct 27 ms 972 KB Output is correct
14 Correct 29 ms 924 KB Output is correct
15 Correct 32 ms 932 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 0 ms 204 KB Output is correct
3 Correct 4 ms 332 KB Output is correct
4 Correct 31 ms 916 KB Output is correct
5 Correct 29 ms 916 KB Output is correct
6 Correct 29 ms 900 KB Output is correct
7 Correct 28 ms 888 KB Output is correct
8 Correct 29 ms 916 KB Output is correct
9 Correct 36 ms 936 KB Output is correct
10 Correct 29 ms 968 KB Output is correct
11 Correct 31 ms 920 KB Output is correct
12 Correct 32 ms 972 KB Output is correct
13 Correct 27 ms 972 KB Output is correct
14 Correct 29 ms 924 KB Output is correct
15 Correct 32 ms 932 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 36 ms 964 KB Output is correct
18 Correct 54 ms 1376 KB Output is correct
19 Correct 51 ms 1476 KB Output is correct
20 Correct 54 ms 1488 KB Output is correct
21 Correct 50 ms 1408 KB Output is correct
22 Correct 50 ms 1600 KB Output is correct
23 Correct 49 ms 1476 KB Output is correct
24 Correct 54 ms 1476 KB Output is correct
25 Correct 54 ms 1476 KB Output is correct
26 Correct 49 ms 1460 KB Output is correct
27 Correct 53 ms 1448 KB Output is correct
28 Correct 52 ms 1468 KB Output is correct
29 Correct 50 ms 1424 KB Output is correct
30 Correct 49 ms 1476 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Not sorted
2 Halted 0 ms 0 KB -