Submission #1235966

#	Time	Username	Problem	Language	Result	Execution time	Memory
1235966		candi_ositos	Sorting (IOI15_sorting)	C++20	20 / 100	0 ms	328 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 i=0;
    for(int j=0; j<N; ++j){
        while(S[j]!=j){
            P[i]=S[j];
            Q[i]=j;
            ++i;
            int aux=S[S[j]];
            S[S[j]]=S[j];
            S[j]=aux;
        }
    }
    return i;
}

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