Submission #743768

#	Time	Username	Problem	Language	Result	Execution time	Memory
743768		Abrar_Al_Samit	Sorting (IOI15_sorting)	C++17	0 / 100	2 ms	368 KiB

sorting

#include <bits/stdc++.h>
#include "sorting.h"
using namespace std;

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
	if(N<3) {

	}

	int at[N];
	for(int i=0; i<N; ++i) {
		at[S[i]] = i;
	}	

	for(int i=0; i<N-2; ++i) {
		swap(S[X[i]], S[Y[i]]);
		at[S[0]] = 0;
		at[S[1]] = 1;

		int pos = N-i-1;

		if(at[pos]==pos) {
			P[i] = Q[i] = 0;
		} else {
			P[i] = at[pos], Q[i] = pos;
			swap(S[pos], S[at[pos]]);
			at[S[at[pos]]] = at[pos];
			at[pos] = pos;
		}

		if(i==N-3) {
			if(at[0]==0) return i+1;
			else {
				P[i+1] = Q[i+1] = 0;
				return i+2;
			}
		}
	}
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:5:39: warning: unused parameter 'M' [-Wunused-parameter]
    5 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                   ~~~~^
sorting.cpp:39:1: warning: control reaches end of non-void function [-Wreturn-type]
   39 | }
      | ^

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