oj.uz

Submission #743701

# Submission time Handle Problem Language Result Execution time Memory
743701 2023-05-17T17:59:45 Z borisAngelov Xor Sort (eJOI20_xorsort) C++17
25 / 100
 140 ms 12496 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;

    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.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 7 ms 712 KB Output is correct
6 Correct 3 ms 600 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 5 ms 700 KB Output is correct
9 Correct 4 ms 728 KB Output is correct
10 Correct 5 ms 724 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 6 ms 968 KB Output is correct
13 Correct 9 ms 968 KB Output is correct
14 Correct 6 ms 984 KB Output is correct
15 Correct 8 ms 984 KB Output is correct

Subtask #2
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 7 ms 712 KB Output is correct
6 Correct 3 ms 600 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 5 ms 700 KB Output is correct
9 Correct 4 ms 728 KB Output is correct
10 Correct 5 ms 724 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 6 ms 968 KB Output is correct
13 Correct 9 ms 968 KB Output is correct
14 Correct 6 ms 984 KB Output is correct
15 Correct 8 ms 984 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 4 ms 600 KB Output is correct
18 Correct 5 ms 856 KB Output is correct
19 Correct 6 ms 856 KB Output is correct
20 Correct 10 ms 856 KB Output is correct
21 Correct 5 ms 856 KB Output is correct
22 Correct 5 ms 856 KB Output is correct
23 Correct 6 ms 856 KB Output is correct
24 Correct 6 ms 840 KB Output is correct
25 Correct 5 ms 856 KB Output is correct
26 Incorrect 11 ms 1236 KB Integer 59568 violates the range [0, 40000]
27 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 7 ms 856 KB Output is correct
5 Incorrect 140 ms 12496 KB Integer 764742 violates the range [0, 40000]
6 Halted 0 ms 0 KB -