oj.uz

답안 #1025348

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1025348 2024-07-16T22:36:21 Z tolbi Xor Sort (eJOI20_xorsort) C++17
65 / 100
 61 ms 1240 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;
	if (s==2){
		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--;
			}
		}
	}
	else {
		for (int i = 0; i < n; i++){
			for (int j = i; j; j--){
				if (arr[j]<arr[j-1]){
					ansarr.push_back({j,j+1});
					ansarr.push_back({j+1,j});
					ansarr.push_back({j,j+1});
					swap(arr[j],arr[j-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:48: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]
   48 |  for (int i = 0; i < ansarr.size(); ++i)
      |                  ~~^~~~~~~~~~~~~~~

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 3 ms 344 KB Output is correct
4 Correct 16 ms 764 KB Output is correct
5 Correct 24 ms 980 KB Output is correct
6 Correct 17 ms 736 KB Output is correct
7 Correct 18 ms 736 KB Output is correct
8 Correct 17 ms 732 KB Output is correct
9 Correct 19 ms 736 KB Output is correct
10 Correct 18 ms 860 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 34 ms 992 KB Output is correct
13 Correct 34 ms 992 KB Output is correct
14 Correct 36 ms 992 KB Output is correct
15 Correct 35 ms 992 KB Output is correct

Subtask #2
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 3 ms 344 KB Output is correct
4 Correct 16 ms 764 KB Output is correct
5 Correct 24 ms 980 KB Output is correct
6 Correct 17 ms 736 KB Output is correct
7 Correct 18 ms 736 KB Output is correct
8 Correct 17 ms 732 KB Output is correct
9 Correct 19 ms 736 KB Output is correct
10 Correct 18 ms 860 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 34 ms 992 KB Output is correct
13 Correct 34 ms 992 KB Output is correct
14 Correct 36 ms 992 KB Output is correct
15 Correct 35 ms 992 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 18 ms 776 KB Output is correct
18 Correct 32 ms 988 KB Output is correct
19 Correct 32 ms 988 KB Output is correct
20 Correct 30 ms 980 KB Output is correct
21 Correct 39 ms 1004 KB Output is correct
22 Correct 32 ms 984 KB Output is correct
23 Correct 32 ms 984 KB Output is correct
24 Correct 29 ms 928 KB Output is correct
25 Correct 30 ms 992 KB Output is correct
26 Incorrect 61 ms 1240 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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 400 KB Output is correct
4 Correct 6 ms 604 KB Output is correct
5 Correct 42 ms 984 KB Output is correct
6 Correct 34 ms 860 KB Output is correct
7 Correct 31 ms 988 KB Output is correct
8 Correct 31 ms 988 KB Output is correct
9 Correct 31 ms 988 KB Output is correct
10 Correct 42 ms 992 KB Output is correct
11 Correct 31 ms 992 KB Output is correct
12 Correct 33 ms 988 KB Output is correct
13 Correct 32 ms 992 KB Output is correct
14 Correct 33 ms 988 KB Output is correct
15 Correct 57 ms 1136 KB Output is correct