Submission #958372

#	Time	Username	Problem	Language	Result	Execution time	Memory
958372		12345678	Sorting (IOI15_sorting)	C++17	16 / 100	5 ms	600 KiB

sorting

#include "sorting.h"
#include <bits/stdc++.h>
 
using namespace std;
 
const int nx=505;

int idx[nx], s[nx];

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    for (int i=0; i<N; i++) idx[i]=i, s[i]=S[i];
    for (int i=N-1; i>=0; i--) swap(idx[X[i]], idx[Y[i]]);
    for (int i=0; i<N; i++)
    {
        swap(idx[X[i]], idx[Y[i]]);
        swap(s[X[i]], s[Y[i]]);
        for (int j=0; j<N; j++) if (idx[j]==i) P[i]=j;
        for (int j=0; j<N; j++) 
        {
            if (s[j]==i) 
            {
                Q[i]=j;
                swap(s[P[i]], s[Q[i]]);
                break;
            }
        }
    }
    return N;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:10:39: warning: unused parameter 'M' [-Wunused-parameter]
   10 | 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: 16 / 16
• Subtask 4: 0 / 18
• Subtask 5: 0 / 20
• Subtask 6: 0 / 26