Submission #65659

#	Time	Username	Problem	Language	Result	Execution time	Memory
65659		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 S[], int M, int X[], int Y[], int P[], int Q[]) {
      int sz = 0;

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

	return sz;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:7:39: warning: unused parameter 'M' [-Wunused-parameter]
 int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
                                       ^
sorting.cpp:19:19: warning: 'pos' may be used uninitialized in this function [-Wmaybe-uninitialized]
             P[sz] = pos, Q[sz] = i;
             ~~~~~~^~~~~

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