제출 #743701

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
743701		borisAngelov	Xor Sort (eJOI20_xorsort)	C++17	25 / 100	140 ms	12496 KiB

xorsort

#include <iostream>
#include <vector>

using namespace std;

const int maxn = 1005;

int n, s;

int a[maxn];

void fastIO()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

int main()
{
    fastIO();

    cin >> n >> s;

    for (int i = 1; i <= n; ++i)
    {
        cin >> a[i];
    }

    vector<pair<int, int>> ans;

    while (true)
    {
        bool has_swap = false;

        for (int i = 1; i < n; ++i)
        {
            if (a[i] > a[i + 1])
            {
                ans.push_back(make_pair(i, i + 1));
                ans.push_back(make_pair(i + 1, i));
                ans.push_back(make_pair(i, i + 1));

                swap(a[i], a[i + 1]);

                has_swap = true;
            }
        }

        if (has_swap == false)
        {
            break;
        }
    }

    cout << ans.size() << endl;

    for (auto [x, y] : ans)
    {
        cout << x << ' ' << y << "\n";
    }

    return 0;
}

• Subtask 1: 25 / 25
• Subtask 2: 0 / 35
• Subtask 3: 0 / 40