Submission #803007

#	Time	Username	Problem	Language	Result	Execution time	Memory
803007		BT21tata	정렬하기 (IOI15_sorting)	C++17	16 / 100	6 ms	448 KiB

sorting

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

int cur[200005];

int findSwapPairs(int n, int s[], int m, int x[], int y[], int P[], int Q[])
{
	m=n;
	int r=0;
	for(int i=0; i<m; i++)
	{
		swap(s[x[i]], s[y[i]]);
		for(int j=0; j<n; j++)
			cur[j]=s[j];
		for(int j=i+1; j<m; j++)
			swap(cur[x[j]], cur[y[j]]);

		int pos1=0, pos2=0;
		for(int j=0; j<n; j++)
		{
			if(s[j]==cur[i]) pos1=j;
			if(s[j]==i) pos2=j;
		}
		P[r]=pos1;
		Q[r]=pos2;
		swap(s[P[r]], s[Q[r]]);
		r++;
	}
	return m;
}

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