Submission #463929

#	Time	Username	Problem	Language	Result	Execution time	Memory
463929		tengiz05	Xor Sort (eJOI20_xorsort)	C++17	25 / 100	11 ms	1212 KiB

xorsort

#include <bits/stdc++.h>

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int n, S;
    std::cin >> n >> S;
    
    std::vector<int> a(n);
    for (int i = 0; i < n; i++) {
        std::cin >> a[i];
    }
    
    std::vector<std::pair<int, int>> ans;
    
    auto swap = [&](int i, int j) {
        ans.emplace_back(i, j);
        ans.emplace_back(j, i);
        ans.emplace_back(i, j);
        a[i] ^= a[j];
        a[j] ^= a[i];
        a[i] ^= a[j];
    };
    
    if (S == 1) {
        std::vector<int> p(n);
        std::iota(p.begin(), p.end(), 0);
        for (int i = 0; i < n; i++) {
            for (int j = 1; j < n; j++) {
                if (a[p[j - 1]] > a[p[j]]) {
                    swap(p[j - 1], p[j]);
                }
            }
        }
    }
    
    std::cout << ans.size() << "\n";
    for (auto [i, j] : ans) {
        std::cout << i + 1 << " " << j + 1 << "\n";
    }
    
    return 0;
}

• Subtask 1: 25 / 25
• Subtask 2: 0 / 35
• Subtask 3: 0 / 40