Submission #419676

#	Time	Username	Problem	Language	Result	Execution time	Memory
419676		AugustinasJucas	Sorting (IOI15_sorting)	C++14	20 / 100	3 ms	332 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 r = 0;
    for(int i = 0; i < N; i++){
        // pastatysiu i i jo vieta
        if(S[i] == i) continue;
        int kur = 0;
        for(int j = 0; j < N; j++) if(S[j] == i) kur = j;
        swap(S[i], S[kur]);
        P[r] = i;
        Q[r++] = kur;
    }
	return r;
}

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