Submission #1090650

#	Time	Username	Problem	Language	Result	Execution time	Memory
1090650		owoovo	Sorting (IOI15_sorting)	C++17	20 / 100	1 ms	600 KiB

sorting

#include "sorting.h"

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
	int ans=0,vis[110]={0};
	for(int i=0;i<N;i++){
		if(vis[i]||S[i]==i)continue;
		int now=S[i];
		vis[i]=1;
		while(now!=i){
			vis[now]=1;
			P[ans]=now;
			Q[ans]=i;
			now=S[now];
			ans++;
		}
	}
	return ans;
}

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