原题链接:https://ac.nowcoder.com/acm/contest/13/B
题意
给定一个序列有n个元素,问取出两个子序列长度均为n/2,能否取出完全相同的两个子序列。
分析
题目范围很小,n只有40,因此考虑二进制枚举。但 2 40 2^{40} 240复杂度显然不能满足要求,但 2 20 ∗ 2 2^{20}*2 220∗2是可以的,所以我们用折半搜索的思想,先处理出前n/2的数据。从题目来看,要使两个子序列完全相同,那么前缀和后缀一定是相同的,因此在枚举的时候就可以把不满足条件的给筛掉,然后哈希值为多出来的一部分。举例说两个前缀相同的子序列为123和1,那么哈希处理出23,最后和后半部分匹配时,多余部分如果也是23,那么就可以满足要求。
Code
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <cmath>
#include <bitset>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <unordered_map>
using namespace std;
#define fi first
#define se second
#define re register
typedef long long ll;
typedef pair<ll, ll> PII;
typedef unsigned long long ull;
const int N = 1e5 + 10, M = 1e6 + 5, INF = 0x3f3f3f3f;
const int MOD = 1e9+7;
unordered_map<ull, bool> mp;
int tmp1[N], tmp2[N];
void solve() {
int T; cin >> T; while (T--) {
mp.clear();
int n; cin >> n; vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
int mask = 1 << (n / 2), ff = 0;
for (int i = 0; i < mask; ++i) {
int flag = 1;
int len1 = 0, len2 = 0;
for (int j = 0; j < n / 2; j++) {
if (i >> j & 1) tmp1[len1++] = a[j];
else tmp2[len2++] = a[j];
}
int Min = min(len1, len2);
int Max = max(len1, len2);
for (int j = 0; j < Min; ++j) if (tmp1[j] != tmp2[j]) {flag = 0; break;}
if (!flag) continue;
ull hash = 0;
for (int j = Min; j < Max; ++j) {
hash = hash * 23333 + (len1 > len2 ? tmp1[j] : tmp2[j]);
}
mp[hash] = true;
}
for (int i = 0; i < mask; ++i) {
int flag = 1;
int len1 = 0, len2 = 0;
for (int j = 0; j < n / 2; ++j) {
if (i >> j & 1) tmp1[len1++] = a[j+n/2];
else tmp2[len2++] = a[j+n/2];
}
int Min = min(len1, len2);
int Max = max(len1, len2);
if (len1 && len2)
for (int j = len1-1, k = len2 - 1; j >= 0 && k >= 0; --j, --k) if (tmp1[j] != tmp2[k]) {flag = 0; break;}
if (!flag) continue;
ull hash = 0;
for (int j = 0; j < Max - Min; ++j) {
hash = hash * 23333 + (len1 > len2 ? tmp1[j] : tmp2[j]);
}
// cout << hash << endl;
if (mp.count(hash)) {
ff = 1;
break;
}
}
cout << (ff ? "Frederica Bernkastel" : "Furude Rika") << endl;
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#ifdef ACM_LOCAL
freopen("input", "r", stdin);
freopen("output", "w", stdout);
#endif
solve();
return 0;
}