# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
774975 | vjudge1 | Xor Sort (eJOI20_xorsort) | C++17 | 742 ms | 524288 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define pii pair <int, int>
#define fi first
#define se second
#define mp make_pair
const int NM = 1000;
int N, S, a[NM+5];
vector <pii> ans;
void process(int i){
if (a[i] < (a[i]^a[i+1]) || (S == 2 && a[i] == (a[i]^a[i+1]))){
a[i+1] ^= a[i];
ans.push_back(mp(i+1, i));
}
else{
a[i] ^= a[i+1];
ans.push_back(mp(i, i+1));
}
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> N >> S;
for (int i = 1; i <= N; i++) cin >> a[i];
while (true){
bool ok = 1;
for (int i = 1; i < N; i++)
if (a[i] > a[i+1] || (S == 1 && a[i] == a[i+1])){
process(i);
ok = 0;
}
if (ok) break;
}
cout << ans.size() << '\n';
for (int i = 0; i < ans.size(); i++)
cout << ans[i].fi << ' ' << ans[i].se << '\n';
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |