oj.uz

Submission #743705

# Submission time Handle Problem Language Result Execution time Memory
743705 2023-05-17T18:22:55 Z borisAngelov Xor Sort (eJOI20_xorsort) C++17
0 / 100
 0 ms 212 KB 
#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;

    for (int i = n; i >= 1; --i)
    {
        int mx = 0;
        int idx = -1;

        for (int j = 1; j <= i; ++j)
        {
            if (mx < a[j])
            {
                mx = a[j];
                idx = j;
            }
        }

        if (idx == i)
        {
            continue;
        }

        ans.push_back(make_pair(idx, i));
        ans.push_back(make_pair(i, idx));
        ans.push_back(make_pair(idx, i));

        swap(a[i], a[idx]);
    }

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

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

    return 0;
}

Subtask #1
0 / 25.0

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

Subtask #2
0 / 35.0

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

Subtask #3
0 / 40.0

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