Submission #830667

#	Time	Username	Problem	Language	Result	Execution time	Memory
830667		Supersonic	Sorting (IOI15_sorting)	C++14	0 / 100	1 ms	340 KiB

sorting

#include "sorting.h"
#include <bits/stdc++.h>
using namespace std;
int l[200001];
int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[]) {
    for(int i=0;i<n;i++)l[s[i]]=i;
	if(m%2==1){
		int a=l[0];
		int b=l[1];
		l[s[a]]=b;l[s[b]]=a;
		swap(s[a],s[b]);
	}
	int c=0;
	for(int i=0;i<n;i++){
		if(l[i]==i)continue;
		int a=l[i];
		int b=i;
		l[s[a]]=b;l[s[b]]=a;
		swap(s[a],s[b]);
		p[c]=a;q[c]=b;
        c++;
	}
	return c;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
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[]) {
      |                                          ~~~~^~~
sorting.cpp:5:55: warning: unused parameter 'y' [-Wunused-parameter]
    5 | 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