oj.uz

Submission #707926

# Submission time Handle Problem Language Result Execution time Memory
707926 2023-03-10T13:58:16 Z josanneo22 Xor Sort (eJOI20_xorsort) C++17
0 / 100
 0 ms 212 KB 
#include<bits/stdc++.h>
#include<iostream>
using namespace std;
int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	int n, s; cin >> n >> s;
	vector<int> a(n);
	for (auto& x : a) cin >> x;
	vector<pair<int, int>> ans;
	if (s == 1) {
		for (int i = 1; i < n; i++) {
			if (a[i] < a[i - 1]) {
				ans.push_back(make_pair(i,i-1));
				ans.push_back(make_pair(i-1, i)); 
				ans.push_back(make_pair(i, i - 1));
				swap(a[i], a[i - 1]);
			}
		}
	}
	cout << ans.size() << '\n';
	for (int i = 0; i < ans.size(); i++) {
		cout << ans[i].first+1 << ' ' << ans[i].second+1 << '\n';
	}
}

Compilation message

xorsort.cpp: In function 'int main()':
xorsort.cpp:21: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]
   21 |  for (int i = 0; i < ans.size(); i++) {
      |                  ~~^~~~~~~~~~~~

Subtask #1
0 / 25.0

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

Subtask #2
0 / 35.0

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

Subtask #3
0 / 40.0

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