oj.uz

Submission #464009

# Submission time Handle Problem Language Result Execution time Memory
464009 2021-08-12T07:35:03 Z tengiz05 Xor Sort (eJOI20_xorsort) C++17
25 / 100
 11 ms 1228 KB 
#include <bits/stdc++.h>

std::mt19937 rnd(std::chrono::steady_clock::now().time_since_epoch().count());

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;
        
    if (S == 1) {
        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];
        };
        while (!std::is_sorted(a.begin(), a.end())) {
            for (int j = 1; j < n; j++) {
                if (a[j - 1] > a[j]) {
                    swap(j - 1, j);
                }
            }
        }
    } else {
        auto swap = [&](int i, int j) {
            ans.emplace_back(i, j);
            ans.emplace_back(j, i);
            a[i] ^= a[j];
            a[j] ^= a[i];
        };
        for (int i = 19; i >= 0; i--) {
            for (int j = 0; j < n - 1; j++) {
                if (a[j] >> i & 1) {
                    if (a[j + 1] >> i & 1) {
                        ans.emplace_back(j, j + 1);
                        a[j] ^= a[j + 1];
                    } else {
                        swap(j + 1, j);
                    }
                }
            }
        }
    }
    
    std::cout << ans.size() << "\n";
    for (auto [i, j] : ans) {
        std::cout << i + 1 << " " << j + 1 << "\n";
    }
    
    return 0;
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory 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 4 ms 592 KB Output is correct
6 Correct 3 ms 592 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 4 ms 592 KB Output is correct
9 Correct 4 ms 720 KB Output is correct
10 Correct 5 ms 592 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 7 ms 848 KB Output is correct
13 Correct 7 ms 848 KB Output is correct
14 Correct 7 ms 848 KB Output is correct
15 Correct 6 ms 976 KB Output is correct

Subtask #2
0 / 35.0

# Verdict Execution time Memory 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 4 ms 592 KB Output is correct
6 Correct 3 ms 592 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 4 ms 592 KB Output is correct
9 Correct 4 ms 720 KB Output is correct
10 Correct 5 ms 592 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 7 ms 848 KB Output is correct
13 Correct 7 ms 848 KB Output is correct
14 Correct 7 ms 848 KB Output is correct
15 Correct 6 ms 976 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 4 ms 592 KB Output is correct
18 Correct 6 ms 848 KB Output is correct
19 Correct 6 ms 848 KB Output is correct
20 Correct 6 ms 848 KB Output is correct
21 Correct 6 ms 776 KB Output is correct
22 Correct 6 ms 824 KB Output is correct
23 Correct 6 ms 848 KB Output is correct
24 Correct 6 ms 848 KB Output is correct
25 Correct 6 ms 860 KB Output is correct
26 Incorrect 11 ms 1228 KB Integer 59568 violates the range [0, 40000]
27 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

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