Submission #1358815

#	Time	Username	Problem	Language	Result	Execution time	Memory
1358815		maya_s	Sorting (IOI15_sorting)	C++20	0 / 100	1 ms	344 KiB

sorting

#include "sorting.h"
#include<bits/stdc++.h>
using namespace std;
typedef int ll;

int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[]) {
	ll cnt = 0;
	for(ll i = 0; i < n; i++){
		for(ll j = i+1; j < n; j++) if(s[j] == i){
			p[cnt] = i, q[cnt] = j;
			cnt++;
			break;
		}
	}
	return cnt;
}

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