Submission #1179786

#	Time	Username	Problem	Language	Result	Execution time	Memory
1179786		aguss	Sorting (IOI15_sorting)	C++20	20 / 100	1 ms	584 KiB

sorting

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

#define dbg(x) cerr << #x << ": " << x << '\n';

using namespace std;

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
	map<int, int> posi;
	for(int i = 0; i < N; i++){
		posi[S[i]] = i;
	}
	int swaps = 0;
	for (int i = 0; i < N; i++){
        if (S[i] != i) {
            int j = posi[i];
            P[swaps] = i;
            Q[swaps] = j;
            swaps++;
            swap(S[i], S[j]);
            posi[S[j]] = j; 
            posi[S[i]] = i; 
        }
    }
	return swaps;
}

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