Submission #421111

#	Time	Username	Problem	Language	Result	Execution time	Memory
421111		LouayFarah	Sorting (IOI15_sorting)	C++14	0 / 100	2 ms	716 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 k = 0; k<n; k++)
    {
        for(int i = 0; i<n-1; i++)
        {
            if(sorted(s, n))
                break;
 
            if(s[i]>s[i+1])
            {
                p[res] = i;
                q[res] = i+1;
                swap(s[i], s[i+1]);
                res++;
            }
        }
    }
 
    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[])
      |                                   ~~~~^
sorting.cpp:18:46: warning: unused parameter 'x' [-Wunused-parameter]
   18 | int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[])
      |                                          ~~~~^~~
sorting.cpp:18:55: warning: unused parameter 'y' [-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