oj.uz

Submission #465997

# Submission time Handle Problem Language Result Execution time Memory
465997 2021-08-17T13:17:19 Z Sench2006 Xor Sort (eJOI20_xorsort) C++14
100 / 100
 68 ms 992 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ar array

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define lb lower_bound
#define ub upper_bound

#define FOR(i, a, b) for(auto i = a; i < b; i++)
#define FORD(i, a, b) for(auto i = a - 1; i >= b; i--)
#define trav(x, v) for(auto x : v)

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

// ---------------------------------------- Solution ---------------------------------------- //

const int N = 1005;
int s, n;
int a[N], b[N];

void solve1() {
    vector <pair<int, int>> ans;
    FOR(i, 1, n + 1) b[i] = a[i];
    FOR(i, 1, n) a[i] ^= a[i + 1], ans.push_back(make_pair(i, i + 1));
    int lastMx = 0;
    FOR(i, 0, n - 1) {
        lastMx = 0;
        FOR(j, 1, n - i + 1) if (b[j] > b[lastMx]) lastMx = j;
        FOR(j, lastMx + 1, n - i + 1) a[j] ^= a[j - 1], ans.push_back(make_pair(j, j - 1)), swap(b[j], b[j - 1]);
        FOR(j, max(lastMx - 1, 1), n - i) a[j] ^= a[j + 1], ans.push_back(make_pair(j, j + 1));
    }    
    cout << ans.size() << endl;
    FOR(i, 0, ans.size()) {
       cout << ans[i].first << " " << ans[i].second << endl;
    }
}

void solve2() {
    vector <pair<int, int>> ans;
    for(int i = 1; i <= (1 << 20); i *= 2) {
        FOR(j, 1, n) {
            if((i&a[j])) {
                if(!(i&a[j + 1])) {
                    ans.push_back({j + 1,j});
                    a[j + 1] ^= a[j];
                }
                ans.push_back({j, j + 1});
                a[j] ^= a[j + 1];
            }
        }
    }
    cout << ans.size() << endl;
    FOR(i, 0, ans.size()) {
       cout << ans[i].first << " " << ans[i].second << endl;
    }
}

void solve() {
    cin >> n >> s;
    FOR(i, 1, n + 1) {
        cin >> a[i];
    }
    if (s == 1) solve1();
    else solve2();
}

int main() {
    fastio;
    
    int tests = 1;
    // cin >> tests;
    while (tests--) {
        solve();
    }

    return 0;
}

Compilation message

xorsort.cpp: In function 'void solve1()':
xorsort.cpp:12:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 | #define FOR(i, a, b) for(auto i = a; i < b; i++)
......
   36 |     FOR(i, 0, ans.size()) {
      |         ~~~~~~~~~~~~~~~~                
xorsort.cpp:36:5: note: in expansion of macro 'FOR'
   36 |     FOR(i, 0, ans.size()) {
      |     ^~~
xorsort.cpp: In function 'void solve2()':
xorsort.cpp:12:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 | #define FOR(i, a, b) for(auto i = a; i < b; i++)
......
   56 |     FOR(i, 0, ans.size()) {
      |         ~~~~~~~~~~~~~~~~                
xorsort.cpp:56:5: note: in expansion of macro 'FOR'
   56 |     FOR(i, 0, ans.size()) {
      |     ^~~

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 3 ms 332 KB Output is correct
4 Correct 18 ms 588 KB Output is correct
5 Correct 23 ms 600 KB Output is correct
6 Correct 20 ms 612 KB Output is correct
7 Correct 19 ms 604 KB Output is correct
8 Correct 20 ms 564 KB Output is correct
9 Correct 21 ms 584 KB Output is correct
10 Correct 22 ms 604 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 37 ms 684 KB Output is correct
13 Correct 40 ms 700 KB Output is correct
14 Correct 37 ms 720 KB Output is correct
15 Correct 37 ms 720 KB Output is correct

Subtask #2
35.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 3 ms 332 KB Output is correct
4 Correct 18 ms 588 KB Output is correct
5 Correct 23 ms 600 KB Output is correct
6 Correct 20 ms 612 KB Output is correct
7 Correct 19 ms 604 KB Output is correct
8 Correct 20 ms 564 KB Output is correct
9 Correct 21 ms 584 KB Output is correct
10 Correct 22 ms 604 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 37 ms 684 KB Output is correct
13 Correct 40 ms 700 KB Output is correct
14 Correct 37 ms 720 KB Output is correct
15 Correct 37 ms 720 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 21 ms 600 KB Output is correct
18 Correct 34 ms 716 KB Output is correct
19 Correct 37 ms 832 KB Output is correct
20 Correct 33 ms 720 KB Output is correct
21 Correct 34 ms 740 KB Output is correct
22 Correct 35 ms 748 KB Output is correct
23 Correct 37 ms 760 KB Output is correct
24 Correct 33 ms 704 KB Output is correct
25 Correct 33 ms 720 KB Output is correct
26 Correct 68 ms 976 KB Output is correct
27 Correct 66 ms 968 KB Output is correct
28 Correct 67 ms 992 KB Output is correct
29 Correct 65 ms 976 KB Output is correct
30 Correct 67 ms 976 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 4 ms 332 KB Output is correct
4 Correct 10 ms 460 KB Output is correct
5 Correct 51 ms 896 KB Output is correct
6 Correct 50 ms 872 KB Output is correct
7 Correct 50 ms 892 KB Output is correct
8 Correct 51 ms 876 KB Output is correct
9 Correct 50 ms 912 KB Output is correct
10 Correct 51 ms 900 KB Output is correct
11 Correct 50 ms 816 KB Output is correct
12 Correct 51 ms 948 KB Output is correct
13 Correct 52 ms 812 KB Output is correct
14 Correct 53 ms 932 KB Output is correct
15 Correct 68 ms 976 KB Output is correct