#include <iostream>
#include <vector>
#include <algorithm>
#define x first
#define y second
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pii> vii;
vi a;
vii ans;
void Xor(int i, int j) {
a[i] ^= a[j];
ans.push_back({i, j});
}
void Swap(int i, int j) {
Xor(j, i);
Xor(i, j);
Xor(j, i);
// ans.push_back({j, i});
// ans.push_back({i, j});
// ans.push_back({j, i});
// swap(a[i], a[j]);
}
int main() {
int n, s;
cin >> n >> s;
a.resize(n + 1);
for (int i = 1; i <= n; i++) cin >> a[i];
while (true) {
bool is_new = false;
for (int i = 1; i < n; i++) {
if (a[i] > a[i + 1]) {
Swap(i, i + 1);
is_new = true;
}
}
if (!is_new) break;
}
cout << ans.size() << '\n';
for (int i = 0; i < ans.size(); i++) {
cout << ans[i].x << ' ' << ans[i].y << '\n';
}
}
Compilation message
xorsort.cpp: In function 'int main()':
xorsort.cpp:45:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
45 | for (int i = 0; i < ans.size(); i++) {
| ~~^~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
4 ms |
588 KB |
Output is correct |
5 |
Correct |
5 ms |
588 KB |
Output is correct |
6 |
Correct |
4 ms |
588 KB |
Output is correct |
7 |
Correct |
4 ms |
588 KB |
Output is correct |
8 |
Correct |
5 ms |
588 KB |
Output is correct |
9 |
Correct |
5 ms |
588 KB |
Output is correct |
10 |
Correct |
5 ms |
588 KB |
Output is correct |
11 |
Correct |
1 ms |
204 KB |
Output is correct |
12 |
Correct |
8 ms |
872 KB |
Output is correct |
13 |
Correct |
8 ms |
840 KB |
Output is correct |
14 |
Correct |
8 ms |
840 KB |
Output is correct |
15 |
Correct |
8 ms |
840 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
4 ms |
588 KB |
Output is correct |
5 |
Correct |
5 ms |
588 KB |
Output is correct |
6 |
Correct |
4 ms |
588 KB |
Output is correct |
7 |
Correct |
4 ms |
588 KB |
Output is correct |
8 |
Correct |
5 ms |
588 KB |
Output is correct |
9 |
Correct |
5 ms |
588 KB |
Output is correct |
10 |
Correct |
5 ms |
588 KB |
Output is correct |
11 |
Correct |
1 ms |
204 KB |
Output is correct |
12 |
Correct |
8 ms |
872 KB |
Output is correct |
13 |
Correct |
8 ms |
840 KB |
Output is correct |
14 |
Correct |
8 ms |
840 KB |
Output is correct |
15 |
Correct |
8 ms |
840 KB |
Output is correct |
16 |
Correct |
0 ms |
204 KB |
Output is correct |
17 |
Correct |
5 ms |
588 KB |
Output is correct |
18 |
Correct |
7 ms |
816 KB |
Output is correct |
19 |
Correct |
7 ms |
840 KB |
Output is correct |
20 |
Correct |
7 ms |
840 KB |
Output is correct |
21 |
Correct |
7 ms |
840 KB |
Output is correct |
22 |
Correct |
7 ms |
840 KB |
Output is correct |
23 |
Correct |
8 ms |
800 KB |
Output is correct |
24 |
Correct |
9 ms |
780 KB |
Output is correct |
25 |
Correct |
7 ms |
840 KB |
Output is correct |
26 |
Incorrect |
13 ms |
1220 KB |
Integer 59568 violates the range [0, 40000] |
27 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
7 ms |
840 KB |
Output is correct |
5 |
Incorrect |
169 ms |
12440 KB |
Integer 764742 violates the range [0, 40000] |
6 |
Halted |
0 ms |
0 KB |
- |