Submission #1235963

#	Time	Username	Problem	Language	Result	Execution time	Memory
1235963		candi_ositos	정렬하기 (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[]){
    int re=0;
    int i=0;
    for(int j=0; j<N; ++j){
        if(S[j]!=j){
            while(S[j]!=j){
                int aux=S[j];
                P[i]=aux;
                Q[i]=j;
                ++i;
                S[j]=S[S[j]];
                S[S[j]]=aux;
            }
        }
    }
    return i;
}

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