Submission #795554

#	Time	Username	Problem	Language	Result	Execution time	Memory
795554		Josia	Sorting (IOI15_sorting)	C++11	0 / 100	1 ms	444 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[]) {
    assert(M >= N);
    vector<int> S(N);
    for (int i = 0; i<N; i++) S[i] = _S[i];

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

    return N;
}

Compilation message (stderr)

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