Submission #94892

#	Time	Username	Problem	Language	Result	Execution time	Memory
94892		someone_aa	Sorting (IOI15_sorting)	C++17	20 / 100	3 ms	512 KiB

sorting

#include <bits/stdc++.h>
#include "sorting.h"
using namespace std;
const int maxn = 110;
int value[maxn], ind[maxn];

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    int br = 0;

    for(int i=0;i<N;i++) {
        value[i] = S[i];
        ind[S[i]] = i;
    }

    for(int i=0;i<N;i++) {
        if(value[i] == i) continue;

        P[br] = i;
        Q[br] = ind[i];

        ind[value[i]] = ind[i];
        value[ind[i]] = value[i];
        value[i] = i;
        ind[i] = i;
        br++;

    }
    return br;
}

Compilation message (stderr)

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