Submission #65678

#	Time	Username	Problem	Language	Result	Execution time	Memory
65678		mirbek01	Sorting (IOI15_sorting)	C++17	0 / 100	6 ms	384 KiB

sorting

#include "sorting.h"

# include <bits/stdc++.h>

using namespace std;

int findSwapPairs(int n, int ar[], int m, int x[], int y[], int p[], int q[])
{
      int sz = 0;
      for (int i = 0; i < n; i++)
      {
            bool fl = true;
            for (int j = 0; j < n; j++)
                  if (ar[j] != j)
                        fl = false;

            if (fl) break;
            for (int j = i; j < n; j++)
            {
                  if ( ar[j] == i )
                  {
                        swap(ar[j], ar[i]);
                        p[sz] = i;
                        q[sz] = j;
                        sz++;
                        break;
                  }
            }
      }
      for(int i = 0; i < n; i ++){
            assert(i == ar[i]);
      }
      return sz;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:7:40: warning: unused parameter 'm' [-Wunused-parameter]
 int findSwapPairs(int n, int ar[], int m, int x[], int y[], int p[], int q[])
                                        ^
sorting.cpp:7:49: warning: unused parameter 'x' [-Wunused-parameter]
 int findSwapPairs(int n, int ar[], int m, int x[], int y[], int p[], int q[])
                                                 ^
sorting.cpp:7:58: warning: unused parameter 'y' [-Wunused-parameter]
 int findSwapPairs(int n, int ar[], 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