Submission #135281

#	Time	Username	Problem	Language	Result	Execution time	Memory
135281		StevenH	Sorting (IOI15_sorting)	C++14	0 / 100	4 ms	508 KiB

sorting

#include "sorting.h"
#include <algorithm>
#include <cstdlib>
#include <cstdio>

using namespace std;

struct Ele{
	int val,id;
}ele[1000];

bool comp(Ele x,Ele y)
{
	return x.val<y.val;
}

void swap(int &x ,int &y)
{int t=x; x=y; y=t;}
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    P[0] = 0;
	Q[0] = 0;

	for (int i=0; i<N; i++)
		ele[i].val=S[i],ele[i].id=i;

	sort(ele,ele+N,comp);

	int R=0;

	for(int i=2; i<N; i++)
	{
		int j;
		for(j=0;j<N;j++)
			if(S[j]==ele[i].val)
				break;
		P[R]=j;
		Q[R]=i;
		R++;
		swap(S[i],S[j]);
	}

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

	return R;
}	

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:19: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