Submission #158646

#	Time	Username	Problem	Language	Result	Execution time	Memory
158646		oolimry	Sorting (IOI15_sorting)	C++14	0 / 100	5 ms	376 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[]) {
    int n = N;
    int arr[n];
    for(int i = 0;i < n;i++){
		arr[i] = S[i];
	}
	
	int cnt = 0;
	for(int k = 2;k < n;k++){
		swap(arr[X[cnt]],arr[Y[cnt]]);
		for(int i = 0;i < n;i++){
			if(arr[i] == k){
				P[cnt] = k;
				Q[cnt] = i;
				swap(arr[k],arr[i]);
				
				cnt++;
				break;
			}
		}
	}
	swap(arr[X[cnt]],arr[Y[cnt]]);
	if(arr[0] == 0){
		P[cnt] = 0;
		Q[cnt] = 0;
	}
	else{
		P[cnt] = 0;
		Q[cnt] = 1;
	}
	cnt++;
	/*
    for(int q = 0;;q++){
		bool can = true;
		for(int i = 0;i < n;i++){
			if(arr[i] != i){
				can = false;
				break;
			}
		}
		if(can){
			return q;
		}
		
	}
	*/
	return cnt;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:4:39: warning: unused parameter 'M' [-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