Submission #126174

#	Time	Username	Problem	Language	Result	Execution time	Memory
126174		SOIVIEONE	Sorting (IOI15_sorting)	C++14	0 / 100	3 ms	504 KiB

sorting

#include "sorting.h"
#include <bits/stdc++.h>
using namespace std;
int id[2222222];
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
	for(int i = 0; i < N; i ++)
		id[S[i]] = i;
	for(int i = 0; i < M; i ++)
	{
		if(i >= N)
		{
			P[i] = 0; Q[i] = 0;
			continue;
		}
		swap(S[id[i]], S[i]);
		P[i] = id[i]; Q[i] = i;
		id[S[id[i]]] = id[i];
		id[i] = i;
	}
	return M;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
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: 0 / 8
• Subtask 2: 0 / 12
• Subtask 3: 0 / 16
• Subtask 4: 0 / 18
• Subtask 5: 0 / 20
• Subtask 6: 0 / 26