EOJ 3449 3451

3449

思路：我们首先可以这样考虑，如果所给的字母是有序的，比如

aabbcc，很显然我们只需将这个字符串右移两位即可达到要求

ccaabb， 移动的大小其实就等于整个字符串中出现次数多的字符的个数，注意不能组成的情况，所以我们直接排序然后移动即可

#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <bitset>

using namespace std;
#define LL long long
#define pb push_back
#define mk make_pair
#define fi first
#define se second
#define lson (rt << 1)
#define rson ((rt << 1) | 1)
#define pill pair<int, int>
#define mst(a, b)	memset(a, b, sizeof a)
#define REP(i, x, n)	for(int i = x; i <= n; ++i)
const int MOD = 1e9 + 7;
const int qq = 1e5 + 10;
const int INF = 1e9 + 10;
struct Node {
	char ch;
	int id;
	bool operator < (const Node &a) const {
		return ch < a.ch;
	}
}p[qq], ans[qq];
char st[qq];
int vis[30];
bool cmp(const Node &a, const Node &b) {
	return a.id < b.id;
}

int main(){
	scanf("%s", st);
	int len = strlen(st);
	for (int i = 0; i < len; ++i) {
		p[i].ch = st[i];
		p[i].id = i;
		vis[p[i].ch - 'a']++;
	}
	int maxn = 0;
	for (int i = 0; i < 26; ++i) {
		maxn = max(maxn, vis[i]);
	}
	if (maxn > len / 2) {
		puts("impossible");
		return 0;
	}
	sort(p, p + len);
	for (int i = 0; i < len; ++i) {
		ans[i].id = p[i].id;
		ans[i].ch = p[(i + maxn) % len].ch; 
	}
	sort(ans, ans + len, cmp);
	for (int i = 0; i < len; ++i) {
		printf("%c", ans[i].ch);
	}
	puts("");
	return 0;
}

3451

思路：这题二分匹配还是能想到的，WA了几发才发现不是一般的二分图匹配，这里有一个限制，就是你要进入下一轮的前提是你这轮一定得过，也就是说如果在匈牙利算法中当前找不到增广路就结束算法，还有一个要注意的地方，就是需要注意每次memset的时候空间不能过大，我这里将能匹配的素数离散化了

#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <bitset>

using namespace std;
#define LL long long
#define pb push_back
#define mk make_pair
#define fi first
#define se second
#define lson (rt << 1)
#define rson ((rt << 1) | 1)
#define pill pair<int, int>
#define mst(a, b)	memset(a, b, sizeof a)
#define REP(i, x, n)	for(int i = x; i <= n; ++i)
const int MOD = 1e9 + 7;
const int qq = 1e5 + 10;
const int INF = 1e9 + 10;
int n, num[qq], mt[qq];
int ispm[qq * 10], mp[qq];
bool vis[3000 * 30];
vector<int> vt[qq];
bool dfs(int u) {
	for (int i = 0; i < vt[u].size(); ++i) {
		if (!vis[mp[vt[u][i]]]) {
			vis[mp[vt[u][i]]] = true;
			if (!mt[mp[vt[u][i]]] || dfs(mt[mp[vt[u][i]]])) {
				mt[mp[vt[u][i]]] = u;
				return true;
			}
		}
	}
	return false;
}
int main(){
	int n;	scanf("%d", &n);
	for (int i = 1; i <= n; ++i) {
		scanf("%d", num + i);
		int x = num[i];
		for (int j = 2; j * j <= x; ++j) {
			if (x % j == 0) {
				ispm[j]++;
				vt[i].pb(j);
				while (x % j == 0)	x /= j;
			}
		}
		if (x > 1) {
			vt[i].pb(x);
			ispm[x]++;
		}
	}
	int cnt = 0;
	for (int i = 1; i < qq * 10; ++i) {
		if (ispm[i])	mp[i] = ++cnt;
	}
	int ans = 0;
	for (int i = 1; i <= n; ++i) {
		mst(vis, false);
		if (dfs(i))	ans++;
		else	break;
	}
	printf("%d\n", ans);
	return 0;
}