oj.uz

Submission #579952

# Submission time Handle Problem Language Result Execution time Memory
579952 2022-06-20T10:35:25 Z drdilyor Xor Sort (eJOI20_xorsort) C++17
40 / 100
 8 ms 984 KB 
#if defined(ONPC) && !defined(_GLIBCXX_ASSERTIONS)
    #define _GLIBCXX_ASSERTIONS
#endif
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#ifdef ONPC
    #include "t_debug.cpp"
#else
    #define debug(...) 42
#endif
#define allit(a) (a).begin(), (a).end()
#define sz(a) ((int) (a).size())

using namespace std;
using ll = long long;
using vi = vector<int>;
namespace pd = __gnu_pbds;
template<typename K>
using ordered_set = pd::tree<K, pd::null_type, less<int>, pd::rb_tree_tag, pd::tree_order_statistics_node_update>;
template<typename... T>
using gp_hash_table = pd::gp_hash_table<T...>;//simple using statement gives warnings

const int INF = 1e9;
const ll INFL = 1e18;
const int N = 1e5;
const int K = 20; // 20
const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
mt19937 rng(RANDOM);

int solve() {
#define DO(i, j) {res.emplace_back(i, j); a[i] ^= a[j];}
    int n, s; cin >> n >> s;
    vi a(n); for (auto& i : a) cin >> i;

    vector<pair<int,int>> res;
    int found_count = 0;

    for (int b = 1 << K; b >= 1; b >>= 1) {
        //move bit to end
        int found = 0;
        for (int i = 0; i < n - found_count - 1; i++) {
            if (a[i] & b) {
                found = 1;
                if (!(a[i+1] & b)) { DO(i+1, i); }
                DO(i, i+1);
            }
        }
        found_count += found;
    }
#ifdef ONPC
    debug(a);
    for (int i = 0; i < n-1; i++) {
        assert(s == 1 ? a[i] < a[i+1] : a[i] <= a[i+1]);
    }
#endif
//#ifndef ONPC
    cout << res.size() << '\n';
    for (auto [i, j] : res) cout << i+1 << ' ' << j+1 << '\n';
//#endif
    return 0;
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    int t = 1;
#ifdef ONPC
    cin >> t;
#endif
    while (t-- && cin) {
        if (solve()) break;
        #ifdef ONPC
            cout << "____________________" << endl;
        #endif
    }
    return 0;
}

Subtask #1
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Incorrect 1 ms 324 KB Not sorted
4 Halted 0 ms 0 KB -

Subtask #2
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Incorrect 1 ms 324 KB Not sorted
4 Halted 0 ms 0 KB -

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 5 ms 856 KB Output is correct
6 Correct 5 ms 856 KB Output is correct
7 Correct 6 ms 856 KB Output is correct
8 Correct 6 ms 856 KB Output is correct
9 Correct 6 ms 840 KB Output is correct
10 Correct 5 ms 888 KB Output is correct
11 Correct 6 ms 856 KB Output is correct
12 Correct 5 ms 976 KB Output is correct
13 Correct 6 ms 856 KB Output is correct
14 Correct 8 ms 968 KB Output is correct
15 Correct 7 ms 984 KB Output is correct