Submission #1240097

#	Time	Username	Problem	Language	Result	Execution time	Memory
1240097		simplemind_31	Sorting (IOI15_sorting)	C++20	20 / 100	2 ms	328 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 now=0;
    for(int i=0;i<N;i++){
		for(int j=i+1;j<N;j++){
			if(S[j]==i){
				P[now]=i;
				Q[now]=j;
				swap(S[i],S[j]);
				now++;
			}
		}
	}
	return now;
}

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