Submission #114467

#	Time	Username	Problem	Language	Result	Execution time	Memory
114467		arman_ferdous	Sorting (IOI15_sorting)	C++17	0 / 100	3 ms	512 KiB

sorting

#include "sorting.h"
#include <bits/stdc++.h>
using namespace std;

int val[200010], tmp[200010], idx[200010];
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
	for(int i = 0; i < N; i++)
		tmp[i] = S[i];

    for(int i = 0; i < M; i++)
    	swap(S[X[i]], S[Y[i]]);

    for(int i = 0; i < N; i++)
    	val[i] = i, idx[i] = i;

    for(int i = M-1; i >= 0; i--) {
    	swap(idx[val[X[i]]], idx[val[Y[i]]]);
    	swap(val[X[i]], val[Y[i]]);
    }

    int cur = 0, R = 0;
    for(int i = 0; i < N; ) {
    	if(S[i] == i) { i++; continue; }

    	swap(idx[val[X[cur]]], idx[val[Y[cur]]]);
    	swap(val[X[cur]], val[Y[cur]]); cur++;

    	P[R] = idx[i], Q[R] = idx[S[i]];
    	R++;
    	swap(S[i], S[S[i]]);
    }
    while(R < M) {
    	P[R] = Q[R] = 0;
    	R++;
    }
	return R;
}

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