Submission #1337187

#	Time	Username	Problem	Language	Result	Execution time	Memory
1337187		orgiloogii	정렬하기 (IOI15_sorting)	C++20	0 / 100	3 ms	344 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 cnt = 0;
	int id[n] = {0};
	for (int i = 0;i < n;i++) {
		id[s[i]] = i;
	}
	for (int i = 0;i < n;i++) {
		if (id[i] == i) continue;
		for (int j = 0;j < n;j++) {
			if (id[j] == i) {
				p[cnt] = i;
				q[cnt] = j;
				swap(id[i], id[j]);
				cnt++;
			}
		}	
	}
	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