Submission #420939

#	Time	Username	Problem	Language	Result	Execution time	Memory
420939		LouayFarah	Sorting (IOI15_sorting)	C++14	0 / 100	2 ms	844 KiB

sorting

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

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

    return true;
}

int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[])
{
  	int res = 0;
  	for(int i = 1; i<=n; i++)
    {
        if(sorted(s, n))
            break;

        if(x[res]!=y[res])
            swap(x[res], y[res]);
        int j = i;
        while(s[j]<s[j-1]&&j>0)
        {
            p[res] = j;
            q[res] = j-1;
            res++;
            swap(s[j], s[j-1]);
            j--;
        }
    }
    return res;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:18:39: 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