Submission #287357

#	Time	Username	Problem	Language	Result	Execution time	Memory
287357		AaronNaidu	Sorting (IOI15_sorting)	C++14	0 / 100	4 ms	512 KiB

sorting

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

vector<int> s;
int n;

bool sorted() {
    for (int i = 0; i < n; i++)
    {
        if (s[i] != i)
        {
            return false;
        }
    }
    return true;
}

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++)
    {
        s.push_back(S[i]);
    }
    for (int i = N-1; i >= 0; i--)
    {
        if (sorted())
        {
            return N-1-i;
        }
        swap(s[X[N-1-i]], s[Y[N-1-i]]);
        for (int j = 0; j < N-1; j++)
        {
            if (s[j] == j)
            {
                P[N-1-i] = j;
                Q[N-1-i] = i;
                swap(s[j], s[i]);
            }
        }
    }
    return N;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:18:37: warning: unused parameter 'M' [-Wunused-parameter]
   18 | int findSwapPairs(int N,int S[],int M, int X[],int Y[],int P[],int Q[]) {
      |                                 ~~~~^

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