Submission #1098428

#	Time	Username	Problem	Language	Result	Execution time	Memory
1098428		alexander707070	Sorting (IOI15_sorting)	C++14	54 / 100	1078 ms	680 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 to[MAXN];

bool check(){
	for(int i=0;i<n-1;i++){
		if(s[i]>s[i+1])return false;
	}

	return true;
}

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


	for(int stop=0;stop<n;stop++){

		for(int i=0;i<n;i++)s[i]=i;
		for(int i=0;i<stop;i++)swap(s[X[i]],s[Y[i]]);

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

		for(int i=0;i<stop;i++){
			P[i]=Q[i]=0;

			swap(s[X[i]],s[Y[i]]);
			swap(to[X[i]],to[Y[i]]);

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

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

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

		for(int i=0;i<n;i++){
			if(check())return i;

			swap(s[X[i]],s[Y[i]]);
			swap(s[P[i]],s[Q[i]]);
		}

		if(check())return q;
	}
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:64:1: warning: control reaches end of non-void function [-Wreturn-type]
   64 | }
      | ^

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