oj.uz

답안 #1025342

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1025342 2024-07-16T22:22:08 Z tolbi Xor Sort (eJOI20_xorsort) C++17
40 / 100
 42 ms 1128 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n,s;cin>>n>>s;
	vector<int> arr(n);
	for (int i = 0; i < n; ++i)
	{
		cin>>arr[i];
	}
	vector<pair<int,int>> ansarr;
	for (int bit = 22; bit >= 0; bit--){
		for (int i = 0; i+1 < n; i++){
			if (arr[i]&(1LL<<bit)){
				if (arr[i+1]&(1LL<<bit)){
					ansarr.push_back({i+1,i+2});
					arr[i]^=arr[i+1];
				}
				else {
					ansarr.push_back({i+2,i+1});
					ansarr.push_back({i+1,i+2});
					arr[i+1]^=arr[i];
					arr[i]^=arr[i+1];
				}
			}
		}
		if ((n>1) && (arr[n-1]&(1LL<<bit))){
			n--;
		}
	}
	for (int i = 1; i < arr.size(); i++){
		assert(arr[i]>=arr[i-1]);
	}
	cout<<ansarr.size()<<endl;
	for (int i = 0; i < ansarr.size(); ++i)
	{
		cout<<ansarr[i].first<<" "<<ansarr[i].second<<endl;
	}
}

Compilation message

xorsort.cpp: In function 'int main()':
xorsort.cpp:33:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |  for (int i = 1; i < arr.size(); i++){
      |                  ~~^~~~~~~~~~~~
xorsort.cpp:37:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |  for (int i = 0; i < ansarr.size(); ++i)
      |                  ~~^~~~~~~~~~~~~~~

Subtask #1
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 388 KB Output is correct
3 Incorrect 2 ms 348 KB Not sorted
4 Halted 0 ms 0 KB -

Subtask #2
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 388 KB Output is correct
3 Incorrect 2 ms 348 KB Not sorted
4 Halted 0 ms 0 KB -

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 6 ms 564 KB Output is correct
5 Correct 33 ms 1004 KB Output is correct
6 Correct 31 ms 988 KB Output is correct
7 Correct 31 ms 992 KB Output is correct
8 Correct 34 ms 976 KB Output is correct
9 Correct 31 ms 992 KB Output is correct
10 Correct 31 ms 992 KB Output is correct
11 Correct 31 ms 1008 KB Output is correct
12 Correct 32 ms 992 KB Output is correct
13 Correct 33 ms 1044 KB Output is correct
14 Correct 33 ms 980 KB Output is correct
15 Correct 42 ms 1128 KB Output is correct