Submission #1235440

#	Time	Username	Problem	Language	Result	Execution time	Memory
1235440		Gabriel	Sorting (IOI15_sorting)	C++20	0 / 100	1 ms	584 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[]){
    /*P[0] = 0;
	Q[0] = 0;
	return 1;*/
	int r = 0;
	set< pair<int, int> > Cola;
	for(int i = 0; i < N; i++){
		Cola.insert({S[i], i});
	}
	for(int i = 0; i < N; i++){
		pair<int, int> Par = *Cola.begin();
		Cola.erase(Par);
		if(S[i] != Par.first){
			P[r] = i;
			Q[r] = Par.second;
			r++;
			swap(S[i], S[Par.second]);
		}
	}
	return r;
}

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