Submission #135297

#	Time	Username	Problem	Language	Result	Execution time	Memory
135297		StevenH	Sorting (IOI15_sorting)	C++14	0 / 100	3 ms	504 KiB

sorting

#include "sorting.h"
#include <algorithm>
#include <cstdlib>
#include <cstdio>
 
using namespace std;
 
int ele[1000];
 
void swap(int &x ,int &y)
{int t=x; x=y; y=t;}
 
int comp(int x,int y)
{return x<y;}
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
	for (int i=0; i<N; i++)
		ele[i]=S[i];
 
	sort(ele,ele+N,comp);
 
	int R=0;
 

	for(int i=0; i<N; i++)
	{
		swap(X[i],Y[i]);
		int j;
		for(j=i;j<N;j++)
			if(S[j]==ele[i])
				break;
		if(i==1 && ele[0] == S[1])
		{
			P[R]=0;
			Q[R]=j;
			R++;
			swap(S[i],S[j]);
			continue;
		}
		P[R]=j;
		Q[R]=i;
		R++;
		swap(S[i],S[j]);
	}

	if (X[0]==0 && Y[0]==1)
	{
		if(S[0]>S[1])
		{
			P[R]=0;
			Q[R]=0;
			R++;
			swap(S[0],S[0]);
		}
	}
	return R;
}	
 

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:15:39: warning: unused parameter 'M' [-Wunused-parameter]
 int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
                                       ^

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