oj.uz

Submission #463996

# Submission time Handle Problem Language Result Execution time Memory
463996 2021-08-12T06:47:53 Z tengiz05 Xor Sort (eJOI20_xorsort) C++17
25 / 100
 9 ms 1100 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;
    
    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];
    };
    
    for (int i = 0; i < 1000; i++) {
        int l = rnd() % (n - 1);
        int r = l + 1;
        int type = rnd() % 2;
        if (type) {
            std::swap(l, r);
        }
        a[l] ^= a[r];
        ans.emplace_back(l, r);
    }
    
    if (S == 1) {
        while (!std::is_sorted(a.begin(), a.end())) {
            for (int j = 1; j < n; j++) {
                if (a[j - 1] > a[j]) {
                    int ready = rnd() % 2;
                    if (ready != -1 && (a[j] ^ a[j - 1]) > a[j - 1] && !std::count(a.begin(), a.end(), (a[j] ^ a[j - 1]))) {
                        a[j] ^= a[j - 1];
                        ans.emplace_back(j, 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 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 5 ms 720 KB Output is correct
5 Correct 5 ms 732 KB Output is correct
6 Correct 4 ms 720 KB Output is correct
7 Correct 5 ms 720 KB Output is correct
8 Correct 5 ms 720 KB Output is correct
9 Correct 5 ms 720 KB Output is correct
10 Correct 5 ms 720 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 5 ms 720 KB Output is correct
13 Correct 5 ms 720 KB Output is correct
14 Correct 4 ms 720 KB Output is correct
15 Correct 5 ms 692 KB Output is correct

Subtask #2
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 5 ms 720 KB Output is correct
5 Correct 5 ms 732 KB Output is correct
6 Correct 4 ms 720 KB Output is correct
7 Correct 5 ms 720 KB Output is correct
8 Correct 5 ms 720 KB Output is correct
9 Correct 5 ms 720 KB Output is correct
10 Correct 5 ms 720 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 5 ms 720 KB Output is correct
13 Correct 5 ms 720 KB Output is correct
14 Correct 4 ms 720 KB Output is correct
15 Correct 5 ms 692 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 5 ms 720 KB Output is correct
18 Incorrect 9 ms 1100 KB Integer 44570 violates the range [0, 40000]
19 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

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