Submission #1263984

#	Time	Username	Problem	Language	Result	Execution time	Memory
1263984		liangjeremy	Sorting (IOI15_sorting)	C++20	20 / 100	1 ms	328 KiB

sorting

#include "sorting.h"
#include<bits/stdc++.h>
#define fi first
#define se second
//#define int long long
using namespace std;
using db=double;
using ll=int64_t;
using sll=__int128;
using lb=long double;

int findSwapPairs(int n, int a[], int m, int x[], int y[], int p[], int q[]){
	int lst=0; 
	for(int i=0; i<n; i++){
		if(a[i]==i)continue; 
		for(int j=i+1; j<n; j++){
			if(a[j]==i){
				p[lst]=i; q[lst]=j; swap(a[i],a[j]); lst++; break; 
			}
		}
	}
	return lst; 
}

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