Submission #620964

#	Time	Username	Problem	Language	Result	Execution time	Memory
620964		Hazem	Sorting (IOI15_sorting)	C++14	20 / 100	3 ms	340 KiB

sorting

#include <bits/stdc++.h>

using namespace std;

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
	
	int n = N;
	int cur = 0;
	if(Y[0])
		swap(S[0],S[1]);
	
	for(int i=0;i<n;i++)
		for(int j=0;j<n;j++)
			if(i==j)
				continue;
			else 
			if(S[j]==i){
				P[cur] = i;
				Q[cur] = j;
				cur++;
				swap(S[i],S[j]);
			}

	bool q = 1;
	if((cur&1)&&Y[0]==1)
		swap(S[0],S[1]);

	for(int i=0;i<n;i++)
		q &= S[i]==i;

	if(!q)
		P[cur] = 0,Q[cur] = 0,cur++;

	return cur;
}

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]
    5 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                   ~~~~^
sorting.cpp:5:46: warning: unused parameter 'X' [-Wunused-parameter]
    5 | 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