B. An express train to reveries

// Problem: B. An express train to reveries
// Contest: Codeforces - Codeforces Round #418 (Div. 2)
// URL: https://codeforces.com/problemset/problem/814/B
// Memory Limit: 256 MB
// Time Limit: 1000 ms
// 2022-03-12 12:56:09
// 
// Powered by CP Editor (https://cpeditor.org)

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

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;   
typedef vector<ll> Vll;               
typedef vector<pair<int, int> > vpii;
typedef vector<pair<ll, ll> > vpll;                        

const ll mod = 1e9 + 7;
//const ll mod = 998244353;
const double pi  = acos(-1.0);

inline ll qmi (ll a, ll b) {
	ll ans = 1;
	while (b) {
		if (b & 1) ans = ans * a%mod;
		a = a * a %mod;
		b >>= 1;
	}
	return ans;
}
inline int read () {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f?-x:x;
}
template<typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x/10);
	putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
	return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
	return (a + b) %mod;
}
inline ll inv (ll a) {
	return qmi(a, mod - 2);
}
void solve() {
	int  n;
	cin >> n;
	vector<int> a(n + 1), b(n + 1), p(n + 1, 0), cnt1(n + 1), cnt2(n + 1);
	int num = 0, need = 0;
	for (int i = 1; i<= n; i ++) {
		cin>> a[i];
		cnt1[a[i]]++;
		if (cnt1[a[i]] >= 2) {
			num = a[i];
		}
	}
	 for (int i= 1; i <= n; i ++) {
		 cin >> b[i];
		 cnt2[b[i]] ++;
	 }
	for (int i = 1; i<= n; i ++)
		if (cnt1[i] == 0) {
			need = i;
		}
	for (int i = 1; i <= n; i ++) {
		p[i] = a[i];
	}
	for (int i = 1; i <= n; i ++) {
		if (p[i] == num) {
			p[i] = need;
			break;
		}
	}
	int c = 0;
	for (int i = 1; i<= n; i++)
		if (p[i] != b[i]) c ++;
	if (c == 1) {
		for (int i =1; i <= n;i ++)
			cout << p[i] << ' ';
		puts("");
	}
	else {
		for (int i = 1; i <= n; i ++)
			{
				p[i] = a[i];
			}
		
		
		for (int i = n; i >= 1; i--) {
			if (p[i] == num) {
				p[i] = need;
				break;
			}
		}
		for (int i = 1; i <= n; i ++)
			cout << p[i] << ' ';
		puts("");
	}
	
}
int main () {
	// ios::sync_with_stdio(0),cin.tie(0), cout.tie(0);
    int t;
    t =1;
    //cin >> t;
    while (t --) solve();
    return 0;
}

首先通过观察发现一定只有一个数等于2，那么我们把一个没有存在的数，赋给左边或者右边。通过判断是否符合要求来输出