제출 #1004594

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1004594		phoenix	정렬하기 (IOI15_sorting)	C++17	54 / 100	34 ms	684 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[]) {
	vector<pair<int, int>> res;
	
	function<bool(int)> check = [&](int len) -> bool {
		vector<int> s(n), pos(n);
		for (int i = 0; i < n; i++) {
			s[i] = S[i];
			pos[S[i]] = i;
		}
		res.resize(len);

		vector<int> p(n), q(n);
		iota(p.begin(), p.end(), 0);
		iota(q.begin(), q.end(), 0);
		auto do_swap = [&](int i, int j) {
			swap(p[i], p[j]);
			swap(q[p[i]], q[p[j]]);
		};
		for (int i = len - 1; i >= 0; i--) {
			do_swap(X[i], Y[i]);
		}

		int l = n - 1;
		for (int i = 0; i < len; i++) {
			do_swap(X[i], Y[i]);
			swap(s[X[i]], s[Y[i]]);
			swap(pos[s[X[i]]], pos[s[Y[i]]]);

			while (l >= 0 && q[l] == pos[l]) 
				l--;
			if (l == -1) 
				res[i] = {0, 0};
			else {
				res[i] = {pos[l], q[l]};
			}
			swap(s[res[i].first], s[res[i].second]);
			swap(pos[s[res[i].first]], pos[s[res[i].second]]);

			// cout << res[i].first << ' ' << res[i].second << '\n';
			// cout << "s: ";
			// for (int c : s) cout << c << ' ';
			// cout << "\n";
			// cout << "p: ";
			// for (int c : p) cout << c << ' ';
			// cout << "\n";
			// cout << "q: ";
			// for (int c : q) cout << c << ' ';
			// cout << "\n";
			// cout << "\n";
		}
		while (l >= 0 && q[l] == pos[l]) l--;
		return (l == -1);
	};

	for (int len = 1; len <= m; len++) {
		if (check(len)) {
			for (int i = 0; i < len; i++) {
				P[i] = res[i].first;
				Q[i] = res[i].second;
			}
			return len;
		}
	}

	return -1;
}

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