Submission #1263995

#	Time	Username	Problem	Language	Result	Execution time	Memory
1263995		liangjeremy	Sorting (IOI15_sorting)	C++20	20 / 100	11 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<m; i++){
		bool ok=true;
		for(int j=0; j<n; j++){
			if(a[j]!=j)ok=false;
		}
		if(ok)break;
		swap(a[x[i]],a[y[i]]); int idx=-1;
		for(int j=0; j<n; j++){
			if(a[j]!=j){
				idx=j; break; 
			}
		}
		if(idx==-1)break;
		int idx2=-1;
		for(int j=0; j<n; j++){
			if(a[j]==idx)idx2=j;
		}
		p[lst]=idx; q[lst]=idx2; swap(a[idx],a[idx2]); lst++; 
	}
	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