Submission #428294

#	Time	Username	Problem	Language	Result	Execution time	Memory
428294		haxorman	Sorting (IOI15_sorting)	C++14	36 / 100	1080 ms	516 KiB

sorting

#include "sorting.h"
#include "bits/stdc++.h"
using namespace std;

const int mxN = 2e5 + 7;

int n, m, arr[mxN], freq[mxN];

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
	n = N, m = M;

	for (int i = 0; i < n; ++i) {
		arr[i] = S[i];
	}

	for (int i = 0; i < m; ++i) {
		freq[X[i]]++;
		freq[Y[i]]++;
	}

	int R = 0;
	bool ok = false;
	for (int ind = 0; ind < m; ++ind) {
		ok = true;
		for (int i = 0; i < n; ++i) {
			if (arr[i] != i) {
				ok = false;
			}
		}

		if (ok) {
			break;
		}
		
		swap(arr[X[ind]], arr[Y[ind]]);
		freq[X[ind]]--;
		freq[Y[ind]]--;

		ok = true;
		for (int i = 0; i < n; ++i) {
			if (arr[i] != i) {
				ok = false;
			}
		}

		if (ok) {
			P[ind] = Q[ind] = 0;
			++R;
			break;
		}

		bool stop = false;
		for (int i = 0; i < n && !stop; ++i) {
			if (freq[i])
				continue;

			for (int j = 0; j < n && !stop; ++j) {
				if (arr[j] == i && i != j) {
					swap(arr[j], arr[i]);
					P[ind] = j, Q[ind] = i;
					++R;
					stop = true;
				}
			}
		}

		if (!stop) {
			P[ind] = Q[ind] = 0;
			++R;
		}

	}

	return R;
}

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