Submission #720218

#	Time	Username	Problem	Language	Result	Execution time	Memory
720218		mseebacher	Sorting (IOI15_sorting)	C++17	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 ans = 0;
	
    for(int i = 0;i<n;i++){
		if(s[i] == i) continue;
		for(int j = i+1;j<n;j++){
			if(s[j] == i){
				swap(s[x[ans]],s[y[ans]]);
				int abc = i;
				if(i == 1){
					abc = 0;
				}
				swap(s[j],s[abc]);
				p[ans] = abc;
				q[ans] = j;
				ans++;
				break;
			}
		}
	}
	// 1x mehr swappen 
	if(s[0] != 0){
		p[ans] = 0;
		q[ans] = 0;
		ans++;
	}
	return ans;
}

Compilation message (stderr)

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