Submission #1012291

#	Time	Username	Problem	Language	Result	Execution time	Memory
1012291		aykhn	Sorting (IOI15_sorting)	C++17	20 / 100	1 ms	348 KiB

sorting

#include "sorting.h"
#include <bits/stdc++.h>
 
using namespace std;
 
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) 
{
	for (int R = 0; R <= M; R++)
	{
		int f = -1;
		for (int i = 0; i < N; i++)
		{
			if (S[i] != i)
			{
				f = i;
				break;
			}
		}
		if (f == -1) return R;
      	swap(X[R], Y[R]);
		f = 0;
		for (int i = 0; i < N; i++)
		{
			if (S[i] != i)
			{
				f = i;
				break;
			}
		}
		P[R] = f, Q[R] = S[f];
		swap(S[f], S[S[f]]);
	}
	assert(0);
	return -1;
}

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