제출 #1025346

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1025346		tolbi	Xor Sort (eJOI20_xorsort)	C++17	40 / 100	42 ms	1492 KiB

xorsort

#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t 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<int> barr = arr;
	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--;
		}
	}
	cout<<ansarr.size()<<endl;
	for (int i = 0; i < ansarr.size(); ++i)
	{
		cout<<ansarr[i].first<<" "<<ansarr[i].second<<endl;
	}
}

컴파일 시 표준 에러 (stderr) 메시지

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

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