oj.uz

답안 #465936

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
465936 2021-08-17T11:29:09 Z Alen777 Xor Sort (eJOI20_xorsort) C++14
65 / 100
 99 ms 1264 KB 
#include <iostream>
#include <string>
#include <iomanip>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <algorithm>
#include <cstring>
using namespace std;

#define ll long long
#define ull unsigned ll
#define pb push_back
#define mpr make_pair
#define lb lower_bound
#define ld long double
#define ub upper_bound

map<pair<int, int>, bool> m;
int n, s;
int a[100005];

void solve() {
    cin >> n >> s;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    vector<pair<int, int> > ans;
    if (s == 1) {
        for (int i = 0; i < n - 1; i++) {
            for (int j = 0; j < n - i - 1; j++) {
                if (a[j] > a[j + 1]) {
                    ans.push_back(mpr(j, j + 1));
                    ans.push_back(mpr(j + 1, j));
                    ans.push_back(mpr(j, j + 1));
                    swap(a[j], a[j + 1]);
                }
            }
        }
    }
    else {
        for (int i = 1; i <= (1 << 20); i *= 2) {
            for (int j = 0; j < n - 1; j++) {
                if ((i & a[j]) && !(i & a[j + 1])) {
                    ans.push_back(mpr(j + 1, j));
                    ans.push_back(mpr(j, j + 1));
                    a[j + 1] = a[j + 1] ^ a[j];
                    a[j] = a[j] ^ a[j + 1];
                }
                else if (i & a[j]) {
                    ans.push_back(mpr(j, j + 1));
                    a[j] = a[j] ^ a[j + 1];
                }
            }
        }
    }
    cout << ans.size() << endl;
    for (auto i : ans) {
        cout << i.first + 1 << ' ' << i.second + 1 << endl;
    }
}

int main() {
    /*cout.setf(ios::fixed | ios::showpoint);
    cout.precision(6);*/
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 30 ms 660 KB Output is correct
5 Correct 30 ms 652 KB Output is correct
6 Correct 28 ms 716 KB Output is correct
7 Correct 28 ms 716 KB Output is correct
8 Correct 28 ms 716 KB Output is correct
9 Correct 32 ms 688 KB Output is correct
10 Correct 31 ms 752 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 55 ms 976 KB Output is correct
13 Correct 67 ms 976 KB Output is correct
14 Correct 58 ms 976 KB Output is correct
15 Correct 56 ms 976 KB Output is correct

Subtask #2
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 30 ms 660 KB Output is correct
5 Correct 30 ms 652 KB Output is correct
6 Correct 28 ms 716 KB Output is correct
7 Correct 28 ms 716 KB Output is correct
8 Correct 28 ms 716 KB Output is correct
9 Correct 32 ms 688 KB Output is correct
10 Correct 31 ms 752 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 55 ms 976 KB Output is correct
13 Correct 67 ms 976 KB Output is correct
14 Correct 58 ms 976 KB Output is correct
15 Correct 56 ms 976 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 30 ms 716 KB Output is correct
18 Correct 49 ms 828 KB Output is correct
19 Correct 50 ms 872 KB Output is correct
20 Correct 48 ms 760 KB Output is correct
21 Correct 51 ms 848 KB Output is correct
22 Correct 51 ms 920 KB Output is correct
23 Correct 51 ms 860 KB Output is correct
24 Correct 49 ms 812 KB Output is correct
25 Correct 54 ms 828 KB Output is correct
26 Incorrect 99 ms 1264 KB Integer 59568 violates the range [0, 40000]
27 Halted 0 ms 0 KB -

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 10 ms 456 KB Output is correct
5 Correct 52 ms 852 KB Output is correct
6 Correct 50 ms 900 KB Output is correct
7 Correct 50 ms 796 KB Output is correct
8 Correct 50 ms 840 KB Output is correct
9 Correct 51 ms 916 KB Output is correct
10 Correct 49 ms 888 KB Output is correct
11 Correct 50 ms 960 KB Output is correct
12 Correct 51 ms 840 KB Output is correct
13 Correct 52 ms 912 KB Output is correct
14 Correct 51 ms 832 KB Output is correct
15 Correct 67 ms 1036 KB Output is correct