Submission #1102985

#	Time	Username	Problem	Language	Result	Execution time	Memory
1102985		Pioneer	Sorting (IOI15_sorting)	C++17	20 / 100	3 ms	504 KiB

sorting

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

using namespace std;

const int MAX=200000;

int n,m;
int s[MAX];

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
	n=N,m=M;
	for(int i=0;i<n;i++)s[i]=S[i];
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(s[j]==i){
				P[i]=i,Q[i]=j;
				swap(s[i],s[j]);
			}
		}
	}
	while(n>0&&P[n-1]==Q[n-1])n--;
	return n;
}

Compilation message (stderr)

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