Submission #1179419

#	Time	Username	Problem	Language	Result	Execution time	Memory
1179419		aguss	정렬하기 (IOI15_sorting)	C++20	0 / 100	2 ms	580 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[]) {
	map<int, int> posi;
	for(int i = 0; i < N; i++){
		posi[S[i]] = i;
	}
	int ans = 0;
	for(int i = 0; i < N; i++){
		ans++;
		P[i] = posi[i];
		Q[i] = posi[posi[i]];
		if(S[i] == i){
			P[i] = i;
			Q[i] = i;
			continue;
		}
		swap(S[posi[i]], S[posi[posi[i]]]);
	}
	return ans;
}

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