Submission #466050

#	Time	Username	Problem	Language	Result	Execution time	Memory
466050		gagik_2007	Xor Sort (eJOI20_xorsort)	C++17	25 / 100	1092 ms	17296 KiB

xorsort

#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <iomanip>
#include <unordered_set>
using namespace std;

#define ll long long
#define ff first
#define ss second

ll n, m, m1, m2, k;
ll MOD = 1e9 + 7;
ll INF = 1e18 + 7;
ll ttt;
ll a[1007];
vector<pair<ll, ll>>ans;

int main()
{
    cin >> n >> m;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    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({ j + 1,j });
                ans.push_back({ j,j + 1 });
                ans.push_back({ j + 1,j });
                ll tmp = a[j];
                a[j] = a[j + 1];
                a[j + 1] = tmp;
            }
        }
    }
    cout << ans.size() << endl;
    for (int i = 0; i < ans.size(); i++) {
        cout << ans[i].ff + 1 << " " << ans[i].ss + 1 << endl;
    }
    return 0;
}

Compilation message (stderr)

xorsort.cpp: In function 'int main()':
xorsort.cpp:45:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |     for (int i = 0; i < ans.size(); i++) {
      |                     ~~^~~~~~~~~~~~

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