// #pragma GCC optimize("Ofast,unroll-loops")
#ifdef MINHDEPTRAI
#include "/Library/Developer/CommandLineTools/usr/include/c++/v1/bits/stdc++.h"
#include <chrono>
#define __gcd(a, b) gcd(a, b)
using namespace std ::chrono;
#else
#include <bits/stdc++.h>
#endif
using namespace std;
#define foru(i, a, b) for (int i = a; i <= b; ++i)
#define ford(i, a, b) for (int i = a; i >= b; --i)
#define IOS ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp(a, b) make_pair(a, b)
// #define int long long
typedef pair<int, int> pii;
typedef pair<pair<int, int>, int> piii;
#define endl '\n'
const string name_minh = "9";
#define int long long
const int maxN = 2e5 + 5;
const int mod = 1;
const int inf = 1e9;
int n, arr[maxN], k;
void solve(){
cin >> n >> k;
foru(i, 1, n){
cin >> arr[i];
}
vector<pair<int, int>> ans;
foru(i, 1, n){
foru(j, 1, n - i){
if(arr[j] > arr[j + 1]){
if(arr[j] ^ arr[j + 1] < arr[j + 1]){
ans.push_back(mp(j, j + 1));
arr[j] = arr[j] ^ arr[j + 1];
}
else{
swap(arr[j], arr[j + 1]);
ans.push_back(mp(j + 1, j));
ans.push_back(mp(j, j + 1));
ans.push_back(mp(j + 1, j));
}
}
}
}
cout << ans.size() << endl;
for(pair<int, int> x: ans){
cout << x.first << " " << x.second << endl;
}
}
signed main(){
IOS
// #ifdef MINHDEPTRAI
// ifstream cin(name_minh + ".in");
// ofstream cout(name_minh + ".out");
// #endif
solve();
// int a = 5, b = 3;
// b = b ^ a;
// cout << a << " " << b << endl;
// a = a ^ b;
// cout << a << " " << b << endl;
// b = b ^ a;
// cout << a << " " << b << endl;
}
Compilation message
xorsort.cpp: In function 'void solve()':
xorsort.cpp:38:40: warning: self-comparison always evaluates to false [-Wtautological-compare]
38 | if(arr[j] ^ arr[j + 1] < arr[j + 1]){
| ~~~~~~~~~~ ^ ~~~~~~~~~~
xorsort.cpp:38:40: warning: suggest parentheses around comparison in operand of '^' [-Wparentheses]
38 | if(arr[j] ^ arr[j + 1] < arr[j + 1]){
| ~~~~~~~~~~~^~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Not sorted |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Not sorted |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Not sorted |
| 2 |
Halted |
0 ms |
0 KB |
- |
