Submission #1190251

#	Time	Username	Problem	Language	Result	Execution time	Memory
1190251		simona1230	Sorting (IOI15_sorting)	C++20	20 / 100	1 ms	328 KiB

sorting

#include "sorting.h"
#include <bits/stdc++.h>
using namespace std;

int num;
int pos[200001];
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[])
{
    for(int i=0;i<N;i++)
        pos[S[i]]=i;
    for(int i=0;i<N;i++)
    {
        if(S[i]!=i)
        {
            P[num]=pos[i];
            Q[num]=i;
            pos[S[i]]=pos[i];
            swap(S[pos[i]],S[i]);
            num++;
        }
    }
	return num;
}

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