Submission #520959

#	Time	Username	Problem	Language	Result	Execution time	Memory
520959		ColourAttila	Sorting (IOI15_sorting)	C++17	20 / 100	2 ms	360 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 currind = 0;

    for(int i = 0; i < N; i++) {
        if(i != S[i]) {
            for(int j = i+1; j < N; j++) {
                if(S[j] == i) {
                    P[currind] = i;
                    Q[currind] = j;
                    currind++;
                    swap(S[j], S[i]);
                }
            }
        }
    }

	return currind;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:5:39: warning: unused parameter 'M' [-Wunused-parameter]
    5 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                   ~~~~^
sorting.cpp:5:46: warning: unused parameter 'X' [-Wunused-parameter]
    5 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                          ~~~~^~~
sorting.cpp:5:55: warning: unused parameter 'Y' [-Wunused-parameter]
    5 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                                   ~~~~^~~

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