Submission #520967

#	Time	Username	Problem	Language	Result	Execution time	Memory
520967		lordlorinc	Sorting (IOI15_sorting)	C++17	20 / 100	3 ms	364 KiB

sorting

#include "sorting.h"
#include <bits/stdc++.h>

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    int res = 0;
    for (int i = 0; i < N; i++){
        int pos = -1;
        for (int j = 0; j < N; j++){
            if (S[j] == i) pos = j;
        }
        if (pos == i) continue;
        P[res] = i;
        Q[res] = pos;
        std::swap(S[i], S[pos]);
        res++;
    }

	return res;
}

Compilation message (stderr)

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