Submission #16722142

---

Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>

using namespace std;

typedef long long ll;

void solve() {
	int n;
	cin >> n;
	vector<int> a(n), b(n);
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	for (int i = 0; i < n; i++) {
		cin >> b[i];
	}
	int res = n / 2 + n % 2;
	int cur = 0;
	for (int i = 0; i < n;i++) {
		if (a[i] == b[i])
			cur++;
	}
	if (cur < res)
		res = cur;

	vector<int> c = b;
	rotate(c.begin(), c.begin() + n - res, c.end());
	bool ok = 1;
	for (int i = 0; i < n; i++) {
		if (a[i] == c[i])
			ok = 0;
	}
	if (ok) {
		cout << "Yes\n";
		for (int i = 0; i < n; i++)
			cout << c[i] << ' ';
		return;
	}

	rotate(b.begin(), b.begin() + res, b.end());
	ok = 1;
	for (int i = 0; i < n; i++) {
		if (a[i] == b[i])
			ok = 0;
	}
	if (ok) {
		cout << "Yes\n";
		for (int i = 0; i < n; i++)
			cout << b[i] << ' ';
		return;
	}

	cout << "No";
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
#if defined(_DEBUG)
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
	int q = 1;
	//cin >> q;
	for (; q > 0; q--) {
		solve();
		//cout << endl;
	}
}

Submission Info

Judge Result