Submission #135767

#	Time	Username	Problem	Language	Result	Execution time	Memory
135767		amiratou	Sorting (IOI15_sorting)	C++14	20 / 100	4 ms	504 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[]) {
	map<int,int> pos;
    for (int i = 0; i < N; ++i)
    	pos[S[i]]=i;
    int comp=0;
    for (int i = 0; i < N; ++i)
    {
    	if(pos[i]==i)continue;
    	P[comp]=pos[i],Q[comp]=i;
    	pos[S[i]]=pos[i];
    	pos[i]=i;
    	swap(S[P[comp]],S[Q[comp]]);
    	comp++;
    }
	return comp;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:5: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:5: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:5: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