Submission #69035

#	Time	Username	Problem	Language	Result	Execution time	Memory
69035		theknife2001	Sorting (IOI15_sorting)	C++17	36 / 100	6 ms	640 KiB

sorting

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

using namespace std;
const int NN=555;
int b[NN];
int n;

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[])
{
    n=N;
    for(int i=0;i<n;i++)
        b[S[i]]=i;
    int ans=0;
    for(int i=0;i<n;i++)
    {
        if(S[i]!=i)
            break;
        if(i==n-1)
            return ans;
    }
    for(int i=0;i<n;i++)
    {
        if(S[i]!=i)
            break;
        if(i==n-1)
            return ans;
    }
    for(int j=0;j<M;j++)
    {
        b[S[X[j]]]=Y[j];
        b[S[Y[j]]]=X[j];
        swap(S[Y[j]],S[X[j]]);
        for(int i=0;i<n;i++)
        {
            if(S[i]!=i)
                break;
            if(i==n-1)
            {
                P[ans]=0;
                Q[ans]=0;
                ans++;
                return ans;
            }
        }
        for(int i=n-1;i>=0;i--)
        {
            if(S[i]!=i)
            {
                P[ans]=b[i];
                Q[ans]=b[S[i]];
                swap(b[i],b[S[i]]);
                swap(S[i],S[b[S[i]]]);
                ans++;
                break ;
            }
        }
        for(int i=0;i<n;i++)
        {
            if(S[i]!=i)
                break;
            if(i==n-1)
                return ans;
        }
    }
    return ans;
}

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