Submission #426096

#	Time	Username	Problem	Language	Result	Execution time	Memory
426096		_fractal	Sorting (IOI15_sorting)	C++14	36 / 100	1086 ms	620 KiB

sorting

#include "sorting.h"
#include <iostream>
#include <algorithm>
using namespace std;
 

int findSwapPairs(int N, int SS[], int M, int X[], int Y[], int P[], int Q[]) {
	int A[N], pos[N], L[M], R[M], ret = (1<<30), S[N];
	for (int m = 0; m < M; ++m) {
		for (int i = 0; i < N; ++i)
			A[i] = i, S[i] = SS[i];
		for (int i = m; i >= 0; --i)
			swap(A[X[i]], A[Y[i]]);
		int r = -1;
		for (int i = 0; i <= m; ++i) {
			P[i] = Q[i] = 0;
			bool f = 1;
			for (int j = 1; j < N; ++j)
				if (S[j - 1] > S[j])
					f = 0;
			if (f) {
				r = i;
				break;
			}
			swap(S[X[i]], S[Y[i]]);
			swap(A[X[i]], A[Y[i]]);
			f = 1;
			for (int j = 1; j < N; ++j)
				if (S[j - 1] > S[j])
					f = 0;
			if (f) {
				r = i + 1;
				break;
			}
			for (int j = 0; j < N; ++j)
				pos[A[j]] = j;
			for (int j = 0; j < N; ++j) {
				if (pos[S[j]] != j) {
					Q[i] = j, P[i] = pos[S[j]];
					break;
				}
			}
			swap(S[Q[i]], S[P[i]]);
		}
		bool f = 1;
		for (int i = 1; i < N; ++i)
			if (S[i - 1] > S[i])
				f = 0;
		if (!f) continue;
		if (r == -1) r = m + 1;
		if (ret >= r) {
			ret = r;
			for (int i = 0; i < r; ++i)
				L[i] = Q[i], R[i] = P[i];
		}
	}
	for (int i = 0; i < ret; ++i)
		Q[i] = L[i], P[i]= R[i];
	for (int i = 0; i < ret; ++i)
		cerr << X[i] << " " << Y[i] << "\n" << P[i] << " " << Q[i] << '\n';
	return ret;
}

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