Submission #1218859

#	Time	Username	Problem	Language	Result	Execution time	Memory
1218859		vidux	Sorting (IOI15_sorting)	C++17	0 / 100	1 ms	324 KiB

sorting

#include "sorting.h"

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef pair<ll, ll> pll;
typedef vector<ll> vl;

const ll LLINF = 1e18;

int findSwapPairs(int N, int a[], int M, int X[], int Y[], int P[], int Q[]) {
	int n = N;
	int l = 0, r = M;
	int ans = 0;
	auto opCnt = [&]() -> ll {
		vi pos(n);
		vi b(n);
		ll cnt = 0;
		for (int i = 0; i < n; i++) pos[a[i]] = i, b[i] = a[i];
		for (int i = 0; i < n; i++) {
			if (b[i] != i) {
				int p = pos[i];
				swap(b[i], b[p]);
				swap(pos[i], pos[p]);
				P[cnt] = i;
				Q[cnt] = p;
				cnt++;
			}
		}
		return cnt;
	};
	cout << opCnt() << endl;
	return opCnt();
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 12
• Subtask 3: 0 / 16
• Subtask 4: 0 / 18
• Subtask 5: 0 / 20
• Subtask 6: 0 / 26