Submission #1286785

#	Time	Username	Problem	Language	Result	Execution time	Memory
1286785		Jawad_Akbar_JJ	정렬하기 (IOI15_sorting)	C++20	0 / 100	7 ms	580 KiB

sorting

#include <iostream>

using namespace std;
int cnt[50000];

int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[]){
	for (int i=0;i<m;i++)
		cnt[x[i]]++, cnt[y[i]]++;

	for (int i=0;i<m;i++){
		// for (int j=0;j<n;j++)
		// 	cout<<s[j]<<' ';
		// cout<<'\n';
		swap(s[x[i]], s[y[i]]);
		cnt[x[i]]--, cnt[y[i]]--;

		if (s[x[i]] == y[i] and s[y[i]] == x[i]){
			p[i] = x[i], q[i] = y[i];
			swap(s[x[i]], s[y[i]]);
			continue;
		}

		int id = 0, c = cnt[0], id2;
		for (int j=0;j<n;j++){
			if (s[j] != j and (s[id] == id or c > cnt[j]))
				id = j, c = cnt[j];
		}
		for (int j=0;j<n;j++){
			if (s[j] == id)
				id2 = j;
		}

		p[i] = id, q[i] = id2;
		swap(s[id], s[id2]);
	}
	return m;
}

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