Submission #1226301

#	Time	Username	Problem	Language	Result	Execution time	Memory
1226301		faruk	Sorting (IOI15_sorting)	C++20	16 / 100	10 ms	328 KiB

sorting

#include "sorting.h"
#include <bits/stdc++.h>
#define all(a) a.begin(), a.end()

using namespace std;

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
	
	for (int i = 0; i < M; i++) {
		// create temp array and do all the swaps
		swap(S[X[i]], S[Y[i]]);
		vector<int> tmp(S, S + N);
		for (int j = i + 1; j < M; j++)	
			swap(tmp[X[j]], tmp[Y[j]]);
		
		int get_to_right_place = -1;
		for (int j = 0; j < N; j++) 
			if (tmp[j] != j)
				get_to_right_place = tmp[j];

		if (get_to_right_place == -1)
		{
			for (int j = i; j < M; j++)
				P[j] = Q[j] = 0;
			break;
		}
		int in_my_place = tmp[get_to_right_place];

		int id1 = find(S, S + N, get_to_right_place) - S, id2 = find(S, S + N, in_my_place) - S;
		swap(S[id1], S[id2]);
		P[i] = id1, Q[i] = id2;
	}

	return M;
}

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