Submission #1090661

#	Time	Username	Problem	Language	Result	Execution time	Memory
1090661		owoovo	Sorting (IOI15_sorting)	C++17	20 / 100	1 ms	604 KiB

sorting

#include "sorting.h"

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
	int u=1;
	for(int i=0;i<M;i++)if(X[i]!=0||Y[i]!=0)u=0;
	int ans=0,vis[110]={0};
	if(u==1){
		for(int i=0;i<N;i++){
			if(vis[i]||S[i]==i)continue;
			int now=S[i];
			vis[i]=1;
			while(now!=i){
				vis[now]=1;
				P[ans]=now;
				Q[ans]=i;
				now=S[now];
				ans++;
			}
		}
		return ans;

	}else{
		int p[110];
		for(int i=0;i<N;i++){
			p[S[i]]=i;
		}
		for(int i=0;i<N;i++){
			if(vis[i]||S[i]==i)continue;
			int now=p[i];
			vis[i]=1;
			while(now!=i){
				ans++;
				vis[now]=1;
				if(now==0||now==1){
					P[ans-1]=now^(ans%2);
				}
				if(i==0||i==1){
					Q[ans-1]=i^(ans%2);
				}
				now=p[now];
			}
		}
		if(ans%2==1){
			P[ans]=0;
			Q[ans]=0;
			ans++;
		}
		return ans;

	}
}

• Subtask 1: 8 / 8
• Subtask 2: 12 / 12
• Subtask 3: 0 / 16
• Subtask 4: 0 / 18
• Subtask 5: 0 / 20
• Subtask 6: 0 / 26