Submission #74058

#	Time	Username	Problem	Language	Result	Execution time	Memory
74058		aleksam	Sorting (IOI15_sorting)	C++14	0 / 100	6 ms	384 KiB

sorting

#include <bits/stdc++.h>
#include "sorting.h"

using namespace std;



int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    for(int i=0; i<N; ++i){
    	int ind=-1;
    	for(int j=0; j<N; ++j){
			if(S[j]==i){
				ind=j;
				//printf("S[%d]=%d\n", j, S[j]);
			}
		}
		P[i]=i;
		Q[i]=ind;
		//printf("ind=%d\n", ind);
		int t=S[i];
		S[i]=S[ind];
		S[ind]=t;
	}
	return N;
}

Compilation message (stderr)

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