Submission #65651

#	Time	Username	Problem	Language	Result	Execution time	Memory
65651		mirbek01	Sorting (IOI15_sorting)	C++17	0 / 100	5 ms	640 KiB

sorting

#include "sorting.h"

# include <bits/stdc++.h>

using namespace std;

int pos[1000];

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {

      for(int i = 0; i < N; i ++)
            pos[S[i]] = i;

      int sz = 0;

      for(int i = N - 1; i > 0; i --){
            bool fl = 1;
            for(int j = 0; j < N; j ++){
                  if(j != S[j]) fl = 0;
            }
            if(fl) break;
            swap(S[X[sz]], S[Y[sz]]);
            pos[S[X[sz]]] = X[sz];
            pos[S[Y[sz]]] = Y[sz];
            P[sz] = pos[i], Q[sz] = i;
            swap(S[i], S[pos[i]]);
            pos[ S[pos[i]] ] = pos[i];
            sz ++;
      }

	return sz;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:9:39: warning: unused parameter 'M' [-Wunused-parameter]
 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