Submission #795520

#	Time	Username	Problem	Language	Result	Execution time	Memory
795520		Josia	Sorting (IOI15_sorting)	C++17	16 / 100	3 ms	440 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[]) {
	if (N == 1) return 0;
	vector<int> S(N);
	for (int i = 0; i<N; i++) S[i] = _S[i];
    for (int i = 2; i<N; i++) {
		swap(S[X[i-2]], S[Y[i-2]]);
		for (int j = 0; j<N; j++) {
			if (S[j] == i) {
				swap(S[j], S[i]);
				P[i-2]=i;
				Q[i-2]=j;
				break;
			}
		}
	}
	if (S[0] == 0) return N-2;
	
	swap(S[X[N-2]], S[Y[N-2]]);
	if (S[0] == 0) {P[N-2]=0;Q[N-2]=0;}
	else {P[N-2]=0;Q[N-2]=1;}
	
	return N-1;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:5:40: warning: unused parameter 'M' [-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: 16 / 16
• Subtask 4: 0 / 18
• Subtask 5: 0 / 20
• Subtask 6: 0 / 26