Submission #434537

#	Time	Username	Problem	Language	Result	Execution time	Memory
434537		Azimjon	Sorting (IOI15_sorting)	C++17	0 / 100	2 ms	332 KiB

sorting

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

using namespace std;

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

	for (int i = N - 1; i >= 2; i--) {
		swap(S[0], S[1]);
		int j = i;
		while (S[j] != i)
			j--;

		// if (i == j) continue;

		P[lst] = i;
		Q[lst] = j;

		swap(S[i], S[j]);

		lst++;
	}

	if (S[0] == 1) {
		P[lst] = 0;
		Q[lst] = 0;
		lst++;
	}

	return lst;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:6:39: warning: unused parameter 'M' [-Wunused-parameter]
    6 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                   ~~~~^
sorting.cpp:6:46: warning: unused parameter 'X' [-Wunused-parameter]
    6 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                          ~~~~^~~
sorting.cpp:6:55: warning: unused parameter 'Y' [-Wunused-parameter]
    6 | 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