Codeforces Round #733 (Div. 1 + Div. 2) D. Secret Santa（思维 + 贪心）

链接 Secret Santa

题意

有n个人，编号从1 - n，第i个人想给第a[i]送礼物，给出n和a数列，保证每个人都可以收到礼物，求最大满意度（第i个人成功的将礼物送给了a[i]，则满意度+1）；

思路

满足第一个想给 h 送礼物的人，然后剩下的人随机送；

最后再扫一遍，保证没有人自己给自己送礼物；

当扫到自己给自己送礼物的人 i ，让 i 送给 a[i] （i原本就想送给 a[i] ），然后送给 a[i] 的那个人送给 i 即可；

AC代码

#include <iostream>
#include <cstring>
#include <cmath>
#include <cstdio>
#include <string>
#include <algorithm>
#include <queue>
#include <utility>
#include <stack>
#include <map>
#include <vector>
#include <set>
#include <iomanip>
#include <unordered_map>
#define hz020 return
#define mes memset
#define mec memcpy
#define x first
#define y second

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll,ll> PII;

const int N = 200010;
const int null = 0x3f3f3f3f,INF = 1e9;
const ll mod = 998244353;

int T;
int n;
int a[N], b[N];
bool st[N];
map<int, int> mp;
queue<int> q, qq;

int main()
{
	cin >> T;
	while (T --)
	{
		cin >> n;
		for (int i = 1; i <= n; ++ i ) cin >> a[i];
		
		for (int i = 1; i <= n; ++ i )
		{
			if (!mp[a[i]]) b[i] = a[i], mp[a[i]] = i, st[a[i]] = 1;
			else q.push(i);
		}
		
	//	for (int i = 1; i <= n; ++ i ) cout << b[i] << " ";
	//	puts("");
		
		for (int i = 1; i <= n; ++ i ) 
		{
			if (!st[i]) qq.push(i);
		}
		int cnt = q.size();
		while (!q.empty())
		{
			int t = q.front();
			q.pop();
			int x = qq.front();
			qq.pop();
			
			b[t] = x;
		}
		
	//	for (int i = 1; i <= n; ++ i ) cout << b[i] << " ";
	//	puts("");
		for (int i = 1; i <= n; ++ i )
		{
			if (b[i] == i)
			{
				//cout << mp[a[i]] << endl;
				b[i] = a[i];
				b[mp[a[i]]] = i;
				mp[a[i]] = i;
			}
		}
		cout << n - cnt << endl;
		for (int i = 1; i <= n; ++ i ) cout << b[i] << " ";
		cout << endl;
		mp.clear();
		for (int i = 1; i <= n; ++ i ) st[i] = 0, a[i] = 0, b[i] = 0;
		
	}
	
	hz020 0;
} 

END