Submission #1098374

#	Time	Username	Problem	Language	Result	Execution time	Memory
1098374		alexander707070	Sorting (IOI15_sorting)	C++14	20 / 100	6 ms	600 KiB

sorting

#include<bits/stdc++.h>
#include "sorting.h"

#define MAXN 200007
using namespace std;

int n,m,q;
int pos[MAXN],s[MAXN];

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    n=N; m=M;

	if(n==1)return 0;

	for(int i=0;i<n;i++)s[i]=S[i];

	for(int i=0;i<n;i++){
		if(X[0]==0 and Y[0]==1)swap(s[0],s[1]);

		for(int f=0;f<n;f++){
			if(s[f]==i){

				P[i]=i; Q[i]=f;
				swap(s[i],s[f]);
			}
		}
	}

	q=n;
	while(q>0 and P[q-1]==Q[q-1]){
		if(X[0]==0 and Y[0]==1)swap(s[0],s[1]);
		q--;
	}

	if(s[0]>s[1]){
		q++;
		P[q-1]=Q[q-1]=0;
	}

	for(int i=0;i<n;i++)s[i]=S[i];
	
	for(int i=0;i<q;i++){
		for(int t=0;t<n-1;t++){
			if(s[t]>s[t+1])break;
			else if(t==n-2)return i;
		}

		if(X[0]==0 and Y[0]==1)swap(s[0],s[1]);
		swap(s[P[i]],s[Q[i]]);
	}

	return q;
}

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