Submission #1235360

#	Time	Username	Problem	Language	Result	Execution time	Memory
1235360		chinesegenius69420	Sorting (IOI15_sorting)	C++20	20 / 100	1 ms	580 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[]) {
	map<int, int> posi;
	int n = N;
	for(int i = 0; i < n; i++){
		posi[S[i]] = i;
	}
	int s = 0;
	for (int i = 0; i < n; i++){
        if (S[i] != i) {
            int j = posi[i];
            P[s] = i;
            Q[s] = j;
            s++;
            swap(S[i], S[j]);
            posi[S[j]] = j; 
            posi[S[i]] = i; 
        }
    }
	return s;
}

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