A.B略
C.
题意:n个数a[1~n],找出任何一个正整数x,满足所有数加上x后两两互质.
首先,显然所有数必须两两相同,不然加上任何整数必定会产生gcd >= 2的组合
然后我们手玩可以发现奇偶性,我们至少不能使得有两个数同时是偶数,如果出现两个偶数,两个奇数,例如2 4 5 7,那么无论x选择什么,都至少会出现两个偶数,进一步地,我们发现只要存在min(奇数个数,偶数个数) >= 2,那么就一定会出现两个偶数,也就是出现两个mod 2 == 0的数.进一步拓展,我们如果想要让整个数组至多出现一次mod p == 0的数, 我们贪心的做法是选择mod p得到的值出现次数最少的数,假设mod p == t,我们只要选择x mod p = (p - t)就可以让这个数被p整除,同理,如果出现次数最少的数 >= 2,也是无解的.我们知道一个数mod p 得到的值为0 ~ p - 1,由鸽巢原理,当p > n / 2时,出现次数最少的那个数一定<= 1,所以我们枚举p (2~n / 2)且p为质数(当然不是质数也可以),然后判断mod p的值最小次数是否大于等于2即可.
如果对于p ∈ [2, n / 2]都满足以上条件,我们最后选择的x只要满足x mod 2 == x1, x mod 3 == x2...,x1,x2..这些模数由上面的假设可知,是两两互质的,所以由CRT可知这个方程组一定有整数解.
#include <bits/stdc++.h>
#define int long long
#define IOS ios::sync_with_stdio(false), cin.tie(0)
#define ll long long
// #define double long double
#define ull unsigned long long
#define PII pair<int, int>
#define PDI pair<double, int>
#define PDD pair<double, double>
#define debug(a) cout << #a << " = " << a << endl
#define point(n) cout << fixed << setprecision(n)
#define all(x) (x).begin(), (x).end()
#define mem(x, y) memset((x), (y), sizeof(x))
#define lbt(x) (x & (-x))
#define SZ(x) ((x).size())
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
namespace nqio{const unsigned R = 4e5, W = 4e5; char *a, *b, i[R], o[W], *c = o, *d = o + W, h[40], *p = h, y; bool s; struct q{void r(char &x){x = a == b && (b = (a = i) + fread(i, 1, R, stdin), a == b) ? -1 : *a++;} void f(){fwrite(o, 1, c - o, stdout); c = o;} ~q(){f();}void w(char x){*c = x;if (++c == d) f();} q &operator >>(char &x){do r(x);while (x <= 32); return *this;} q &operator >>(char *x){do r(*x); while (*x <= 32); while (*x > 32) r(*++x); *x = 0; return *this;} template<typename t> q&operator>>(t &x){for (r(y),s = 0; !isdigit(y); r(y)) s |= y == 45;if (s) for (x = 0; isdigit(y); r(y)) x = x * 10 - (y ^ 48); else for (x = 0; isdigit(y); r(y)) x = x * 10 + (y ^ 48); return *this;} q &operator <<(char x){w(x);return *this;}q &operator<< (char *x){while (*x) w(*x++); return *this;}q &operator <<(const char *x){while (*x) w(*x++); return *this;}template<typename t> q &operator<< (t x) {if (!x) w(48); else if (x < 0) for (w(45); x; x /= 10) *p++ = 48 | -(x % 10); else for (; x; x /= 10) *p++ = 48 | x % 10; while (p != h) w(*--p);return *this;}}qio; }using nqio::qio;
using namespace std;
const int N = 2e5 + 10;
int n, k, a[N];
void solve() {
set<int> s;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
s.emplace(a[i]);
}
if (s.size() < n) return cout << "NO\n", void(0);
for (int p = 2; p <= n / 2; ++p) {
vector<int> cnt(110, 0);
for (int i = 1; i <= n; ++i) {
++cnt[a[i] % p];
}
int mn = INF;
for (int i = 0; i <= p - 1; ++i) {
mn = min(mn, cnt[i]);
}
if (mn >= 2) return cout << "NO\n", void(0);
}
cout << "YES\n";
}
signed main() {
IOS;
int T;
cin >> T;
while (T--) solve();
}
D.
题意:有两个数组a[1~n]b[1~n],构造一组c[1~n],使得对于i∈[1~n],{a[i],b[i],c[i]}出现次数大于等于两次的数构成一个排列.
手玩可知对于每个i,都要满足每个数在ai, bi, ci中至少出现两次.
如果ai == bi,那么第三个数ci 1 ~ n随便选.
否则,ci只能选择ai 或者 bi,如果我们选择了ai,那么必须在另外一个点选择bi,如果在另外一个点选择了bi,必须在另外一个点选择被占用的那个数,层层的牵制关系可以表示为一张图,观察图发现,只有基环树才可以满足分配条件,在这种情况下,共有两种方案.
我们用并查集维护图的边数和点数,ai -> bi,如果是自环,那么方案数 * n,如果是基环树, 那么方案数 * 2,否则方案数为0.
#include <bits/stdc++.h>
#define int long long
#define IOS ios::sync_with_stdio(false), cin.tie(0)
#define ll long long
// #define double long double
#define ull unsigned long long
#define PII pair<int, int>
#define PDI pair<double, int>
#define PDD pair<double, double>
#define debug(a) cout << #a << " = " << a << endl
#define point(n) cout << fixed << setprecision(n)
#define all(x) (x).begin(), (x).end()
#define mem(x, y) memset((x), (y), sizeof(x))
#define lbt(x) (x & (-x))
#define SZ(x) ((x).size())
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
namespace nqio{const unsigned R = 4e5, W = 4e5; char *a, *b, i[R], o[W], *c = o, *d = o + W, h[40], *p = h, y; bool s; struct q{void r(char &x){x = a == b && (b = (a = i) + fread(i, 1, R, stdin), a == b) ? -1 : *a++;} void f(){fwrite(o, 1, c - o, stdout); c = o;} ~q(){f();}void w(char x){*c = x;if (++c == d) f();} q &operator >>(char &x){do r(x);while (x <= 32); return *this;} q &operator >>(char *x){do r(*x); while (*x <= 32); while (*x > 32) r(*++x); *x = 0; return *this;} template<typename t> q&operator>>(t &x){for (r(y),s = 0; !isdigit(y); r(y)) s |= y == 45;if (s) for (x = 0; isdigit(y); r(y)) x = x * 10 - (y ^ 48); else for (x = 0; isdigit(y); r(y)) x = x * 10 + (y ^ 48); return *this;} q &operator <<(char x){w(x);return *this;}q &operator<< (char *x){while (*x) w(*x++); return *this;}q &operator <<(const char *x){while (*x) w(*x++); return *this;}template<typename t> q &operator<< (t x) {if (!x) w(48); else if (x < 0) for (w(45); x; x /= 10) *p++ = 48 | -(x % 10); else for (; x; x /= 10) *p++ = 48 | x % 10; while (p != h) w(*--p);return *this;}}qio; }using nqio::qio;
using namespace std;
const int N = 2e5 + 10, MOD = 998244353;
int n, k, a[N], b[N], fa[N], cv[N], ce[N], sl[N];
int find(int x) {
return x == fa[x] ? x : fa[x] = find(fa[x]);
}
void merge(int x, int y) {
int fx = find(x), fy = find(y);
++ce[fy];
if (fx == fy) return;
fa[fx] = fy;
cv[fy] += cv[fx], ce[fy] += ce[fx];
sl[fy] |= sl[fx];
}
void solve() {
cin >> n;
for (int i = 1; i <= n; ++i) cv[i] = 1, ce[i] = 0, fa[i] = i, sl[i] = 0;
for (int i = 1; i <= n; ++i) cin >> a[i];
for (int i = 1; i <= n; ++i) cin >> b[i];
for (int i = 1; i <= n; ++i) {
merge(a[i], b[i]);
if (a[i] == b[i]) sl[find(b[i])] = 1;
}
int ans = 1;
map<int, int> vis;
// for (int i = 1; i <= n; ++i) {
// int fi = find(i);
// cout << fi << " " << ce[fi] << " " << cv[fi] << "\n";
// }
for (int i = 1; i <= n; ++i) {
if (vis[find(i)]) continue;
if (ce[find(i)] != cv[find(i)]) ans = 0;
if (sl[find(i)]) (ans *= n) %= MOD;
else (ans *= 2) %= MOD;
vis[find(i)] = 1;
}
cout << ans << "\n";
}
signed main() {
IOS;
int T;
cin >> T;
while (T--) solve();
}
E.![](https://i-blog.csdnimg.cn/blog_migrate/78e73afde18c512cdebd42cc93f198fe.png)
题意:给定一棵n个节点的无向树,边的编号1~n,k<=n只蝴蝶最开始在不同的节点上,第i秒会发生:1.编号为i的边会等概率定向.2.对于一条已经定向的边,存在起始点有蝴蝶但是终点没有蝴蝶的情况,蝴蝶会沿着该边飞向另一端.3.随机选择两只蝴蝶计算距离,加入答案.求答案的期望值.
我们很容易想到按边处理,可以知道某条边的两端的蝴蝶数只有在处理过这条边之后才会变化,而某条边的贡献就是选择两只的蝴蝶的概率.我们只要求出处理完之后两端的蝴蝶数的期望是多少就行,在这道题,每个点只有一个蝴蝶,也就是说我们只要求出每条边的两点的蝴蝶是否移动就行.
#include <bits/stdc++.h>
#define int long long
#define IOS ios::sync_with_stdio(false), cin.tie(0)
#define ll long long
// #define double long double
#define ull unsigned long long
#define PII pair<int, int>
#define PDI pair<double, int>
#define PDD pair<double, double>
#define debug(a) cout << #a << " = " << a << endl
#define point(n) cout << fixed << setprecision(n)
#define all(x) (x).begin(), (x).end()
#define mem(x, y) memset((x), (y), sizeof(x))
#define lbt(x) (x & (-x))
#define SZ(x) ((x).size())
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
namespace nqio{const unsigned R = 4e5, W = 4e5; char *a, *b, i[R], o[W], *c = o, *d = o + W, h[40], *p = h, y; bool s; struct q{void r(char &x){x = a == b && (b = (a = i) + fread(i, 1, R, stdin), a == b) ? -1 : *a++;} void f(){fwrite(o, 1, c - o, stdout); c = o;} ~q(){f();}void w(char x){*c = x;if (++c == d) f();} q &operator >>(char &x){do r(x);while (x <= 32); return *this;} q &operator >>(char *x){do r(*x); while (*x <= 32); while (*x > 32) r(*++x); *x = 0; return *this;} template<typename t> q&operator>>(t &x){for (r(y),s = 0; !isdigit(y); r(y)) s |= y == 45;if (s) for (x = 0; isdigit(y); r(y)) x = x * 10 - (y ^ 48); else for (x = 0; isdigit(y); r(y)) x = x * 10 + (y ^ 48); return *this;} q &operator <<(char x){w(x);return *this;}q &operator<< (char *x){while (*x) w(*x++); return *this;}q &operator <<(const char *x){while (*x) w(*x++); return *this;}template<typename t> q &operator<< (t x) {if (!x) w(48); else if (x < 0) for (w(45); x; x /= 10) *p++ = 48 | -(x % 10); else for (; x; x /= 10) *p++ = 48 | x % 10; while (p != h) w(*--p);return *this;}}qio; }using nqio::qio;
using namespace std;
const int N = 2e6 + 10, MOD = 998244353;
int n, k, p[N], sz[N], fa[N], ans;
vector<int> g[N];
struct rec {
int x, y;
}edge[N];
int qmi(int a, int k, int p) {
int res = 1;
while (k) {
if (k & 1) res = res * a % p;
k >>= 1;
a = a * a % p;
}
return res;
}
int inv(int x) {
return qmi(x, MOD - 2, MOD);
}
void dfs(int x, int f) {
fa[x] = f;
for (int y : g[x]) {
if (y == f) continue;
dfs(y, x);
sz[x] += sz[y];
}
}
signed main() {
IOS;
cin >> n >> k;
for (int i = 1; i <= k; ++i) {
int x;
cin >> x;
p[x] = sz[x] = 1;
}
int inv2 = inv(2);
for (int i = 1; i <= n - 1; ++i) {
auto &[x, y] = edge[i];
cin >> x >> y;
g[x].emplace_back(y);
g[y].emplace_back(x);
}
dfs(1, 0);
for (int i = 1; i <= n - 1; ++i) {
auto [x, y] = edge[i];
if (fa[x] == y) swap(x, y);
int p1 = p[x] * (MOD + 1 - p[y]) % MOD * inv2 % MOD;
int p2 = p[y] * (MOD + 1 - p[x]) % MOD * inv2 % MOD;
(ans += (MOD + 1 - p1 - p2) * sz[y] % MOD * (k - sz[y]) % MOD) %= MOD;
(ans += p1 * (sz[y] + 1) % MOD * (k - sz[y] - 1) % MOD) %= MOD;
(ans += p2 * (sz[y] - 1) % MOD * (k - sz[y] + 1) % MOD) %= MOD;
p[x] = p[y] = (p[x] + p[y]) * inv2 % MOD;
}
cout << (ans * inv(k) % MOD * inv(k - 1) % MOD * 2 % MOD + MOD) % MOD << "\n";
}
F.
#include <bits/stdc++.h>
#define int long long
#define IOS ios::sync_with_stdio(false), cin.tie(0)
#define ll long long
// #define double long double
#define ull unsigned long long
#define PII pair<int, int>
#define PDI pair<double, int>
#define PDD pair<double, double>
#define debug(a) cout << #a << " = " << a << endl
#define point(n) cout << fixed << setprecision(n)
#define all(x) (x).begin(), (x).end()
#define mem(x, y) memset((x), (y), sizeof(x))
#define lbt(x) (x & (-x))
#define SZ(x) ((x).size())
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
namespace nqio{const unsigned R = 4e5, W = 4e5; char *a, *b, i[R], o[W], *c = o, *d = o + W, h[40], *p = h, y; bool s; struct q{void r(char &x){x = a == b && (b = (a = i) + fread(i, 1, R, stdin), a == b) ? -1 : *a++;} void f(){fwrite(o, 1, c - o, stdout); c = o;} ~q(){f();}void w(char x){*c = x;if (++c == d) f();} q &operator >>(char &x){do r(x);while (x <= 32); return *this;} q &operator >>(char *x){do r(*x); while (*x <= 32); while (*x > 32) r(*++x); *x = 0; return *this;} template<typename t> q&operator>>(t &x){for (r(y),s = 0; !isdigit(y); r(y)) s |= y == 45;if (s) for (x = 0; isdigit(y); r(y)) x = x * 10 - (y ^ 48); else for (x = 0; isdigit(y); r(y)) x = x * 10 + (y ^ 48); return *this;} q &operator <<(char x){w(x);return *this;}q &operator<< (char *x){while (*x) w(*x++); return *this;}q &operator <<(const char *x){while (*x) w(*x++); return *this;}template<typename t> q &operator<< (t x) {if (!x) w(48); else if (x < 0) for (w(45); x; x /= 10) *p++ = 48 | -(x % 10); else for (; x; x /= 10) *p++ = 48 | x % 10; while (p != h) w(*--p);return *this;}}qio; }using nqio::qio;
using namespace std;
int n, x, y;
bool issub(int a, int b) {
if (a < 0 || b < 0) return 0;
return (a | b) == b;
}
signed main() {
IOS;
cin >> n >> x >> y;
int ans = 0;
for (int t = y; t; t = (t - 1) & y) {
for (int i = 0; i < 21; ++i) {
if (t >> i & 1 && issub(x - (1ll << i), n * t - (1ll << i))) {
ans ^= (1ll << i);
}
}
}
cout << (ans * (n & 1)) << "\n";
}