Submission #419606

#	Time	Username	Problem	Language	Result	Execution time	Memory
419606		AugustinasJucas	Sorting (IOI15_sorting)	C++14	0 / 100	11 ms	432 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[]) {

    P[0] = 0;

	Q[0] = 0;

    for(int i = 0; i < N; i++){



        // pastatysiu i i jo vieta

        int kur = 0;

        for(int j = 0; j < N; j++) if(S[j] == i) kur = j;

        swap(S[i], S[kur]);

        P[i] = i;

        Q[i] = kur;

    }

	return N;

}

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