oj.uz

Submission #1087943

# Submission time Handle Problem Language Result Execution time Memory
1087943 2024-09-13T15:08:06 Z SulA Xor Sort (eJOI20_xorsort) C++17
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define bitcount __builtin_popcountll
using namespace std;
using namespace __gnu_pbds;
using namespace chrono;

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);

    int n; cin >> n;
    int a[n]; for (int i = 0; i < n; cin >> a[i++]);
    auto oper = [&](int& x, int& y) {
        x ^= y;
    };

    vector<pair<int,int>> operations;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) if (a[i] > a[j]) {
            oper(a[i], a[j]);
            oper(a[j], a[i]);
            oper(a[i], a[j]);
            operations.emplace_back(i, j);
            operations.emplace_back(j, i);
            operations.emplace_back(i, j);
        }
    }
    cout << operations.size() << "\n";
    for (auto [i, j] : operations) cout << i+1 << " " << j+1 << '\n';
}

Subtask #1
0 / 25.0

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

Subtask #2
0 / 35.0

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

Subtask #3
0 / 40.0

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