Submission #292637

#	Time	Username	Problem	Language	Result	Execution time	Memory
292637		aymanrs	Sorting (IOI15_sorting)	C++14	20 / 100	1 ms	512 KiB

sorting

#include <bits/stdc++.h>
using namespace std;
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]){
	int r = 0;
	for(int i = 0;i < N;i++){
		if(S[i] != i){
			P[r] = i;
			Q[r++] = S[i];
			swap(S[i], S[S[i]]);
			i--;
		}
	}
	return r;
}

Compilation message (stderr)

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

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