Submission #958622

#	Time	Username	Problem	Language	Result	Execution time	Memory
958622		12345678	Sorting (IOI15_sorting)	C++17	100 / 100	234 ms	24140 KiB

sorting

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

int s[nx], rs[nx], loc[nx], idx[nx], ridx[nx], n;

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    n=N;
    int l=0, r=N;
    while (l<=r)
    {
        int md=(l+r)/2, cur=0;
        for (int i=0; i<N; i++) idx[i]=i, ridx[i]=i, s[i]=S[i], rs[s[i]]=i, P[i]=Q[i]=0;
        for (int i=md-1; i>=0; i--) swap(ridx[idx[X[i]]], ridx[idx[Y[i]]]), swap(idx[X[i]], idx[Y[i]]);
        for (int i=0; i<md; i++)
        {
            swap(ridx[idx[X[i]]], ridx[idx[Y[i]]]);
            swap(idx[X[i]], idx[Y[i]]);
            swap(rs[s[X[i]]], rs[s[Y[i]]]);
            swap(s[X[i]], s[Y[i]]);
            while (cur<N&&ridx[cur]==rs[cur]) cur++;
            if (cur<N) P[i]=ridx[cur], Q[i]=rs[cur], swap(rs[s[P[i]]], rs[s[Q[i]]]), swap(s[P[i]], s[Q[i]]), cur++;
        }
        while (cur<N&&ridx[cur]==rs[cur]) cur++;
        if (l==r) return l;
        if (cur<N) l=md+1;
        else r=md;
    }
}

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[]) {
      |                                   ~~~~^
sorting.cpp:32:1: warning: control reaches end of non-void function [-Wreturn-type]
   32 | }
      | ^

• Subtask 1: 8 / 8
• Subtask 2: 12 / 12
• Subtask 3: 16 / 16
• Subtask 4: 18 / 18
• Subtask 5: 20 / 20
• Subtask 6: 26 / 26