Submission #520971

#	Time	Username	Problem	Language	Result	Execution time	Memory
520971		Valaki2	Sorting (IOI15_sorting)	C++14	0 / 100	1 ms	332 KiB

sorting

#include "sorting.h"
#include <vector>

using namespace std;

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    vector<int> pos(N, 0);
    for(int i = 0; i < N; i++) {
        pos[S[i]] = i;
    }
    for(int i = 0; i < N; i++) {
        // felcserelni i-t es pos[i]-t
        P[i] = i;
        Q[i] = pos[i];
        int temp = pos[i];
        pos[S[i]] = pos[i];
        pos[S[pos[i]]] = i;
        swap(S[i], S[temp]);
    }
    return N;
}

Compilation message (stderr)

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