Submission #795508

#	Time	Username	Problem	Language	Result	Execution time	Memory
795508		Cauchico	Sorting (IOI15_sorting)	C++14	0 / 100	1 ms	340 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 n = N, m = M;
	int swaps = m;
	for (int i=0;i<m;i++) {
		P[i] = Q[i] = 0;
	}
	for (int i=0;i<n;i++) {
		bool flag = false;
		for (int j=1;j<n;j++) {
			if (S[j] < S[j-1]) flag = true;
		}
		if (flag) {
			swaps = i;
			break;
		}
		for (int j=0;j<n;j++) {
			if (S[j] == i) {
				swap(S[j], S[i]);
				P[i] = i;
				Q[i] = j;
			}
		}
	}
	swaps = n;
	if (Y[0] == 1 and m&1) {
		Q[m-1] = 1;
		swaps++;
	}
	return swaps;

}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:5:46: warning: unused parameter 'X' [-Wunused-parameter]
    5 | 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